Factored Diffusion Policies:Compositionally Generalized Robot Control with a Single Score Network
Sayan Mitra, Ege Yuceel, Noah Giles, Abhishek Pai

TL;DR
This paper introduces factored diffusion policies that use a single network with additive factor decomposition, enabling efficient and generalizable robot control across diverse task factors with theoretical guarantees.
Contribution
It proposes a novel factored diffusion policy framework with a shared network and a score decomposition method, reducing training complexity and providing formal control guarantees.
Findings
Achieves 90% success on held-out gates, matching an oracle.
Transfers zero-shot to unseen venues with +11.7pp success rate.
Reduces crash rate by 2.4 times in vision-based tasks.
Abstract
Robotic tasks are typically specified by a tuple of factors, such as the object to be grasped, the obstacles to be avoided, the color of the target, and so on. Collecting expert demonstrations for every combination of factor values grows combinatorially. We present factored diffusion policies: a single shared diffusion network trained with per-factor null-token dropout, whose score decomposes additively across factors at inference. Under approximate conditional independence between factors given the action-observation pair, this composition approximates the true joint score with a bounded uniform error, reducing the training-task budget from a product of factor cardinalities to a sum. A trajectory-tube certificate chains this score-level bound through the reverse-time sampling ODE and a contracting tracking controller into a closed-loop state-trajectory tube whose radius factors into an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
