Structural adaptation in the single-index model

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages. This paper has been withdrawn by the second author due to its incompleteness for future improvement

Scientific paper

We study the problem of adaptive estimation of a multivariate function under the single-index constrains when both the link function and index vector are unknown. We propose a novel estimation procedure adapting simultaneously to the unknown index vector and the smoothness of the link function by selection from a family of specific kernel estimators. This procedure allows to establish a pointwise oracle inequality which can be used to judge the quality of estimation under the L_r-norm losses. The obtained oracle inequality allows adaptation with respect to a scale of Nikol'skii (Besov) classes B_{p, \infty}^s, where s is the unknown regularity of link function and p is the index of L_p-norm involved in the class definition. This paper therefore covers non-treated in the literature on structural adaptation and, correspondingly by the recent Goldenshluger-Lepski procedure, case of r > p. We also provide the lower bounds for the considered class of functions possessing the single index structure.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Structural adaptation in the single-index model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Structural adaptation in the single-index model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structural adaptation in the single-index model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-709730

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.