mlsanityData to 7 Oct 2026

HOTA: Hamiltonian framework for Optimal Transport Advection

arXiv 2507.17513 ↗First posted 23 Jul 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Optimal transport (OT) has become a natural framework for guiding the probability flows. Yet, the majority of recent generative models assume trivial geometry (e.g., Euclidean) and rely on strong density-estimation assumptions, yielding trajectories that do not respect the true principles of optimality in the underlying manifold. We present Hamiltonian Optimal Transport Advection (HOTA), a Hamilton-Jacobi-Bellman based method that tackles the dual dynamical OT problem explicitly through Kantorovich potentials, enabling efficient and scalable trajectory optimization. Our approach effectively evades the need for explicit density modeling, performing even when the cost functionals are non-smooth. Empirically, HOTA outperforms all baselines in standard benchmarks, as well as in custom datasets with non-differentiable costs, both in terms of feasibility and optimality.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 31 references that are in the map. First posted on arXiv 23 Jul 2025.

Builds on

24 of 31 references.

References · 24

  1. 2022Flow Matching for Generative Modelingcited by 5,426
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
  4. 2024Simplifying, Stabilizing and Scaling Continuous-Time Consistency Modelscited by 276
  5. 2024Adjoint Matching: Fine-tuning Flow and Diffusion Generative Models with Memoryless Stochastic Optimal Controlcited by 222
  6. 2019Optimal transport mapping via input convex neural networkscited by 202
  7. 2022Neural Optimal Transportcited by 123
  8. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 91
  9. 2024Metric Flow Matching for Smooth Interpolations on the Data Manifoldcited by 74
  10. 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
  11. 2022Deep Generalized Schr"odinger Bridgecited by 47
  12. 2023A Computational Framework for Solving Wasserstein Lagrangian Flowscited by 43
12 more
  1. 2024Neural Flow Diffusion Models: Learnable Forward Process for Improved Diffusion Modellingcited by 43
  2. 2023Generalized Schr"odinger Bridge Matchingcited by 40
  3. 2023Stochastic Optimal Control Matchingcited by 39
  4. 2021A Survey on Optimal Transport for Machine Learning: Theory and Applicationscited by 35
  5. 2025Underdamped Diffusion Bridges with Applications to Samplingcited by 28
  6. 2021Polarization in Geometric Opinion Dynamicscited by 16
  7. 2024Neural Optimal Transport with Lagrangian Costscited by 16
  8. 2024Rethinking Optimal Transport in Offline Reinforcement Learningcited by 8
  9. 2024Align Your Intents: Offline Imitation Learning via Optimal Transportcited by 7
  10. 2020An agent-based model of multi-dimensional opinion dynamics and opinion alignmentcited by 6
  11. 2024ENOT: Expectile Regularization for Fast and Accurate Training of Neural Optimal Transportcited by 6
  12. 2024Zero-Shot Offline Imitation Learning via Optimal Transportcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.