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.
翻译:静态最优输运问题(OT)旨在恢复最优映射或更一般地说,将高斯映射到另一个高斯。它已经得到广泛的研究和应用于各种任务。在这里,我们着重研究了OT的动态配对,也称为Schrödinger桥(SB)问题,由于与基于扩散的生成模型的联系,近来在机器学习中引起了广泛的兴趣。与静态设置相比,即使对于高斯分布,动态设置的了解也要少得多。在本文中,我们提供了高斯度量之间的SB的闭合形式表达式。与简单将静态高斯OT问题简化为研究凸规划相比,我们求解SB的框架需要更多涉及黎曼几何和生成器理论等复杂的工具。值得注意的是,我们建立了高斯度量之间的Schrödinger桥的解决方案是具有明确均值和协方差内核的高斯过程,因此容易适用于许多下游应用,例如生成的建模或插值。为了证明其实用性,我们设计了一种用于建模单细胞基因组数据演化的新方法,并报告了与现有SB-based方法相比显著提高的数值稳定性。