English

Deep Data Density Estimation through Donsker-Varadhan Representation

Machine Learning 2021-04-15 v1 Artificial Intelligence Computer Vision and Pattern Recognition Information Theory math.IT Probability

Abstract

Estimating the data density is one of the challenging problems in deep learning. In this paper, we present a simple yet effective method for estimating the data density using a deep neural network and the Donsker-Varadhan variational lower bound on the KL divergence. We show that the optimal critic function associated with the Donsker-Varadhan representation on the KL divergence between the data and the uniform distribution can estimate the data density. We also present the deep neural network-based modeling and its stochastic learning. The experimental results and possible applications of the proposed method demonstrate that it is competitive with the previous methods and has a lot of possibilities in applied to various applications.

Keywords

Cite

@article{arxiv.2104.06612,
  title  = {Deep Data Density Estimation through Donsker-Varadhan Representation},
  author = {Seonho Park and Panos M. Pardalos},
  journal= {arXiv preprint arXiv:2104.06612},
  year   = {2021}
}
R2 v1 2026-06-24T01:08:49.655Z