Log-concave Density Estimation with Independent Components
Not on the map. Why?
Abstract (arXiv)
We propose a method for estimating a log-concave density on mathbb Rd from samples, under the assumption that there exists an orthogonal transformation that makes the components of the random vector independent. While log-concave density estimation is hard both computationally and statistically, the independent components assumption alleviates both issues, while still maintaining a large non-parametric class. We prove that under mild conditions, at most tildeO(ε-4) samples (suppressing constants and log factors) suffice for our proposed estimator to be within ε of the original density in squared Hellinger distance. On the computational front, while the usual log-concave maximum likelihood estimate can be obtained via a finite-dimensional convex program, it is slow to compute -- especially in higher dimensions. We demonstrate through numerical experiments that our estimator can be computed efficiently, making it more practical to use.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.