Bandwidth selection in deconvolution kernel distribution estimators defined by stochastic approximation method with Laplace errors
Abstract
In this paper we consider the kernel estimators of a distribution function defined by the stochastic approximation algorithm when the observation are contamined by measurement errors. It is well known that this estimators depends heavily on the choice of a smoothing parameter called the bandwidth. We propose a specific second generation plug-in method of the deconvolution kernel distribution estimators defined by the stochastic approximation algorithm. We show that, using the proposed bandwidth selection and the stepsize which minimize the MISE (Mean Integrated Squared Error), the proposed estimator will be better than the classical one for small sample setting when the error variance is controlled by the noise to signal ratio. We corroborate these theoretical results through simulations and a real dataset.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.