Pith. sign in

REVIEW 1 cited by

Computing high-dimensional optimal transport by flow neural networks

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 2305.11857 v5 pith:JUNJJTNS submitted 2023-05-19 stat.ML cs.LGstat.ME

Computing high-dimensional optimal transport by flow neural networks

classification stat.ML cs.LGstat.ME
keywords flowhigh-dimensionaltransportdistributionsoptimalbeencomputingdata
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Computing optimal transport (OT) for general high-dimensional data has been a long-standing challenge. Despite much progress, most of the efforts including neural network methods have been focused on the static formulation of the OT problem. The current work proposes to compute the dynamic OT between two arbitrary distributions $P$ and $Q$ by optimizing a flow model, where both distributions are only accessible via finite samples. Our method learns the dynamic OT by finding an invertible flow that minimizes the transport cost. The trained optimal transport flow subsequently allows for performing many downstream tasks, including infinitesimal density ratio estimation (DRE) and domain adaptation by interpolating distributions in the latent space. The effectiveness of the proposed model on high-dimensional data is demonstrated by strong empirical performance on OT baselines, image-to-image translation, and high-dimensional DRE.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Convex Relaxations for the Optimization of Markov Processes

    math.OC 2026-07 conditional novelty 6.0

    Sequential-coupling convex relaxations using local marginals and cluster moments solve high-dimensional Markov process optimization, recovering Benamou–Brenier dynamics and general kernels as special cases.