Entropic optimal transport beyond product reference couplings: the Gaussian case on Euclidean space
Not on the map. Why?
Abstract (arXiv)
The Optimal Transport (OT) problem with squared Euclidean cost consists in finding a coupling between two input measures that maximizes correlation. Consequently, the optimal coupling is often singular with respect to the Lebesgue measure. Regularizing the OT problem with an entropy term yields an approximation called entropic optimal transport. Entropic penalties steer the induced coupling toward a reference measure with desired properties. For instance, when seeking a diffuse coupling, the most popular reference measures are the Lebesgue measure and the product of the two input measures. In this work, we study the case where the reference coupling is not a product, focussing on the Gaussian case as a core paradigm. We establish a reduction of such a regularised OT problem to a matrix optimization problem, enabling us to provide a complete description of the solution, both in terms of the primal variable and the dual variables. Beyond its intrinsic interest, allowing non-product references is essential in dynamic statistical settings. As a key motivation, we address the reconstruction of trajectory dynamics from finitely many time marginals where, unlike product references, Gaussian process references produce transitions that assemble into a coherent continuous-time process.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 37 references that are in the map. First posted on arXiv 2 Jul 2025.
Builds on
12 of 37 references.
References · 12
- 2021Convex optimizationcited by 2,479
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
- 2024Statistical optimal transportcited by 44
- 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
- 2020Debiased Sinkhorn barycenterscited by 34
- 2020Entropy-Regularized 2-Wasserstein Distance between Gaussian Measurescited by 32
- 2019Schr"odinger Bridge Samplerscited by 14
- 2020The statistical effect of entropic regularization in optimal transportationcited by 14
- 2025Trajectory Inference with Smooth Schr"odinger Bridgescited by 10
- 2020Entropic regularization of Wasserstein distance between infinite-dimensional Gaussian measures and Gaussian processescited by 8
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Sliced-Regularized Optimal Transportcited by 2
- 2026SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transportcited by 0
- 2026SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport28 Aug 2026
- 2026Sliced-Regularized Optimal Transport27 Apr 2026