Sarang Joshi
Martin Bauer
Boris Khesin
Gerard Misiolek
Geometric hydrodynamics
Riemannian geometry
of diffeomorphisms
Information geometry
Riemannian geometry
of statistics
Arnold (1966)
Rao (1945), Amari (1968)
(Topic of the talk)
Probability densities
\[\mathrm{Prob}(M)=\{ \mu\in\Omega^n(M)\mid \mu>0, \int_M \mu = 1\}\]
Diffeomorphisms
\[\mathrm{Diff}(M)=\{ \varphi\in C^\infty(M,M)\mid \text{smooth }\varphi^{-1}\}\]
\(M\) compact (Riemannian) manifold
Two versions:
\(\pi(\varphi) = \varphi_*\mu_0\) (left action)
\(\pi(\varphi) = \varphi^*\mu_0\) (right action)
Relevant in optimal mass transport
Relevant in information geometry
Monge problem, \(L^2\) version
Symmetric by change of variables
Riemannian metric
Induces metric
[Benamou & Brenier (2000), Otto (2001)]
Invariance: \(\eta\in\mathrm{Diff}_{\mu_0}(M)\)
Exactly \(L^2\)-Wasserstein distance
Wasserstein
Fisher-Rao
Dependent on Riemannian structure of \(M\)
Independent of Riemannian structure of \(M \Rightarrow \mathrm{Diff}(M)\)-invariance
[Khesin, Lenells, Misiolek, Preston, 2013]
\(\dot H\) degenerate metric
Wanted: non-degenerate descending metric
[M., 2015]
Natural idea: Hodge decomposition for horizontal directions
Theorem: geodesics are locally well-posed
Theorem:
Any \(\varphi\in\mathrm{Diff}^s(M)\) admits unique factorization \[\varphi = \eta\circ\mathrm{Exp}_{\mathrm{id}}(\nabla f)\]
solves OIT problem
Theorem: solution to optimal information transport is \(\varphi(1)\) where \(\varphi(t)\) fulfills
where \(\mu(t)\) is Fisher-Rao geodesic between \(\mu_0\) and \(\mu_1\)
Leads to numerical time-stepping scheme: Poisson problem at each time step
MATLAB code: github.com/kmodin/oit-random
Problem 1: given \(\mu_1\in\mathrm{Prob}(M)\) generate \(N\) samples from \(\mu_1\)
Most cases: use Monte-Carlo based methods
Special case here:
transport map approach
might be useful
[Bauer, Joshi, M., 2017]
Problem 1': given \(\mu_1\in\mathrm{Prob}(M)\) find \(\varphi\in\mathrm{Diff}(M)\) such that
Method:
Diffeomorphism \(\varphi\) not unique!
Problem 1'': given \(\mu_1\in\mathrm{Prob}(M)\) find \(\varphi\in\mathrm{Diff}(M)\) minimizing
under constraint \(\varphi_*\mu_0 = \mu_1\)
Studied case: (Moselhy and Marzouk 2012, Reich 2013, ...)
Our notion:
Warp computation time (256*256 gridsize, 100 time-steps): ~1s
Sample computation time (10^7 samples): < 1s
[M., 2017]
Explicit distance function
Geodesic equation
fiber
fiber
Principal bundle
Right action of GL(n) on P(n)
horizontal slice
fiber
fiber
horizontal slice
fiber
fiber
References:
Slides available at: slides.com/kmodin