Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/70459
Authors: 
Kiefer, Nicholas M.
Racine, Jeffrey S.
Year of Publication: 
2008
Series/Report no.: 
CAE Working Paper 08-01
Abstract: 
Kernel smoothing techniques have attracted much attention and some notoriety in recent years. The attention is well deserved as kernel methods free researchers from having to impose rigid parametric structure on their data. The notoriety arises from the fact that the amount of smoothing (i.e., local averaging) that is appropriate for the problem at hand is under the control of the researcher. In this paper we provide a deeper understanding of kernel smoothing methods for discrete data by leveraging the unexplored links between hierarchical Bayesmodels and kernelmethods for discrete processes. A number of potentially useful results are thereby obtained, including bounds on when kernel smoothing can be expected to dominate non-smooth (e.g., parametric) approaches in mean squared error and suggestions for thinking about the appropriate amount of smoothing.
Document Type: 
Working Paper

Files in This Item:
File
Size
327.68 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.