We build confidence balls for the common density of a real valued sample . We use resampling methods to estimate the projection of onto finite dimensional linear spaces and a model selection procedure to choose an optimal approximation space. The covering property is ensured for all ≥ 2 and the balls are adaptive over a collection of linear spaces.
In order to calibrate a penalization procedure for model selection, the statistician has to choose a shape for the penalty and a leading constant. In this paper, we study, for the marginal density estimation problem, the resampling penalties as general estimators of the shape of an ideal penalty. We prove that the selected estimator satisfies sharp oracle inequalities without remainder terms under a few assumptions on the marginal density and the collection of models. We also study the slope heuristic,...
We build confidence balls for the common density of a real valued sample . We use resampling methods to estimate the projection of onto finite dimensional linear spaces and a model selection procedure to choose an optimal approximation space. The covering property is ensured for all ≥ 2 and the balls are adaptive over a collection of linear spaces.
Page 1