Robustly Train Normalizing Flows via KL Divergence Regularization

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we find that the training of Normalizing Flows (NFs) are easily affected by the outliers and a small number (or high dimensionality) of training samples. To solve this problem, we propose a Kullback–Leibler (KL) divergence regularization on the Jacobian matrix of NFs. We prove that such regularization is equivalent to adding a set of samples whose covariance matrix is the identity matrix to the training set. Thus, it reduces the negative influence of the outliers and the small sample number on the estimation of the covariance matrix, simultaneously. Therefore, our regularization makes the training of NFs robust. Ultimately, we evaluate the performance of NFs on out-of-distribution (OoD) detection tasks. The excellent results obtained demonstrate the effectiveness of the proposed regularization term. For example, with the help of the proposed regularization, the OoD detection score increases at most 30% compared with the one without the regularization.

Cite

CITATION STYLE

APA

Song, K., Solozabal, R., Li, H., Takáč, M., Ren, L., & Karray, F. (2024). Robustly Train Normalizing Flows via KL Divergence Regularization. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 15047–15055). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i13.29426

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free