The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Optimal Rates for the Regularized Least-Squares Algorithm
Open accessAbstract
We develop a theoretical analysis of the performance of the regularized least-square algorithm on a reproducing kernel Hilbert space in the supervised learning setting. The presented results hold in the general framework of vector-valued functions; therefore they can be applied to multitask problems. In particular, we observe that the concept of effective dimension plays a central role in the definition of a criterion for the choice of the regularization parameter as a function of the number of samples. Moreover, a complete minimax analysis of the problem is described, showing that the convergence rates obtained by regularized least-squares estimators are indeed optimal over a suitable class of priors defined by the considered kernel. Finally, we give an improved lower rate result describing worst asymptotic behavior on individual probability measures rather than over classes of priors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Regularization of Inverse Problems
Engl, H. W., Hanke, M., & Neubauer, A. (1996) · Springer eBooks · doi:10.1007/978-94-009-1740-8 · Cited by 5,275
Spline Models for Observational Data.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Weak Convergence and Empirical Processes: With Applications to Statistics
Wellner, J. A. (1996) · Medical Entomology and Zoology · Cited by 1,969
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
(1972) · Elsevier eBooks · doi:10.1016/c2013-0-06164-6 · Cited by 1,728
On the mathematical foundations of learning
Cucker, F., & Smale, S. (2001) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-01-00923-5 · Cited by 1,545
Regularization Networks and Support Vector Machines
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018946025316 · Cited by 1,197
The theory of Tikhonov regularization for Fredholm equations of the first kind
Groetsch, C. W. (1984) · Medical Entomology and Zoology · Cited by 1,160
Learning Multiple Tasks with Kernel Methods
Evgeniou, T., Micchelli, C. A., & Pontil, M. (2005) · doi:10.5555/1046920.1088693 · Cited by 799
A Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
Learning Theory Estimates via Integral Operators and Their Approximations
Smale, S., & Zhou, D. (2007) · Constructive Approximation · doi:10.1007/s00365-006-0659-y · Cited by 555
On Learning Vector-Valued Functions
Micchelli, C. A., & Pontil, M. (2005) · Neural Computation · doi:10.1162/0899766052530802 · Cited by 494
Hidden Markov support vector machines
Altün, Y., Tsochantaridis, I., & Hofmann, T. (2003) · Cited by 458
The Mathematics of Learning: Dealing With Data
Smale, S. (2005) · 2005 International Conference on Neural Networks and Brain · doi:10.1109/icnnb.2005.1614860 · Cited by 398
Sous-espaces hilbertiens d’espaces vectoriels topologiques et noyaux associés (Noyaux reproduisants)
Schwartz, L. (1964) · Journal d'Analyse Mathématique · doi:10.1007/bf02786620 · Cited by 344
Nonlinear Methods of Approximation
Temlyakov, V. N. (2003) · Foundations of Computational Mathematics · doi:10.1007/s102080010029 · Cited by 309
Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem
Cucker, F., & Smale, S. (2002) · Foundations of Computational Mathematics · doi:10.1007/s102080010030 · Cited by 261
VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
Carmeli, C., Vito, E. D., & Toigo, A. (2006) · Analysis and Applications · doi:10.1142/s0219530506000838 · Cited by 210
Learning from Examples as an Inverse Problem
Vito, E. D., Rosasco, L., Caponnetto, A., Giovannini, U. D., & Odone, F. (2005) · doi:10.5555/1046920.1088702 · Cited by 185
Self-citationModel Selection for Regularized Least-Squares Algorithm in Learning Theory
De Vito, E., Caponnetto, A., & Rosasco, L. (2005) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0134-1 · Cited by 165
Self-citationWeston, J., Chapelle, O., Elisseeff, A., Schölkopf, B., & Vapnik, V. N. (2002) · Cited by 148
Leave-One-Out Bounds for Kernel Methods
Zhang, T. (2003) · Neural Computation · doi:10.1162/089976603321780326 · Cited by 95
Nonparametric regression estimation using penalized least squares
Köhler, M., & Krzyżak, A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.998089 · Cited by 50
Cited by
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
Quasi-oracle estimation of heterogeneous treatment effects
Nie, X., & Wager, S. (2021) · Biometrika · doi:10.1093/biomet/asaa076 · Cited by 545
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Kernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
Policy Learning With Observational Data
Athey, S., & Wager, S. (2021) · Econometrica · doi:10.3982/ecta15732 · Cited by 372
Metadata
- Authors
- Caponnetto, A., & De Vito, E.
- Venue
- Foundations of Computational Mathematics
- Published
- 2006-08-03
- Volume
- 7
- Issue
- 3
- Pages
- 331-368
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2012501405
- Cited by
- 564
- References
- 27
- FWCI
- 7.27
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.