arXivDaily arXiv每日学术速递 周一至周五更新
​通知:联邦节假日调休:哥伦布日 / 原住民日(Columbus Day / Indigenous Peoples' Day),今日(13日)无更新。
arXiv 1912.03978cs.LGcs.CVstat.ML

InfoCNF: An Efficient Conditional Continuous Normalizing Flow with Adaptive Solvers

Rice University(莱斯大学);NVIDIA(英伟达);University of Toronto(多伦多大学);California Institute of Technology(加州理工学院)

Tan M. Nguyen, Animesh Garg, Richard G. Baraniuk, Anima Anandkumar

英文摘要:

Continuous Normalizing Flows (CNFs) have emerged as promising deep generative models for a wide range of tasks thanks to their invertibility and exact likelihood estimation. However, conditioning CNFs on signals of interest for conditional image generation and downstream predictive tasks is inefficient due to the high-dimensional latent code generated by the model, which needs to be of the same size as the input data. In this paper, we propose InfoCNF, an efficient conditional CNF that partitions the latent space into a class-specific supervised code and an unsupervised code that shared among all classes for efficient use of labeled information. Since the partitioning strategy (slightly) increases the number of function evaluations (NFEs), InfoCNF also employs gating networks to learn the error tolerances of its ordinary differential equation (ODE) solvers for better speed and performance. We show empirically that InfoCNF improves the test accuracy over the baseline while yielding comparable likelihood scores and reducing the NFEs on CIFAR10. Furthermore, applying the same partitioning strategy in InfoCNF on time-series data helps improve extrapolation performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑