Accelerating Continuous Normalizing Flow with Trajectory Polynomial Regularization
원문 초록
In this paper, we propose an approach to effectively accelerating the computation of continuous normalizing flow (CNF), which has been proven to be a powerful tool for the tasks such as variational inference and density estimation. The training time cost of CNF can be extremely high because the required number of function evaluations (NFE) for solving corresponding ordinary differential equations (ODE) is very large. We think that the high NFE results from large truncation errors of solving ODEs. To address the problem, we propose to add a regularization. The regularization penalizes the difference between the trajectory of the ODE and its fitted polynomial regression. The trajectory of ODE will approximate a polynomial function, and thus the truncation error will be smaller. Furthermore, we provide two proofs and claim that the additional regularization does not harm training quality. Experimental results show that our proposed method can result in 42.3% to 71.3% reduction of NFE on the task of density estimation, and 19.3% to 32.1% reduction of NFE on variational auto-encoder, while the testing losses are not affected.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unifying and extending Diffusion Models through PDEs for solving Inverse Problems
Gaussian Process Tilted Nonparametric Density Estimation using Fisher Divergence Score Matching
A New Stochastic Approximation Method for Gradient-based Simulated Parameter Estimation
Deterministic Fokker-Planck Transport -- With Applications to Sampling, Variational Inference, Kernel Mean Embeddings & Sequential Monte Carlo
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Binned semiparametric Bayesian networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.