MLLGApr 19, 2024

Risk Bounds for Mixture Density Estimation on Compact Domains via the $h$-Lifted Kullback--Leibler Divergence

arXiv:2404.12586v26 citationsh-index: 11Trans. Mach. Learn. Res.
Originality Incremental advance
AI Analysis

This work addresses density estimation for non-positive densities, offering theoretical guarantees that extend prior results, but it is incremental as it builds on existing risk bounding frameworks.

The paper tackles the problem of estimating probability density functions using finite mixtures by introducing the h-lifted Kullback-Leibler divergence, proving an O(1/√n) bound on expected estimation error for densities that are not strictly positive.

We consider the problem of estimating probability density functions based on sample data, using a finite mixture of densities from some component class. To this end, we introduce the $h$-lifted Kullback--Leibler (KL) divergence as a generalization of the standard KL divergence and a criterion for conducting risk minimization. Under a compact support assumption, we prove an $\mathcal{O}(1/{\sqrt{n}})$ bound on the expected estimation error when using the $h$-lifted KL divergence, which extends the results of Rakhlin et al. (2005, ESAIM: Probability and Statistics, Vol. 9) and Li and Barron (1999, Advances in Neural Information ProcessingSystems, Vol. 12) to permit the risk bounding of density functions that are not strictly positive. We develop a procedure for the computation of the corresponding maximum $h$-lifted likelihood estimators ($h$-MLLEs) using the Majorization-Maximization framework and provide experimental results in support of our theoretical bounds.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes