Overview

Optimal transport studies how probability mass can be moved between distributions at minimum cost, giving a geometric way to compare data even when samples do not correspond one-to-one. Wasserstein distances and transport maps describe this geometry, while Gromov–Wasserstein methods compare relational structure when data live in different spaces. Practical approaches include entropic regularization with Sinkhorn algorithms, sliced and low-rank approximations, and neural transport maps used in generative modeling, domain adaptation, and trajectory inference. A central challenge is balancing computational and statistical scalability with faithful transport, especially when choosing regularization or relaxing exact mass constraints.

Latest papers

CardsList

314 papers28 papers in the last four weeks, down 53% on the four weeks before. 0.2% of all new papers.

  1. DistDF: Time-Series Forecasting Needs Joint-Distribution Wasserstein Alignment

    Oct 28, 2025Hao Wang, Licheng Pan, Yuan Lu +7Time Series ForecastingOptimal Transport

  2. AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transport

    Oct 16, 2025Lingkai Kong, Molei Tao, Yang Liu +4Generative ModelingFlow-Based Generative Modeling

  3. OT-MeanFlow3D: Bridging Optimal Transport and Meanflow for Efficient 3D Point Cloud Generation

    Sep 26, 2025Elaheh Akbari, Shansita Sharma, Ping He +5Point Cloud GenerationFlow-Based Generative Modeling

  4. Differentiable Expectation-Maximisation and Applications to Gaussian Mixture Model Optimal Transport

    Sep 2, 2025Samuel Boïté, Eloi Tanguy, Julie Delon +2Gaussian Mixture ModelsExpectation-Maximization

  5. Learning from samples: inverse problems over measures

    May 11, 2025Francisco Andrade, Gabriel Peyré, Clarice PoonInverse Optimal TransportInverse Problems

  6. Double-Bounded Nonlinear Optimal Transport for Size Constrained Min Cut Clusterin

    Jan 30, 2025Fangyuan Xie, Jinghui Yuan, Feiping Nie +1Frank-Wolfe AlgorithmsGraph Clustering

  7. Robustness and Structure Preservation in Flow-Based Generative Models via Wasserstein Path-Space Divergences

    Oct 2, 2024Ziyu Chen, Markos A. Katsoulakis, Benjamin J. ZhangFlow MatchingEquivariant Neural Networks

  8. Multi-view Optimal Transport for Multi-view Crowd Localization and Tracking

    Sep 3, 2024Kaiyi Zhang, Qi Zhang, Jixuan Chen +2Multi-Object TrackingOptimal Transport

  9. CombAlign: Enhancing Model Expressiveness in Unsupervised Graph Alignment

    Jun 19, 2024Songyang Chen, Yu Liu, Lei Zou +2Graph MatchingOptimal Transport

  10. Optimal Transport Aggregation for Distributed Mixture-of-Experts

    Dec 15, 2023Faïcel Chamroukhi, Nhat Thien PhamMixture-of-Experts ModelsOptimal Transport

  11. Structured Approximations of Measures

    Oct 13, 2023Keaton Hamm, Varun KhuranaOptimal TransportWasserstein Distance

  12. Linearized Wasserstein dimensionality reduction with approximation guarantees

    Feb 14, 2023Alexander Cloninger, Keaton Hamm, Varun Khurana +1Dimensionality ReductionManifold Learning

  13. Deep Residual Networks Learn the Geodesic Curve in the Wasserstein Space

    Feb 18, 2021Kuo Gai, Shihua ZhangResidual LearningNeural Network Training Dynamics