Linear and convex aggregation of density estimators - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2006

Linear and convex aggregation of density estimators

Abstract

We study the problem of linear and convex aggregation of $M$ estimators of a density with respect to the mean squared risk. We provide procedures for linear and convex aggregation and we prove oracle inequalities for their risks. We also obtain lower bounds showing that these procedures are rate optimal in a minimax sense. As an example, we apply general results to aggregation of multivariate kernel density estimators with different bandwidths. We show that linear and convex aggregates mimic the kernel oracles in asymptotically exact sense for a large class of kernels including Gaussian, Silverman's and Pinsker's ones. We prove that, for Pinsker's kernel, the proposed aggregates are sharp asymptotically minimax simultaneously over a large scale of Sobolev classes of densities. Finally, we provide simulations demonstrating performance of the convex aggregation procedure.
Fichier principal
Vignette du fichier
rt06.pdf (480.39 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00068216 , version 1 (11-05-2006)

Identifiers

Cite

Philippe Rigollet, Alexandre Tsybakov. Linear and convex aggregation of density estimators. 2006. ⟨hal-00068216⟩
139 View
235 Download

Altmetric

Share

Gmail Facebook X LinkedIn More