arXiv Machine Learning

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.

arXiv AI
Aug 11

SDDBMs: Soft Denoising Diffusion Bridge Models

arXiv:2608. 08594v1 Announce Type: new Abstract: Diffusion bridge models leverage Doob's \(h\)-transform to construct stochastic transports between arbitrary endpoint distributions, and have shown strong potential in image-to-image translation and restoration.

By Shiyi Qi, Kun He, Mingmou Liu
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
Aug 27

Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling

The paper introduces Hessian-free high-resolution (HFHR) dynamics, an extension of underdamped Langevin dynamics that incorporates reversible position diffusion for sampling in machine learning. It provides an explicit quantitative contraction rate under a position Poincaré inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, even when the potential is non‑convex. For the HFHR Monte Carlo algorithm, a path‑space Girsanov argument yields a non‑asymptotic convergence bound and an explicit iteration complexity in total variation distance, improving on previous HFHR results and demonstrating benefits of a positive diffusion parameter through numerical experiments.

By Wujun Lv, Xiaoyu Wang, Yingli Wang, Lingjiong Zhu
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