Amortized Optimal Transport from Sliced Potentials
Not on the map. Why?
Abstract (arXiv)
We propose a novel amortized optimization method for predicting optimal transport (OT) plans across multiple pairs of measures by leveraging Kantorovich potentials derived from sliced OT. We introduce two amortization strategies: regression-based amortization (RA-OT) and objective-based amortization (OA-OT). In RA-OT, we formulate a functional regression model that treats Kantorovich potentials from the original OT problem as responses and those obtained from sliced OT as predictors, and estimate these models via least-squares methods. In OA-OT, we estimate the parameters of the functional model by optimizing the Kantorovich dual objective. In both approaches, the predicted OT plan is subsequently recovered from the estimated potentials. As amortized OT methods, both RA-OT and OA-OT enable efficient solutions to repeated OT problems across different measure pairs by reusing information learned from prior instances to rapidly approximate new solutions. Moreover, by exploiting the structure provided by sliced OT, the proposed models are more parsimonious, independent of specific structures of the measures, such as the number of atoms in the discrete case, while achieving high accuracy. We demonstrate the effectiveness of our approaches on tasks including MNIST digit transport, color transfer, supply-demand transportation on spherical data, and mini-batch OT conditional flow matching.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 43 of its 74 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
43 of 74 references.
References · 43
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2017Wasserstein Auto-Encoderscited by 373
- 2017Learning Generative Models with Sinkhorn Divergencescited by 314
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplingscited by 278
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
- 2019Optimal transport mapping via input convex neural networkscited by 206
31 more
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
- 2020Geometric Dataset Distances via Optimal Transportcited by 158
- 2019Wasserstein Fair Classificationcited by 131
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
- 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 87
- 2022Tutorial on amortized optimizationcited by 83
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 68
- 2021Low-Rank Sinkhorn Factorizationcited by 67
- 2020Wasserstein Embedding for Graph Learningcited by 56
- 2021Improving Mini-batch Optimal Transport via Partial Transportationcited by 41
- 2017Optimal Transport for Diffeomorphic Registrationcited by 39
- 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
- 2019Approximate Bayesian computation with the Wasserstein distancecited by 34
- 2022Spherical Sliced-Wassersteincited by 31
- 2022Meta Optimal Transportcited by 28
- 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
- 2018Optimal Transport: Fast Probabilistic Approximation with Exact Solverscited by 27
- 2017Learning Wasserstein Embeddingscited by 26
- 2026Sinkhorn-Drifting Generative Modelscited by 24
- 2022Faster Unbalanced Optimal Transport: Translation invariant Sinkhorn and 1-D Frank-Wolfecited by 22
- 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
- 2022Low-rank Optimal Transport: Approximation, Statistics and Debiasingcited by 21
- 2024Expected Sliced Transport Planscited by 19
- 2024Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformerscited by 14
- 2024Stereographic Spherical Sliced Wasserstein Distancescited by 12
- 2022Improving Molecular Representation Learning with Metric Learning-enhanced Optimal Transportcited by 9
- 2024Validating Climate Models with Spherical Convolutional Wasserstein Distancecited by 9
- 2023Fast Optimal Transport through Sliced Wasserstein Generalized Geodesicscited by 5
- 2025Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distancescited by 5
- 2025Efficient Transferable Optimal Transport via Min-Sliced Transport Planscited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Sliced-Regularized Optimal Transportcited by 2
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projectioncited by 0
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection13 May 2026
- 2026Sliced-Regularized Optimal Transport27 Apr 2026
Similar, not cited
Close in wording, no citation either way
- 2025Masked Diffusion Models as Energy Minimization
- 2025Differentiable Generalized Sliced Wasserstein Plans
- 2025Fast filtering of non-Gaussian models using Amortized Optimal Transport Maps
- 2023On a Relation Between the Rate-Distortion Function and Optimal Transport
- 2026Bridging Control, Inference, Transport, and Thermodynamics: From Theory to Applications in Learning
- 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transport
- 2026Expected Batch Optimal Transport Plans and Consequences for Flow Matching
- 2026Branched Optimal Transport Amortization