mlsanityData to 7 Oct 2026

Entropic Riemannian Neural Optimal Transport

arXiv 2605.04255 ↗First posted 5 May 2026stat.ML cs.LG stat.MEcited by 0

Not on the map. Why?

Abstract (arXiv)

Many machine learning problems involve data supported on curved spaces such as spheres, rotation groups, hyperbolic spaces, and general Riemannian manifolds, where Euclidean geometry can distort distances, averages, and the resulting optimal transport (OT) problem. Existing manifold OT methods have pursued amortized out-of-sample maps, while entropic regularization has made discrete OT more scalable, but these advantages have remained largely disjoint. We propose Entropic Riemannian Neural Optimal Transport (Entropic RNOT), a unified framework that combines intrinsic entropic OT with amortized out-of-sample evaluation on Riemannian manifolds. Our method learns a single target-side Schr"odinger potential through a neural pullback parameterization, recovers the induced Gibbs coupling, and uses the resulting conditional laws to construct intrinsic transport surrogates. These include barycentric projections on Cartan-Hadamard manifolds and heat-smoothed conditional surrogates on stochastically complete manifolds, the latter turning possibly atomic target laws into absolutely continuous ones. For fixed regularization varepsilon>0, we prove that the proposed hypothesis class recovers the entropic optimal coupling in strong probabilistic metrics. As consequences, barycentric surrogates converge in L2, while heat-smoothed surrogates are stable at fixed heat time and asymptotically unbiased as the heat time vanishes. The guarantees hold for compactly supported data on possibly noncompact manifolds. Empirically, our method matches or improves over Euclidean, tangent-space, and log-Euclidean baselines on benchmarks over mathbbS2, SO(3), SPD(3), SE(3), and mathbbH2, scales favorably relative to discrete manifold Sinkhorn, and in a protein-ligand docking application, refines poses on SE(3) without retraining or per-instance optimization.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 28 references that are in the map. First posted on arXiv 5 May 2026.

Builds on

10 of 28 references.

References · 10

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
  4. 2022DiffDock: Diffusion Steps, Twists, and Turns for Molecular Dockingcited by 307
  5. 2018Universality of Deep Convolutional Neural Networkscited by 176
  6. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 96
  7. 2020Non-Euclidean Universal Approximationcited by 29
  8. 2018Semi-dual Regularized Optimal Transportcited by 26
  9. 2021Implicit Riemannian Concave Potential Mapscited by 10
  10. 2026Riemannian Neural Optimal Transportcited by 1

Built on by

Not cited yet.