Agents
A Generalized Sinkhorn Algorithm for Mean-Field Schrodinger Bridge
arXiv:2604.06531v2 Announce Type: cross Abstract: The mean-field Schrodinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal intera
arXiv:2604.06531v2 Announce Type: cross Abstract: The mean-field Schrodinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution from another by a fixed deadline. Unlike the standard Schrodinger bridge, the dynamical constraint for MFSB is the mean-field limit of a population of interacting agents with controls. It serves as a natural model for large-scale multi-agent systems. The MFSB is computationally challenging because the nonlocal interaction makes the problem nonconvex. We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm. We present numerical examples with repulsive and attractive interactions to illustrate the theoretical contributions.
Related
- Continuous-Time Dynamics of the Difference-of-Convex Algorithm
- Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems
Source: arXiv cs.LG | 2026-04-10