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. Complex Schrödinger Bridges

    Nov 13, 2026Dong-Sig Han, Tolga BirdalSchrödinger BridgesDiffusion Models

  2. UniOMA: Unified Optimal-Transport Multi-Modal Structural Alignment for Robot Perception

    Nov 9, 2026Xinrui Zu, Mark Hoogendoorn, Kevin Sebastian Luck +1Cross-Modal AlignmentRobotic Perception

  3. Identifiable alignment of unpaired representations

    Nov 8, 2026Stas Syrota, Albert Lopez I Serrano, Johanne Franck +1single-cell representation learningRepresentation Alignment

  4. Confronting Uncertainty in Mechanism-AI Coupled Dynamical Systems via Optimal Transport and Information Geometry: Part I. Distribution Learning

    Nov 7, 2026Pengfei Song, Yanni Xiao, Shuangshuang YinUncertainty QuantificationDynamical Systems

  5. Fixed-point acceleration on Neural Wasserstein manifolds

    Nov 6, 2026Vitalii Aksenov, Sebastian Gutierrez HernandezInference AccelerationRiemannian Optimization

  6. Transporting the Past: An Optimal Transport View of Backtracking Counterfactuals

    Nov 5, 2026Zhangyi Liu, Pouria Fatemi, Suvrit SraCounterfactual ReasoningCausal Counterfactual Generation

  7. FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning

    Nov 4, 2026Quan Minh Nguyen, Hoang M. Ngo, Bhakti Chowkwale +2Federated Learning AggregationFederated Learning

  8. When Are Two SAE Latents the Same Feature?

    Nov 3, 2026Alexandra Suvorikova, Ilgam Latypov, Anton Trukhan +1Sparse AutoencodersLatent Space Alignment

  9. Text-Assisted Event Stream Visual Place Recognition via Multi-Scale Spatiotemporal Optimal Transport

    Nov 1, 2026Lan Chen, Xingxing Xiong, Xiao Wang +5Visual Place RecognitionEvent-Based Vision

  10. Underdamped Stochastic Optimal Transport with Landauer boundary conditions: machine learning and analytical solution

    Oct 30, 2026Julia Sanders, Dario Lucente, Marco Baldovin +1Optimal TransportStochastic Optimal Control

  11. Coarse-Graining Optimal Transport for Rollout-Free Post-Training of Flow Matching

    Oct 30, 2026Soon Hoe Lim, Aditi Gupta, Michael W. Mahoney +1Flow MatchingFlow-Based Generative Modeling

  12. One Vector or Many? Clustered Optimal-Transport Steering under Quantization

    Oct 29, 2026Illia MakarovActivation SteeringLLM Safety

  13. Fast rigid rotational alignment of voxelized 3-D density maps in sliced Wasserstein distance

    Oct 29, 2026Oscar Mickelin, Yunpeng Shi, Amit Singer +13D Shape MatchingOptimal Transport

  14. Convex Potential Learning for Optimal Transport Between Medical Images

    Oct 27, 2026Hongyu Kan, Ivan Medri, Natasha Ironside +4Optimal TransportMedical Image Analysis

  15. Second-order Sinkhorn Geometry and n\sqrt{n}-Inference

    Oct 27, 2026Tristan Luca Saidi, Florian Gunsilius, Gonzalo MenaOptimal TransportSinkhorn Divergence

  16. Intrinsic Gradient Barriers in Pushforward Deep Generative Models

    Oct 25, 2026Edric Tam, Qingyang Liu, Barbara Engelhardt +1Generative ModelingOptimal Transport

  17. Learning Population Dynamics with Variational Doob-Wasserstein Flow

    Oct 24, 2026Weizhu QianPopulation DynamicsOptimal Transport

  18. Lifting PCA in the Wasserstein Space

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

  19. CAVA: Complementary-Label-Aware Data Valuation

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

  20. Dynamic Neural Optimal Transport for Subset Alignment

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

  21. Vertical Sliced Wasserstein Distances for Meta-Measures

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

  22. Quantifying Annotation Agreement in Object Detection with Optimal Transport

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

  23. Scaling Online Optimal Transport Minibatches for Flow Matching

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

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

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

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

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