Differentiable Cost-Parameterized Monge Map Estimators
Not on the map. Why?
Abstract (arXiv)
Within the field of optimal transport (OT), the choice of ground cost is crucial to ensuring that the optimality of a transport map corresponds to usefulness in real-world applications. It is therefore desirable to use known information to tailor cost functions and hence learn OT maps which are adapted to the problem at hand. By considering a class of neural ground costs whose Monge maps have a known form, we construct a differentiable Monge map estimator which can be optimized to be consistent with known information about an OT map. In doing so, we simultaneously learn both an OT map estimator and a corresponding adapted cost function. Through suitable choices of loss function, our method provides a general approach for incorporating prior information about the Monge map itself when learning adapted OT maps and cost functions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 37 of its 58 references that are in the map. First posted on arXiv 12 Jun 2024.
Builds on
37 of 58 references.
References · 37
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2018Computational Optimal Transportcited by 765
- 2017Masked Autoregressive Flow for Density Estimationcited by 680
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2016Input Convex Neural Networkscited by 407
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 277
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2021Efficient and Modular Implicit Differentiationcited by 199
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
25 more
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
- 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
- 2019Wasserstein-2 Generative Networkscited by 96
- 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 96
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2021Entropic estimation of optimal transport mapscited by 87
- 2022Tutorial on amortized optimizationcited by 83
- 2021Differentiable Particle Filtering via Entropy-Regularized Optimal Transportcited by 59
- 2018Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distancecited by 56
- 2021Neural Monge Map estimation and its applicationscited by 40
- 20192-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANscited by 32
- 2023The Monge Gap: A Regularizer to Learn All Transport Mapscited by 32
- 2016Wasserstein Discriminant Analysiscited by 25
- 2019Inverse optimal transportcited by 25
- 2020An Inductive Bias for Distances: Neural Nets that Respect the Triangle Inequalitycited by 24
- 2018Learning to Match via Inverse Optimal Transportcited by 22
- 2019Differentiable Deep Clustering with Cluster Size Constraintscited by 21
- 2019Ground Metric Learning on Graphscited by 17
- 2020Regularized Optimal Transport is Ground Cost Adversarialcited by 17
- 2023Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Mapscited by 16
- 2024Neural Optimal Transport with Lagrangian Costscited by 16
- 2016Estimating matching affinity matrix under low-rank constraintscited by 8
- 2020SISTA: learning optimal transport costs under sparsity constraintscited by 7
- 2021Discrete Probabilistic Inverse Optimal Transportcited by 7
- 2019Learning transport cost from subset correspondencecited by 6
Built on by
Citing papers per year: 2024: 1.
1 paper.