The Schr\"odinger Bridge between Gaussian Measures has a Closed Form

• URL: http://arxiv.org/abs/2202.05722v2
• Date: Fri, 31 Mar 2023 07:46:26 GMT
• Title: The Schr\"odinger Bridge between Gaussian Measures has a Closed Form
• Authors: Charlotte Bunne, Ya-Ping Hsieh, Marco Cuturi, Andreas Krause
• Abstract summary: We focus on the dynamic formulation of OT, also known as the Schr"odinger bridge (SB) problem. In this paper, we provide closed-form expressions for SBs between Gaussian measures.
• Score: 101.79851806388699
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The static optimal transport $(\mathrm{OT})$ problem between Gaussians seeks to recover an optimal map, or more generally a coupling, to morph a Gaussian into another. It has been well studied and applied to a wide variety of tasks. Here we focus on the dynamic formulation of OT, also known as the Schr\"odinger bridge (SB) problem, which has recently seen a surge of interest in machine learning due to its connections with diffusion-based generative models. In contrast to the static setting, much less is known about the dynamic setting, even for Gaussian distributions. In this paper, we provide closed-form expressions for SBs between Gaussian measures. In contrast to the static Gaussian OT problem, which can be simply reduced to studying convex programs, our framework for solving SBs requires significantly more involved tools such as Riemannian geometry and generator theory. Notably, we establish that the solutions of SBs between Gaussian measures are themselves Gaussian processes with explicit mean and covariance kernels, and thus are readily amenable for many downstream applications such as generative modeling or interpolation. To demonstrate the utility, we devise a new method for modeling the evolution of single-cell genomics data and report significantly improved numerical stability compared to existing SB-based approaches.

Related papers

• GaussianSpa: An "Optimizing-Sparsifying" Simplification Framework for Compact and High-Quality 3D Gaussian Splatting [12.342660713851227]
  3D Gaussian Splatting (3DGS) has emerged as a mainstream for novel view synthesis, leveraging continuous aggregations of Gaussian functions. 3DGS suffers from substantial memory requirements to store the multitude of Gaussians, hindering its practicality. We introduce GaussianSpa, an optimization-based simplification framework for compact and high-quality 3DGS.
  arXiv  Detail & Related papers  (2024-11-09T00:38:06Z)
• Learning Mixtures of Gaussians Using Diffusion Models [9.118706387430883]
  We give a new algorithm for learning mixtures of $k$ Gaussians to TV error. Our approach is analytic and relies on the framework of diffusion models.
  arXiv  Detail & Related papers  (2024-04-29T17:00:20Z)
• Gaussian Mixture Solvers for Diffusion Models [84.83349474361204]
  We introduce a novel class of SDE-based solvers called GMS for diffusion models. Our solver outperforms numerous SDE-based solvers in terms of sample quality in image generation and stroke-based synthesis.
  arXiv  Detail & Related papers  (2023-11-02T02:05:38Z)
• Scaling Riemannian Diffusion Models [68.52820280448991]
  We show that our method enables us to scale to high dimensional tasks on nontrivial manifold. We model QCD densities on $SU(n)$ lattices and contrastively learned embeddings on high dimensional hyperspheres.
  arXiv  Detail & Related papers  (2023-10-30T21:27:53Z)
• Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees [57.67528738886731]
  We study the numerical stability of scalable sparse approximations based on inducing points. For low-dimensional tasks such as geospatial modeling, we propose an automated method for computing inducing points satisfying these conditions.
  arXiv  Detail & Related papers  (2022-10-14T15:20:17Z)
• Riemannian Score-Based Generative Modeling [56.20669989459281]
  We introduce score-based generative models (SGMs) demonstrating remarkable empirical performance. Current SGMs make the underlying assumption that the data is supported on a Euclidean manifold with flat geometry. This prevents the use of these models for applications in robotics, geoscience or protein modeling.
  arXiv  Detail & Related papers  (2022-02-06T11:57:39Z)
• A Riemannian Newton Trust-Region Method for Fitting Gaussian Mixture Models [0.0]
  We introduce a formula for the Riemannian Hessian for Gaussian Mixture Models. On top, we propose a new Newton Trust-Region method which outperforms current approaches both in terms of runtime and number of iterations.
  arXiv  Detail & Related papers  (2021-04-30T12:48:32Z)
• Mat\'ern Gaussian Processes on Graphs [67.13902825728718]
  We leverage the partial differential equation characterization of Mat'ern Gaussian processes to study their analog for undirected graphs. We show that the resulting Gaussian processes inherit various attractive properties of their Euclidean and Euclidian analogs. This enables graph Mat'ern Gaussian processes to be employed in mini-batch and non-conjugate settings.
  arXiv  Detail & Related papers  (2020-10-29T13:08:07Z)

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.