about
Meta Optimal Transport (arxiv.org)
2 points by lnyan on Jun 14, 2022 | hide | past | pdf | discuss on HN

In plain words: Instead of solving each point-matching problem from scratch, a system learns from past problems to predict the answer straight from the new inputs. Across tasks like images and color palettes, it produced transport maps far faster than standard solvers.

Abstract

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. We instantiate Meta OT models in discrete and continuous settings between grayscale images, spherical data, classification labels, and color palettes and use them to improve the computational time of standard OT solvers. Our source code is available at http://github.com/facebookresearch/meta-ot

Brandon Amos, Samuel Cohen, Giulia Luise, Ievgen Redko
arXiv:2206.05262 · cs.LG, cs.AI, stat.ML · submitted Jun 10, 2022 · updated Jun 2, 2023
abstract · pdf · html · ICML 2023

add comment on HN