Planning Using Schr\"odinger Bridge Diffusion Models
Adarsh Srivastava

TL;DR
This paper introduces a novel planning approach using Schr"odinger bridge diffusion models, which incorporate environment priors to improve sampling efficiency and reduce training costs in offline planning tasks.
Contribution
It adapts Schr"odinger bridge formulations from image-to-image translation to planning, enabling more efficient policy learning with priors.
Findings
Improved sampling efficiency over traditional diffusion models.
Effective incorporation of environment priors in planning.
Competitive performance compared to DDPM-based methods.
Abstract
Offline planning often struggles with poor sampling efficiency as it tries to learn policies from scratch. Especially with diffusion models, such cold start practices mean that both training and sampling become very expensive. We hypothesize that certain environment constraint priors or cheaply available policies make it unnecessary to learn from scratch, and explore a way to incorporate such priors in the learning process. To achieve that, we borrow a variation of the Schr\"odinger bridge formulation from the image-to-image setting and apply it to planning tasks. We study the performance on some planning tasks and compare the performance against the DDPM formulation. The code for this work is available at https://github.com/adrshsrvstv/bridge_diffusion_planning.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectromagnetic Simulation and Numerical Methods · Numerical methods for differential equations
