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

287 papers48 papers in the last four weeks, up 17% on the four weeks before. 0.3% of all new papers.

  1. Lifting PCA in the Wasserstein Space

    Oct 21, 2026Jérémie Bigot, Clément BonetPrincipal Component AnalysisOptimal Transport

  2. CAVA: Complementary-Label-Aware Data Valuation

    Oct 19, 2026Tan-Ha Mai, Hsuan-Tien Lin, Vu NguyenData ValuationLearning with Noisy Labels

  3. Dynamic Neural Optimal Transport for Subset Alignment

    Oct 16, 2026Austin J. Brockmeier, Bilal RiazOptimal Transport

  4. Vertical Sliced Wasserstein Distances for Meta-Measures

    Oct 14, 2026Elaheh Akbari, Ahmadreza Moradipari, Kyungtae Han +4Wasserstein DistanceOptimal Transport

  5. Quantifying Annotation Agreement in Object Detection with Optimal Transport

    Oct 14, 2026Kirill Prokhorov, Alexandr A. KalininInter-Rater ReliabilityObject Detection

  6. Scaling Online Optimal Transport Minibatches for Flow Matching

    Oct 13, 2026Peter Chen, Sergey LevineFlow MatchingFlow-Based Generative Modeling

  7. SWORD: Scene-Grounded Wasserstein Object-Relation Distance for 3D Scene Graph Prediction

    Oct 13, 2026U-Chae Jun, Jaeeun Ko, Yoonhyuk Choi +13D SGGWasserstein Distance

  8. Guidance Without Labels: Flow Matching from Coupled Gaussian Mixtures

    Oct 12, 2026Stanislas Ducotterd, Bassam El Rawas, Michael UnserFlow MatchingFlow-Based Generative Modeling

  9. OT-FlowRec: Optimal Transport-Guided Multi-Bridge Flow for Multimodal Sequential Recommendation

    Oct 12, 2026Miao SunRecommender SystemsMultimodal Recommendation

  10. Minimum Volume Optimal Transport for Multivariate Conformal Prediction

    Oct 10, 2026Chuchen Zhang, Haojie Ren, Zhaojun Wang +2Conformal PredictionSet Prediction

  11. Disentangling Marginal Capacity from Geometry in Optimal-Transport Label Transfer

    Oct 10, 2026Ali Khodabandeh Yalabadi, Azim Dehghani Amirabad, Artem Moskalev +4Optimal TransportLabel Shift

  12. Some remarks on the connection between generative diffusion and optimal transport

    Oct 9, 2026Giulio Biroli, Marc MézardDiffusion ModelsGenerative Modeling

  13. Representation Alignment from a Few Paired Data via Distilled Optimal Transport

    Oct 8, 2026Julien Kordes, Reuben DorentCross-Modal AlignmentCross-Modal Representation Learning

  14. Barron Optimal Transport I: Generative Modeling

    Oct 7, 2026Evan Dogariu, Joan BrunaOptimal TransportGenerative Modeling

  15. Multi-Agent Coordination via Support-Preserving Distillation

    Oct 7, 2026Sangmin Lee, Youngju Na, Chanmi Lee +1Multi-Agent CoordinationOffline MARL

  16. Trust-Region Optimization for Smooth Potential-Interaction Energies in Wasserstein Space

    Oct 6, 2026You Wan, Ting Gao, Jinqiao DuanTrust-Region OptimizationSecond-Order Optimization

  17. A Neural JKO Scheme for Hellinger-Kantorovich Gradient Flows via Monge-Growth Pairs

    Oct 6, 2026Geuntaek Seo, Cheolhyeong Kim, Hwijae Son +1Neural PDE SolversPDE Solving

  18. Conditional Flow Matching for Transport Between Markov Processes

    Oct 5, 2026Syamantak Kumar, Dheeraj Nagaraj, Saptarshi Roy +1Conditional Flow MatchingDomain Adaptation

  19. Constant-Curvature Sliced Gromov-Wasserstein for Heterogeneous Cross-Curvature Alignment

    Oct 5, 2026Shanglin Li, Wenjing Lu, Muyang Li +2Distribution MatchingGeometric Representation Learning

  20. Beyond Transport Cost: Routing Differences between Flow Matching and Optimal Transport

    Oct 5, 2026Eungyeol Han, Jong-Seok LeeFlow MatchingFlow-Based Generative Modeling

  21. What Does Fréchet Distance Measure? A Directional Decomposition

    Oct 4, 2026Yunghee Lee, Jaeyeon KimImage Generation EvaluationOptimal Transport

  22. Discrete Action Matching: Learning Stochastic Dynamics from Samples via State Graphs

    Oct 4, 2026Mikhail Persiianov, Alexander KorotinLatent Dynamics ModelingOptimal Transport

  23. GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport

    Oct 3, 2026Yifan Xu, Shiqian MaOptimal TransportGPU Acceleration

  24. TacOT: Learning Contact-Rich Dexterous Manipulation from Human Demonstrations via Tactile-Guided Optimal Transport

    Oct 3, 2026Xingting Li, Yifan Han, Zijian Lin +4Human-to-Robot Motion ImitationContact-Rich Robotic Manipulation

  25. Adaptive Bregman Alternating Projections for Feasible Gromov-Wasserstein Learning

    Oct 3, 2026Aoran Zhang, César A. UribeOptimal Transport

  26. Light Entropic Optimal Transport on Riemannian Manifolds

    Oct 2, 2026Xavier Aramayo-Carrasco, Petr Mokrov, Alexander KorotinOptimal Transport