ADAPTIVELY LOCAL ONE-DIMENSIONAL SUBPROBLEMS WITH APPLICATION TO A DECONVOLUTION PROBLEM
成果类型:
Article
署名作者:
FAN, JQ
刊物名称:
ANNALS OF STATISTICS
ISSN/ISSBN:
0090-5364
DOI:
10.1214/aos/1176349139
发表日期:
1993
页码:
600-610
关键词:
geometrizing rates
Minimax Risk
CONVERGENCE
regression
densities
摘要:
In this paper, a method for finding global minimax lower bounds is introduced. The idea is to adjust automatically the direction of a local one-dimensional subproblem at each location to the nearly hardest one, and to use locally the difficulty of the one-dimensional subproblem. This method has the advantages of being easily implemented and understood. The lower bound is then applied to nonparametric deconvolution to obtain the optimal rates of convergence for estimating a whole function. Other applications are also addressed.