Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving Schrödinger Bridges via Maximum Likelihood (2106.02081v9)

Published 3 Jun 2021 in stat.ML and cs.LG

Abstract: The Schr\"odinger 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\"odinger 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Francisco Vargas (25 papers)
  2. Pierre Thodoroff (7 papers)
  3. Neil D. Lawrence (68 papers)
  4. Austen Lamacraft (35 papers)
Citations (117)

Summary

We haven't generated a summary for this paper yet.