Density estimation by the penalized combinatorial method
Let f be an unknown multivariate density belonging to a prespecified parametric class of densities, , where k is unknown, but for all k and each has finite Vapnik-Chervonenkis dimension. Given an i.i.d. sample of size n drawn from f, we show that it is possible to select automatically, and without extra restrictions on f, an estimate with the property that . Our method is inspired by the combinatorial tools developed in Devroye and Lugosi (Combinatorial Methods in Density Estimation, Springer, New York, 2001) and it includes a wide range of density models, such as mixture models or exponential families.
Year of publication: |
2005
|
---|---|
Authors: | Biau, Gérard ; Devroye, Luc |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 94.2005, 1, p. 196-208
|
Publisher: |
Elsevier |
Keywords: | Multivariate density estimation Vapnik-Chervonenkis dimension Mixture densities Penalization |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An affine invariant k-nearest neighbor regression estimate
Biau, Gérard, (2012)
-
Strongly consistent model selection for densities
Biau, Gérard, (2008)
-
On the risk of estimates for block decreasing densities
Biau, Gérard, (2003)
- More ...