Practical performance of several data driven bandwidth selectors

Byeong Park and Berwin Turlach
Additional contact information
Berwin Turlach: CORE, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium

No 1992005, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: Most recently proposed bandwidth selectors in kernel density estimation have been developed with intent to reduce the large sampling variability of Least Squares Cross-Validation. Their asymptotic superiority has been shown in many papers. Some of those selectors have even the fastest n-1/ 2 relative rate of convergence to their theoretical optimum. The aim of this paper is to see what is happening for small sample sizes. Several recently proposed methods of bandwidth selection are considered. These methods are compared to Least Squares Cross-Validation through simulations. Some qualitative measures of performance as well as quantitative ones are used for this comparison. It is seen that, while most of the bandwidth selectors gain some in terms of variance reduction, some of them lose a lot in terms of increased bias resulting in inferior overall performance when compared to Least Squares Cross-Validation.

Date: 1992-01-01
References: Add references at CitEc
Citations: View citations in EconPapers (36)

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp1992.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:1992005

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().