Wasserstein Proximal Algorithms for the Schr\"{o}dinger Bridge Problem: Density Control with Nonlinear Drift
Kenneth F. Caluya, and Abhishek Halder

TL;DR
This paper introduces a novel approach using Wasserstein proximal algorithms to solve the Schr"{o}dinger bridge problem with nonlinear dynamics, enabling efficient density control through PDE transformations and fixed point methods.
Contribution
It develops a new reduction of the SBP to initial value problems for specific nonlinear drifts, leveraging proximal algorithms and geometric insights for numerical solutions.
Findings
Effective transformation of PDEs into IVPs for certain drifts.
Numerical algorithms successfully solve SBPs with nonlinear dynamics.
Demonstrations via numerical examples validate the approach.
Abstract
We study the Schr\"{o}dinger bridge problem (SBP) with nonlinear prior dynamics. In control-theoretic language, this is a problem of minimum effort steering of a given joint state probability density function (PDF) to another over a finite time horizon, subject to a controlled stochastic differential evolution of the state vector. For generic nonlinear drift, we reduce the SBP to solving a system of forward and backward Kolmogorov partial differential equations (PDEs) that are coupled through the boundary conditions, with unknowns being the "Schr\"{o}dinger factors" -- so named since their product at any time yields the optimal controlled joint state PDF at that time. We show that if the drift is a gradient vector field, or is of mixed conservative-dissipative nature, then it is possible to transform these PDEs into a pair of initial value problems (IVPs) involving the same forward…
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.
