Minimizing L1 distance in nonparametric density estimation
We construct a simple algorithm, based on Newton's method, which permits asymptotic minimization of L1 distance for nonparametric density estimators. The technique is applicable to multivariate kernel estimators, multivariate histogram estimators, and smoothed histogram estimators such as frequency polygons. It has an "adaptive" or "data-driven" version. We show theoretically that both theoretical and adaptive forms of the algorithm do indeed minimize asymptotic L1 distance. Then we apply the algorithm to derive concise formulae for asymptotically optimal smoothing parameters. We also give numerical examples of applications of the adaptive algorithm.
Year of publication: |
1988
|
---|---|
Authors: | Hall, Peter ; Wand, Matthew P. |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 26.1988, 1, p. 59-88
|
Publisher: |
Elsevier |
Keywords: | asymptotic optimality histogram estimator kernel estimator L1 distance nonparametric density estimator |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
On the minimization of absolute distance in kernel density estimation
Hall, Peter, (1988)
-
Streamlined variational inference for linear mixed models with crossed random effects
Menictas, Marianne, (2020)
-
Bayesian Analysis for Penalized Spline Regression Using WinBUGS
Crainiceanu, Ciprian M., (2005)
- More ...