arXiv Machine Learning
Stability of the Monge Map in Semi-Dual Optimal Transport
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
4d ago
Convex Physics Informed Neural Networks for the Monge-Amp\`ere Optimal Transport Problem
arXiv:2501.10162v3 Announce Type: replace-cross Abstract: Optimal transportation of raw material from suppliers to customers is an issue arising in logistics that is addressed here with a continuous...
arXiv Statistics ML
2d ago
A Unified Kantorovich Duality for Multimarginal Optimal Transport
arXiv:2601. 17171v2 Announce Type: replace-cross Abstract: We study Kantorovich duality for multimarginal optimal transport (MOT) with bounded continuous cost functions.
arXiv Machine Learning
Jun 25
Sample complexity of unbalanced entropic OT
arXiv:2606. 24987v1 Announce Type: cross Abstract: Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed mass and subject to unfavorable high-dimensional sample complexity.
arXiv Machine Learning
Jun 5
Variational Entropic Optimal Transport
arXiv:2602. 02241v2 Announce Type: replace Abstract: Entropic optimal transport (EOT) in continuous spaces with quadratic cost is a classical tool for solving the domain translation problem.
arXiv Statistics ML
Aug 27
Continuum-marginal optimal transport: a mesh-free kernel method
The paper introduces a mesh‑free kernel method for continuum‑marginal optimal transport, aiming to recover the minimum‑energy velocity field that reproduces a continuous family of probability marginals. By embedding the weak continuity equation into a reproducing kernel Hilbert space, the authors obtain a sample‑only objective that eliminates spatial discretization. The velocity is represented via a linear‑in‑parameters dictionary or neural network and optimized with mini‑batch stochastic techniques, achieving accurate drift recovery and marginal consistency in synthetic experiments, and the framework also extends to the Nelson problem of stochastic optimal transport.
arXiv AI
Jun 16
Optimal Transport for Machine Learners
arXiv:2505. 06589v2 Announce Type: replace-cross Abstract: Modern machine learning repeatedly manipulates probability measures: empirical datasets, generated samples, latent distributions, class-conditional laws, particle systems, weights of wide networks and attention patterns.