Computing high-dimensional optimal transport by flow neural networks
Chen Xu, Xiuyuan Cheng, Yao Xie

TL;DR
This paper introduces a flow neural network approach to compute dynamic optimal transport in high-dimensional spaces, enabling efficient distribution interpolation and downstream tasks like density ratio estimation and domain adaptation.
Contribution
It proposes a novel invertible flow model for dynamic OT that works with finite samples and high-dimensional data, extending beyond static formulations.
Findings
Strong empirical performance on high-dimensional OT benchmarks
Effective for image-to-image translation tasks
Improves density ratio estimation accuracy
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 and 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…
Peer Reviews
Decision·Submitted to ICLR 2024
- sufficiently clearly written paper - natural idea of the algorithm - detailed description of the algorithm and experimental study - discussion of the features of the computational implementation of the algorithm - interesting practical results
- the title of the paper is "Computing high-dimensional optimal transport by flow neural networks". However, a significant part of the paper is devoted to benchmarking of the capability of the algorithm to perform density ratio estimation. So it is not clear what is the main aim of the paper - to compute OT, or to estimate log density ratio - If the main aim is DRE, then it is necessary to provide detailed comparison with other DRE methods, as there are many papers on this topic. E.g., what is
1. The paper conducts several experiments showing that the flow can generate flow paths between two distributions. 2. The paper clearly describes the algorithm and the method. The writing is commendable.
1. In the training algorithm, there are two neural networks r0 and r1. That will add more complexity and difficulty in parameter tuning to the training scheme. It is a bit unclear on if one model is poorly trained, how would that affect the whole flow quality. 2. There are lot of metrics used in the experiment section: mutual information, FID, and BPD. If you can group them in one table or plot, it would be cleaner to compare the methods with all three metrics. 3. We recommend the authors cite
The proposed method outperforms methods [6] and [7] in the DRE problem on MNIST dataset.
- At the first glance, the authors position their main optimization objective as a minimization problem. However, having understood the paper better, one may realize that their objective actually constitutes the min-max optimization because it uses the variational (discriminator-based) estimation of KL divergence. It seems like the classification net can be viewed as a discriminator (in accordance with the formula (5) and Table 2 of the paper [9]). The trained flow-based network is used as a gen
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Advanced Neural Network Applications · Model Reduction and Neural Networks
MethodsNormalizing Flows
