Pith. sign in

REVIEW

Meta Optimal Transport

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.05262 v2 pith:L7TTPSXD submitted 2022-06-10 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords metaproblemsknowledgemeasuresoptimalpastpredictsolve
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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

Discussion (0). Sign in to comment.

Pith tools