Global rates of convergence in log-concave density estimation

From MaRDI portal
(Redirected from Publication:510698)




Abstract: The estimation of a log-concave density on mathbbRd represents a central problem in the area of nonparametric inference under shape constraints. In this paper, we study the performance of log-concave density estimators with respect to global loss functions, and adopt a minimax approach. We first show that no statistical procedure based on a sample of size n can estimate a log-concave density with respect to the squared Hellinger loss function with supremum risk smaller than order n4/5, when d=1, and order n2/(d+1) when dgeq2. In particular, this reveals a sense in which, when dgeq3, log-concave density estimation is fundamentally more challenging than the estimation of a density with two bounded derivatives (a problem to which it has been compared). Second, we show that for dleq3, the Hellinger epsilon-bracketing entropy of a class of log-concave densities with small mean and covariance matrix close to the identity grows like maxepsilond/2,epsilon(d1) (up to a logarithmic factor when d=2). This enables us to prove that when dleq3 the log-concave maximum likelihood estimator achieves the minimax optimal rate (up to logarithmic factors when d=2,3) with respect to squared Hellinger loss.




Cited in
(39)






This page was built for publication: Global rates of convergence in log-concave density estimation

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