Fetching the paper…
Reading the bibliography…
We investigate if kernel regularization methods can achieve minimax convergence rates over a source condition regularity assumption for the target function.
Optimal global rates of convergence for nonparametric regression
C. Stone · 1982
Earlier work this paper cites.
Regularization of Inverse Problems
H. Engl, M. Hanke, and A. Neubauer · 2000
Earlier work this paper cites.
Best choices for regularization parameters in learning theory: on the bias-variance problem
F. Cucker and S. Smale · 2002
Earlier work this paper cites.
Kernel Methods for Pattern Analysis
N. Cristianini and J. Shawe-Taylor · 2004
Earlier work this paper cites.
Learning from examples as an inverse problem
E. De Vito, L. Rosasco, A. Caponnetto, and U. De Giovannini · 2005
Earlier work this paper cites.
Learning bounds for kernel regression using effective data dimensionality
T. Zhang · 2005
Cited alongside, same era.
Optimal rates for regularization operators in learning theory
A. Caponnetto · 2006
Cited alongside, same era.
Optimal rates for regularized least-squares algorithm
E. De Vito and A. Caponnetto · 2006
Cited alongside, same era.
Spectral algorithms for supervised learning
L. L. Gerfo, L. Rosasco, F. Odone, E. De Vito, and A. Verri · 2008
Cited alongside, same era.
Introduction to Nonparametric Estimation
A. Tsybakov · 2008
Later among the works it cites.
Cross-validion based adaptation for regularization operators in learning theory
A. Caponnetto and Y. Yao · 2010
Later among the works it cites.
Kernel methods and regularization techniques for nonparametric regression: Minimax optimality and adaptation
L. Dicker, D. Foster, and D. Hsu · 2015
Later among the works it cites.
Optimal rates for regularization of statistical inverse learning problems
G. Blanchard and N. Mücke · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…