Meta Optimal Transport

06/10/2022
by   Brandon Amos, et al.
0

We study the use of amortized optimization to predict optimal transport (OT) maps from the input measures, which we call Meta OT. This helps repeatedly solve similar OT problems between different measures by leveraging the knowledge and information present from past problems to rapidly predict and solve new problems. Otherwise, standard methods ignore the knowledge of the past solutions and suboptimally re-solve each problem from scratch. Meta OT models surpass the standard convergence rates of log-Sinkhorn solvers in the discrete setting and convex potentials in the continuous setting. We improve the computational time of standard OT solvers by multiple orders of magnitude in discrete and continuous transport settings between images, spherical data, and color palettes. Our source code is available at http://github.com/facebookresearch/meta-ot.

READ FULL TEXT

page 8

page 14

page 17

page 18

page 19

research
04/26/2023

Polynomial-Time Solvers for the Discrete ∞-Optimal Transport Problems

In this note, we propose polynomial-time algorithms solving the Monge an...
research
04/11/2020

Quantitative Stability and Error Estimates for Optimal Transport Plans

Optimal transport maps and plans between two absolutely continuous measu...
research
06/03/2021

Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark

Despite the recent popularity of neural network-based solvers for optima...
research
10/21/2022

On amortizing convex conjugates for optimal transport

This paper focuses on computing the convex conjugate operation that aris...
research
06/16/2023

Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark

Over the last several years, there has been a significant progress in de...
research
06/18/2021

Riemannian Convex Potential Maps

Modeling distributions on Riemannian manifolds is a crucial component in...
research
02/14/2018

Optimal Transport: Fast Probabilistic Approximation with Exact Solvers

We propose a simple subsampling scheme for fast randomized approximate c...

Please sign up or login with your details

Forgot password? Click here to reset