CVMar 19, 2022

TO-FLOW: Efficient Continuous Normalizing Flows with Temporal Optimization adjoint with Moving Speed

arXiv:2203.10335v212 citationsh-index: 10
Originality Incremental advance
AI Analysis

This work addresses efficiency issues in CNF training for machine learning practitioners, representing an incremental improvement over existing regularization techniques.

The paper tackles the high computational cost of training continuous normalizing flows (CNFs) by proposing a temporal optimization method that adjusts evolutionary time during neural ODE training, resulting in significantly accelerated training without performance loss compared to baseline models.

Continuous normalizing flows (CNFs) construct invertible mappings between an arbitrary complex distribution and an isotropic Gaussian distribution using Neural Ordinary Differential Equations (neural ODEs). It has not been tractable on large datasets due to the incremental complexity of the neural ODE training. Optimal Transport theory has been applied to regularize the dynamics of the ODE to speed up training in recent works. In this paper, a temporal optimization is proposed by optimizing the evolutionary time for forward propagation of the neural ODE training. In this appoach, we optimize the network weights of the CNF alternately with evolutionary time by coordinate descent. Further with temporal regularization, stability of the evolution is ensured. This approach can be used in conjunction with the original regularization approach. We have experimentally demonstrated that the proposed approach can significantly accelerate training without sacrifying performance over baseline models.

Code Implementations3 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes