BM$^2$: Coupled Schrödinger Bridge Matching
- URL: http://arxiv.org/abs/2409.09376v1
- Date: Sat, 14 Sep 2024 08:57:46 GMT
- Title: BM$^2$: Coupled Schrödinger Bridge Matching
- Authors: Stefano Peluchetti,
- Abstract summary: We introduce a simple emphnon-iterative approach for learning Schr"odinger bridges with neural networks.
A preliminary theoretical analysis of the convergence properties of BM$2$ is carried out, supported by numerical experiments.
- Score: 4.831663144935879
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A Schr\"{o}dinger bridge establishes a dynamic transport map between two target distributions via a reference process, simultaneously solving an associated entropic optimal transport problem. We consider the setting where samples from the target distributions are available, and the reference diffusion process admits tractable dynamics. We thus introduce Coupled Bridge Matching (BM$^2$), a simple \emph{non-iterative} approach for learning Schr\"{o}dinger bridges with neural networks. A preliminary theoretical analysis of the convergence properties of BM$^2$ is carried out, supported by numerical experiments that demonstrate the effectiveness of our proposal.
Related papers
- Through the Looking Glass: Mirror Schrödinger Bridges [16.05211717546091]
Resampling from a target measure whose density is unknown is a fundamental problem in mathematical statistics and machine learning.
We propose a new model for conditional resampling called mirror Schr"odinger bridges.
arXiv Detail & Related papers (2024-10-09T15:48:56Z) - Plug-in estimation of Schrödinger bridges [15.685006881635209]
We propose a procedure for estimating the Schr"odinger bridge between two probability distributions.
We show that our proposal, which we call the emphSinkhorn bridge, provably estimates the Schr"odinger bridge with a rate of convergence that depends on the intrinsic dimensionality of the target measure.
arXiv Detail & Related papers (2024-08-21T15:07:25Z) - Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
We tackle the task of sampling from a probability density as transporting a tractable density function to the target.
We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions.
PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
arXiv Detail & Related papers (2024-07-10T17:39:50Z) - Control, Transport and Sampling: Towards Better Loss Design [10.732151772173083]
We propose objective functions that can be used to transport $nu$ to $mu$, via optimally controlled dynamics.
We highlight the importance of the pathwise perspective and the role various optimality conditions on the path measure can play for the design of valid training losses.
arXiv Detail & Related papers (2024-05-22T15:24:48Z) - Soft-constrained Schrodinger Bridge: a Stochastic Control Approach [4.922305511803267]
Schr"odinger bridge can be viewed as a continuous-time control problem where the goal is to find an optimally controlled diffusion process.
We propose to generalize this problem by allowing the terminal distribution to differ from the target but penalizing the Kullback-Leibler divergence between the two distributions.
One application is the development of robust generative diffusion models.
arXiv Detail & Related papers (2024-03-04T04:10:24Z) - Light and Optimal Schrödinger Bridge Matching [67.93806073192938]
We propose a novel procedure to learn Schr"odinger Bridges (SB) which we call the textbf Schr"odinger bridge matching.
We show that the optimal bridge matching objective coincides with the recently discovered energy-based modeling (EBM) objectives to learn EOT/SB.
We develop a light solver (which we call LightSB-M) to implement optimal matching in practice using the mixture parameterization of the Schr"odinger potential.
arXiv Detail & Related papers (2024-02-05T17:17:57Z) - Generalized Schrödinger Bridge Matching [54.171931505066]
Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning.
We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances.
We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
arXiv Detail & Related papers (2023-10-03T17:42:11Z) - Neural Inverse Kinematics [72.85330210991508]
Inverse kinematic (IK) methods recover the parameters of the joints, given the desired position of selected elements in the kinematic chain.
We propose a neural IK method that employs the hierarchical structure of the problem to sequentially sample valid joint angles conditioned on the desired position.
arXiv Detail & Related papers (2022-05-22T14:44:07Z) - Density Ratio Estimation via Infinitesimal Classification [85.08255198145304]
We propose DRE-infty, a divide-and-conquer approach to reduce Density ratio estimation (DRE) to a series of easier subproblems.
Inspired by Monte Carlo methods, we smoothly interpolate between the two distributions via an infinite continuum of intermediate bridge distributions.
We show that our approach performs well on downstream tasks such as mutual information estimation and energy-based modeling on complex, high-dimensional datasets.
arXiv Detail & Related papers (2021-11-22T06:26:29Z) - Deep Generative Learning via Schr\"{o}dinger Bridge [14.138796631423954]
We learn a generative model via entropy with a Schr"odinger Bridge.
We show that the generative model via Schr"odinger Bridge is comparable with state-of-the-art GANs.
arXiv Detail & Related papers (2021-06-19T03:35:42Z) - Continuous Regularized Wasserstein Barycenters [51.620781112674024]
We introduce a new dual formulation for the regularized Wasserstein barycenter problem.
We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems.
arXiv Detail & Related papers (2020-08-28T08:28:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.