The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem
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
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
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
Self-citationRegularization 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
Empirical Processes in M-Estimation
van de Geer, S. (2000) · Cited by 530
Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
Lepski, O. (1992) · Theory of Probability and Its Applications · doi:10.1137/1136085 · Cited by 255
Niyogi, P., & Girosi, F. (1996) · Neural Computation · doi:10.1162/neco.1996.8.4.819 · Cited by 172
Ivanov, V. V., & Gupta, G. D. (1978) · Journal of Applied Mechanics · doi:10.1115/1.3424255 · Cited by 142
Generalization bounds for function approximation from scattered noisy data
Niyogi, P., & Girosi, F. (1999) · Advances in Computational Mathematics · doi:10.1023/a:1018966213079 · Cited by 80
Cited by
Cucker, F., & Smale, S. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895842 · Cited by 1,810
Self-citationvon Rueden, L., Mayer, S., Beckh, K., Georgiev, B., Giesselbach, S., Heese, R., Kirsch, B., Walczak, M., Pfrommer, J., Pick, A., et al. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3079836 · Cited by 793
Optimal Rates for the Regularized Least-Squares Algorithm
Caponnetto, A., & De Vito, E. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-006-0196-8 · Cited by 564
On the mathematics of emergence
Cucker, F., & Smale, S. (2007) · Japanese Journal of Mathematics · doi:10.1007/s11537-007-0647-x · Cited by 527
Self-citationAre Loss Functions All the Same?
Rosasco, L., Vito, E. D., Caponnetto, A., Piana, M., & Verri, A. (2004) · Neural Computation · doi:10.1162/089976604773135104 · Cited by 501
Metadata
- Authors
- Cucker, F., & Smale, S.
- Venue
- Foundations of Computational Mathematics
- Published
- 2002-10-17
- Volume
- 2
- Issue
- 4
- Pages
- 413-428
- ISSN
- 0025-5831 (ISSN-L)
- OpenAlex
- W2149614431
- Cited by
- 261
- References
- 10
- FWCI
- 8.36
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem. https://app.cochat.ai/papers/10.1007/s102080010030
- The paper
- Cucker, F., & Smale, S. (2002). Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem. Foundations of Computational Mathematics. https://doi.org/10.1007/s102080010030
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.