mlsanityData to 7 Oct 2026

Distributionally Robust Schr"odinger Bridge

arXiv 2610.02043 ↗First posted 1 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Schr"odinger bridge (SB) learns stochastic transport between prescribed initial and target distributions. When the initial distribution shifts at test time, the learned dynamics can fail to recover the target distribution. We introduce the Distributionally Robust Schr"odinger Bridge (DRSB), which learns a single controller that accounts for uncertainty in the initial distribution. The DRSB objective consists of control energy and a KL penalty between the resulting terminal distribution and the target distribution. DRSB seeks a single controller that minimizes the worst-case value of this objective as the initial distribution varies within an ambiguity set around the nominal distribution. We derive an exact variational formulation of this objective and connect its fixed-terminal-cost subproblem to stochastic optimal control and distributionally robust optimization. This formulation motivates an alternating algorithm that updates the adversarial initial distribution, estimates the terminal log-density ratio, and trains the controller. We develop Wasserstein and Sinkhorn variants using stochastic control optimality conditions to approximate the gradients required for adversarial updates. Experiments on two-dimensional transport tasks and image-to-image translation show improved robustness to input perturbations relative to standard SB, with a tradeoff in nominal performance. On Gaussian mixture transport, Sinkhorn DRSB also achieves lower mean sliced Wasserstein distance than fixed-level noise augmentation at both tested unseen noise levels.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 38 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

22 of 38 references.

References · 22

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  5. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
  6. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  7. 2024Adjoint Matching: Fine-tuning Flow and Diffusion Generative Models with Memoryless Stochastic Optimal Controlcited by 222
  8. 2023I2SB: Image-to-Image Schr"odinger Bridgecited by 214
  9. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  10. 2020Adversarial Latent Autoencoderscited by 155
  11. 2023Diffusion Schr"odinger Bridge Matchingcited by 151
  12. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
10 more
  1. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
  2. 2022Deep Generalized Schr"odinger Bridgecited by 47
  3. 2020Outlier-Robust Optimal Transportcited by 45
  4. 2024Light and Optimal Schr"odinger Bridge Matchingcited by 45
  5. 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 39
  6. 2021Sinkhorn Distributionally Robust Optimizationcited by 38
  7. 2025Adjoint Schr"odinger Bridge Samplercited by 20
  8. 2022A Short and General Duality Proof for Wasserstein Distributionally Robust Optimizationcited by 12
  9. 2024Soft-constrained Schrodinger Bridge: a Stochastic Control Approachcited by 8
  10. 2024Feedback Schr"odinger Bridge Matchingcited by 4

Built on by

Not cited yet.