arXiv Machine Learning

Lifted Schr\"odinger Bridges for Gaussian Mixture Endpoints: Projection Gaps and Path-Space Obstructions

arXiv:2605. 24795v2 Announce Type: replace-cross Abstract: We study stochastic density control between Gaussian-mixture endpoint distributions under Brownian prior dynamics.

arXiv AI
Sep 3

Schr\"odinger Bridges on Lie Group Manifolds for Probabilistic Intrinsic Generation

The paper introduces a probabilistic generative framework called Schr"odinger Bridges on Lie Group Manifolds, enabling direct modeling of non‑Euclidean data without flattening or coordinate inconsistencies. It develops two computational realizations—Wrapped‑Kernel Bridge Calibration for compact Abelian groups and Reciprocal Conditional‑Control Bridge Matching for compact non‑Abelian groups—while providing a modular error bound that separates various sources of approximation error. Experiments on protein, RNA torsions, SO(3), U(n), and protein conformational pathways demonstrate the method’s feasibility and consistency.

By Shizhe Zhang, Mingyang Zhao, Lei Ma
arXiv Machine Learning
Jul 21

Twisted Schr\"odinger Bridge Matching

arXiv:2607. 16987v1 Announce Type: cross Abstract: Over the past few years, diffusion-based Schr\"odinger bridge models have been proposed to approximate optimal transport dynamics between two prescribed boundary distributions, with successful applications to generative modeling.

By Maxence Noble, Marie Scheid, Yazid Janati, Eric Moulines, Alain Durmus
arXiv AI
2d ago

Distributionally Robust Schr\"odinger Bridge

The paper introduces the Distributionally Robust Schr"odinger Bridge (DRSB), a method that learns a single controller capable of handling uncertainty in the initial distribution for stochastic transport tasks. DRSB’s objective combines control energy with a KL penalty on the terminal distribution, and it seeks to minimize the worst‑case value of this objective over an ambiguity set around the nominal initial distribution. The authors derive a variational formulation, connect it to stochastic optimal control and distributionally robust optimization, and propose an alternating algorithm with Wasserstein and Sinkhorn variants. Experiments on two‑dimensional transport and image‑to‑image translation demonstrate improved robustness to input perturbations compared to standard SB, while also achieving lower mean sliced Wasserstein distance on Gaussian mixture transport.

By Jinhwan Sul, Panagiotis Theodoropoulos, Vincent Pacelli, Jaemoo Choi, Evangelos Theodorou
arXiv Machine Learning
Jun 25

Entropy-Controlled Flow Matching

arXiv:2602. 22265v2 Announce Type: replace Abstract: Modern vision generators transport a base distribution to data through time-indexed measures, implemented as deterministic flows (ODEs) or stochastic diffusions (SDEs).

By Chika Maduabuchi
arXiv Machine Learning
Jun 30

Robustness and Structure Preservation in Flow-Based Generative Models via Wasserstein Path-Space Divergences

arXiv:2410. 01244v2 Announce Type: replace-cross Abstract: We introduce a novel Wasserstein-1 ($W_1$) path-space divergence for stochastic and deterministic dynamics and establish a Wasserstein Uncertainty Propagation (WUP) theorem that bounds the $W_1$ distance between terminal distributions by the proposed divergence, equivalently characterized by a weighted $L^2$ discrepancy between the underlying drifts and the $W_1$ distance between their initial measures.

By Ziyu Chen, Markos A. Katsoulakis, Benjamin J. Zhang