0:00 / 0:00
#diffusionmodels#robotics#generativecontrolpolicies
Do we need diffusion in robotics?
Simons Institute for the Theory of Computing
77K subscribers • 30 videos on Hallway • University channel
- One of the most-watched uploads on Simons Institute, a conference or university channel Hallway lists. Nobody has recommended it in the communities yet, so it ranks below community picks.
- Presented by Max Simchowitz, Carnegie Mellon University
- An opinion. It argues one side of a question engineers disagree on.
Advanced. Deep dive for people who know the field.
9.3K views2 months ago
AI and machine learningNeural networks and deep learningTraining and serving models
Max Simchowitz analyzes whether generative control policies like diffusion are truly necessary for fitting complex action distributions in robotics.
Max Simchowitz (Carnegie Mellon University) simons.berkeley.edu/talks/max-simchowitz-carnegie-mellon-uni… Diffusion Generative Modeling: Progress and Next Steps Recent years have seen tremendous progress in AI-driven robotics. These advancements have been attributed not only to increased data and improved hardware, but also to fundamental algorithmic innovations in the way robots are trained. In this talk, we focus on one specific innovation: the introduction of ""generative control policies"" (GCPs), such as diffusion- and flow-based generative models as parameterizations of robot policies (policies being the mapping from observations to actions). The prevailing wisdom has been that GCPs enable robot policies to fit complex, often-multimodal action distributions that arise from diversely collected data. Through careful experimental and theoretical analysis, we suggest that GCPs routinely do not capture multi-modality in action data. Rather, we demonstrate that the increased performance afforded by GCPs are mediated through specific ""on-manifold"" inductive biases afforded by iterative computation and the incorporation of noise at training. In sum, our findings suggest that flow-based generative modeling offers algorithmic benefits unrelated to distribution matching, and point to the possibility of novel learning formalisms that achieve the same by more direct means.Why it's here
A top upload from a listed channelSimons Institute is on Hallway's list of conference and university channels, and this upload is one of its most-watched talks or lectures. Nobody has recommended it in the communities yet, so it ranks below community picks.