Minimax density estimation for growing dimension

arXiv1702.08895MaRDI QIDQ6283734FDOQ6283734

Authors: Daniel J. McDonald 

Publication date: 28 February 2017

Abstract: This paper presents minimax rates for density estimation when the data dimension $d$ is allowed to grow with the number of observations $n$ rather than remaining fixed as in previous analyses. We prove a non-asymptotic lower bound which gives the worst-case rate over standard classes of smooth densities, and we show that kernel density estimators achieve this rate. We also give oracle choices for the bandwidth and derive the fastest rate $d$ can grow with $n$ to maintain estimation consistency.

This page was built for publication: Minimax density estimation for growing dimension

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