1985
DOI: 10.1214/aos/1176349651
|View full text |Cite
|
Sign up to set email alerts
|

Spline Smoothing in Regression Models and Asymptotic Efficiency in $L_2$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
87
0

Year Published

1995
1995
2005
2005

Publication Types

Select...
5
5

Relationship

2
8

Authors

Journals

citations
Cited by 125 publications
(87 citation statements)
references
References 0 publications
0
87
0
Order By: Relevance
“…The cognitive value of this model had already been realized by Ibragimov and Khasminski (1977). These risk bounds have been established since then in a variety of other problems, e. g. density, nonparametric regression, spectral density, see Efroimovich and Pinsker (1982), Golubev (1984), Nussbaum (1985), and they have also been substantially extended conceptually (Korostelev (1993), Donoho, Johnstone, Kerkyacharian, Picard (1995)). The theory is now at a stage where the approximation of the various particular curve estimation problems by the white noise model could be made formal.…”
Section: Introduction and Main Resultsmentioning
confidence: 89%
“…The cognitive value of this model had already been realized by Ibragimov and Khasminski (1977). These risk bounds have been established since then in a variety of other problems, e. g. density, nonparametric regression, spectral density, see Efroimovich and Pinsker (1982), Golubev (1984), Nussbaum (1985), and they have also been substantially extended conceptually (Korostelev (1993), Donoho, Johnstone, Kerkyacharian, Picard (1995)). The theory is now at a stage where the approximation of the various particular curve estimation problems by the white noise model could be made formal.…”
Section: Introduction and Main Resultsmentioning
confidence: 89%
“…If all that we care about is attaining the minimax bound for a single specic ball F C , a great deal is known. For example, over certain L 2 Sobolev balls, special spline smoothers, with appropriate smoothness penalty terms chosen based on F C are asymptotically minimax [36,35]; over certain H older balls, Kernel methods with appropriate bandwidth, chosen with knowledge of F C are nearly minimax [40]; and it is known that no such linear methods can be nearly minimax over certain L p Sobolev balls, p < 2 [33,12]. However, nonlinear methods, such as the nonparametric method of maximum likelihood, are able to behave in a near-minimax way for L p Sobolev balls [32,19], but they require solution of a general n-dimensional nonlinear programming problem in general.…”
Section: Previous Adaptive Smoothing Workmentioning
confidence: 99%
“…This approach has led to many theoretical developments which are of considerable interest: Stone (1982), Nussbaum (1985), Nemirovskii, Polyak, and Tsybakov (1985), ... But from a practical point of view, it has the diculty that it rarely corresponds with the usual situation where one is given data, but no knowledge of an a priori class F.…”
Section: Introductionmentioning
confidence: 99%