Solving Schrödinger Bridges via Maximum Likelihood

by   Francisco Vargas, et al.

The Schrödinger bridge problem (SBP) finds the most likely stochastic evolution between two probability distributions given a prior stochastic evolution. As well as applications in the natural sciences, problems of this kind have important applications in machine learning such as dataset alignment and hypothesis testing. Whilst the theory behind this problem is relatively mature, scalable numerical recipes to estimate the Schrödinger bridge remain an active area of research. We prove an equivalence between the SBP and maximum likelihood estimation enabling direct application of successful machine learning techniques. We propose a numerical procedure to estimate SBPs using Gaussian process and demonstrate the practical usage of our approach in numerical simulations and experiments.


Maximum Likelihood Estimation in Gaussian Process Regression is Ill-Posed

Gaussian process regression underpins countless academic and industrial ...

Maximum Likelihood Estimation of Toric Fano Varieties

We study the maximum likelihood estimation problem for several classes o...

Why Machine Learning Cannot Ignore Maximum Likelihood Estimation

The growth of machine learning as a field has been accelerating with inc...

Optimal Berry-Esséen bound for Maximum likelihood estimation of the drift parameter in α-Brownian bridge

Let T>0,α>1/2. In the present paper we consider the α-Brownian bridge de...

Recovering Stochastic Dynamics via Gaussian Schrödinger Bridges

We propose a new framework to reconstruct a stochastic process {ℙ_t: t ∈...

Likelihood-Free Gaussian Process for Regression

Gaussian process regression can flexibly represent the posterior distrib...

Bridging Maximum Likelihood and Adversarial Learning via α-Divergence

Maximum likelihood (ML) and adversarial learning are two popular approac...