Accuracy of Binned Kernel Functional Approximations
Virtually all common bandwidth selection algorithms are based on a certain type of kernel functional estimator. Such estimators can be very computationally expensive, so in practice they are often replaced by fast binned approximations. This is especially worthwhile when the bandwidth selection method involves iteration. Results for the accuracy of these approximations are derived and then used to provide an understanding of the number of binning grid points required to achieve a given level of accuracy Our results apply to both univariate and multivariate settings. Multivariate contexts are of particular interest since the cost due to having a higher number of grid points can be quite significant.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.agsm.edu.au/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:agsmst:95008. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.