OpenAlex ·
Approximation and computation of the geodesic Sinkhorn distance
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.02007
- Original
- Read it at the publisher
- Topics
Abstract
In [H. Lavenant, J. Luckhardt, G. Mordant, B. Schmitzer, L. Tamanini, The Riemannian geometry of Sinkhorn divergences. Ann. Inst. H. Poincaré Anal. Non Linéaire 43 (2026)] we introduced a Riemannian metric $\mathsf{d}_S$ on the space of probability distributions obtained from entropic optimal transport, specifically from the Sinkhorn divergence $S_\varepsilon$. In the present work we discuss how to approximate and compute $\mathsf{d}_S$. Spatially, we prove Gromov--Hausdorff convergence of the metric and convergence of geodesics for increasingly fine Eulerian discretization of the base space. Temporally, we show $Γ$-convergence of the chain discretization $N \sum_{k=0}^{N-1} S_\varepsilon(μ_k, μ_{k+1})$ to the energy functional defining $\mathsf{d}_S$. We deduce and implement numerical schemes to compute approximations of $\mathsf{d}_S$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
On the Pricing of American Options under Stochastic Local Volatility and Stochastic Correlation via the RBSDE Framework
A hybrid CNN-adjoint optimization framework for reconstruction of viscoelastic tissue properties in magnetic resonance elastography
Kolmogorov-Arnold Networks for Free-Boundary Partial Differential Equations
Latent Score-Based Bayesian Cramér-Rao Bound Estimation for High-Dimensional Imaging Systems
Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.