TL;DR
OT-Flow introduces a novel continuous normalizing flow method that uses optimal transport to simplify trajectories and achieves faster training and inference while maintaining competitive density estimation performance.
Contribution
The paper proposes OT-Flow, which combines optimal transport regularization with exact trace computation to improve efficiency and accuracy of continuous normalizing flows.
Findings
OT-Flow achieves 8x faster training and 24x faster inference.
It uses one-fourth the number of weights compared to state-of-the-art CNFs.
Performs competitively on high-dimensional density estimation tasks.
Abstract
A normalizing flow is an invertible mapping between an arbitrary probability distribution and a standard normal distribution; it can be used for density estimation and statistical inference. Computing the flow follows the change of variables formula and thus requires invertibility of the mapping and an efficient way to compute the determinant of its Jacobian. To satisfy these requirements, normalizing flows typically consist of carefully chosen components. Continuous normalizing flows (CNFs) are mappings obtained by solving a neural ordinary differential equation (ODE). The neural ODE's dynamics can be chosen almost arbitrarily while ensuring invertibility. Moreover, the log-determinant of the flow's Jacobian can be obtained by integrating the trace of the dynamics' Jacobian along the flow. Our proposed OT-Flow approach tackles two critical computational challenges that limit a more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
MethodsNormalizing Flows
