Alpha-divergence loss function for neural density ratio estimation
Not on the map. Why?
Abstract (arXiv)
Density ratio estimation (DRE) is a fundamental machine learning technique for capturing relationships between two probability distributions. State-of-the-art DRE methods estimate the density ratio using neural networks trained with loss functions derived from variational representations of f-divergences. However, existing methods face optimization challenges, such as overfitting due to lower-unbounded loss functions, biased mini-batch gradients, vanishing training loss gradients, and high sample requirements for Kullback--Leibler (KL) divergence loss functions. To address these issues, we focus on α-divergence, which provides a suitable variational representation of f-divergence. Subsequently, a novel loss function for DRE, the α-divergence loss function (α-Div), is derived. α-Div is concise but offers stable and effective optimization for DRE. The boundedness of α-divergence provides the potential for successful DRE with data exhibiting high KL-divergence. Our numerical experiments demonstrate the effectiveness of α-Div in optimization. However, the experiments also show that the proposed loss function offers no significant advantage over the KL-divergence loss function in terms of RMSE for DRE. This indicates that the accuracy of DRE is primarily determined by the amount of KL-divergence in the data and is less dependent on α-divergence.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 47 references that are in the map. First posted on arXiv 3 Feb 2024.
Builds on
22 of 47 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2018MINE: Mutual Information Neural Estimationcited by 680
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
- 2021How to Train Your Energy-Based Modelscited by 271
- 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2017Stabilizing Training of Generative Adversarial Networks through Regularizationcited by 118
- 2020Telescoping Density-Ratio Estimationcited by 108
10 more
- 2019Bias Correction of Learned Generative Models using Likelihood-Free Importance Weightingcited by 70
- 2021Density Ratio Estimation via Infinitesimal Classificationcited by 59
- 2022ADATIME: A Benchmarking Suite for Domain Adaptation on Time Series Datacited by 45
- 2020Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimationcited by 43
- 2015Black-box α-divergence Minimizationcited by 37
- 2020Training Deep Energy-Based Models with f-Divergence Minimizationcited by 29
- 2016Generative Adversarial Nets from a Density Ratio Estimation Perspectivecited by 24
- 2020On the Difficulty of Unbiased Alpha Divergence Minimizationcited by 21
- 2020Variational Representations and Neural Network Estimation of R'enyi Divergencescited by 20
- 2020Optimizing Variational Representations of Divergences and Accelerating their Statistical Estimationcited by 15
Built on by
Citing papers per year: 2024: 1.
1 paper.