Fast multivariate log-concave density estimation

From MaRDI portal
Publication:2337320

DOI10.1016/J.CSDA.2019.04.005zbMATH Open1496.62021arXiv1805.07272OpenAlexW2963662588WikidataQ127760698 ScholiaQ127760698MaRDI QIDQ2337320FDOQ2337320


Authors: Fabian Rathke, Christoph Schnörr Edit this on Wikidata


Publication date: 19 November 2019

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Abstract: A novel computational approach to log-concave density estimation is proposed. Previous approaches utilize the piecewise-affine parametrization of the density induced by the given sample set. The number of parameters as well as non-smooth subgradient-based convex optimization for determining the maximum likelihood density estimate cause long runtimes for dimensions dgeq2 and large sample sets. The presented approach is based on mildly non-convex smooth approximations of the objective function and extit{sparse}, adaptive piecewise-affine density parametrization. Established memory-efficient numerical optimization techniques enable to process larger data sets for dimensions dgeq2. While there is no guarantee that the algorithm returns the maximum likelihood estimate for every problem instance, we provide comprehensive numerical evidence that it does yield near-optimal results after significantly shorter runtimes. For example, 10000 samples in mathbbR2 are processed in two seconds, rather than in approx14 hours required by the previous approach to terminate. For higher dimensions, density estimation becomes tractable as well: Processing 10000 samples in mathbbR6 requires 35 minutes. The software is publicly available as CRAN R package fmlogcondens.


Full work available at URL: https://arxiv.org/abs/1805.07272




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: Fast multivariate log-concave density estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337320)