On amortizing convex conjugates for optimal transport
Brandon Amos
Abstract
This paper focuses on computing the convex conjugate (also known as the Legendre-Fenchel conjugate or c-transform) that appears in Euclidean Wasserstein-2 optimal transport. This conjugation is considered difficult to compute and in practice, methods are limited by not being able to exactly conjugate the dual potentials in continuous space. To overcome this, the computation of the conjugate can be approximated with amortized optimization, which learns a model to predict the conjugate. I show that combining amortized approximations to the conjugate with a solver for fine-tuning significantly improves the quality of transport maps learned for the Wasserstein-2 benchmark by Korotin et al. (2021a) and is able to model many 2-dimensional couplings and flows considered in the literature. All baselines, methods, and solvers are publicly available at http://github.com/facebookresearch/w2ot . 'log_alpha', nn.initializers.constant(0), []) 'log_alpha', nn.initializers.constant(0), [])
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8deaf16d-109e-4f93-be72-adfc91fcfd52Cited by top-tier papers21
- Multisample Flow Matching: Straightening Flows with Minibatch CouplingsAram-Alexandre Pooladian, Heli Ben-Hamu, Carles Domingo-Enrich, Brandon Amos et al.ICML 2023 · 243 citations
- Optimal Flow Matching: Learning Straight Trajectories in Just One StepNikita Kornilov, Petr Mokrov, Alexander V. Gasnikov, Alexander KorotinNeurIPS 2024 · 93 citations
- Entropic Neural Optimal Transport via Diffusion ProcessesNikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry P. Vetrov et al.NeurIPS 2023 · 59 citations
- The Monge Gap: A Regularizer to Learn All Transport MapsThéo Uscidda, Marco CuturiICML 2023 · 40 citations
- Meta Optimal TransportBrandon Amos, Giulia Luise, Samuel Cohen, Ievgen RedkoICML 2023 · 32 citations
Builds on16
- Optimal transport mapping via input convex neural networksAshok Vardhan Makkuva, Amirhossein Taghvaei, Sewoong Oh, Jason D. LeeICML 2020 · 254 citations
- Wasserstein-2 Generative NetworksAlexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin et al.ICLR 2021 · 128 citations
- Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 BenchmarkAlexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon et al.NeurIPS 2021 · 124 citations
- Large-Scale Wasserstein Gradient FlowsPetr Mokrov, Alexander Korotin, Lingxiao Li, Aude Genevay et al.NeurIPS 2021 · 112 citations
- Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex OptimizationChin-Wei Huang, Ricky T. Q. Chen, Christos Tsirigotis, Aaron C. CourvilleICLR 2021 · 107 citations
Related papers
- Expectile Regularization for Fast and Accurate Training of Neural Optimal TransportNazar Buzun, Maksim Bobrin, Dmitry V. DylovNeurIPS 2024
- Kernel Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 10 citations
- Sparsity-Constrained Optimal TransportTianlin Liu, Joan Puigcerver, Mathieu BlondelICLR 2023 · 3 citations
- Deep Legendre TransformAleksey Minabutdinov, Patrick CheriditoNeurIPS 2025 · 1 citation
- Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing FlowsGabriele Visentin, Patrick CheriditoICML 2025
