The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On Early Stopping in Gradient Descent Learning
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Cited by
Recent advances in convolutional neural networks
Gu, J., Wang, Z., Kuen, J., Ma, L., Shahroudy, A., Shuai, B., Liu, T., Wang, X., Wang, G., Cai, J., et al. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.013 · Cited by 6,576
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210
Federated Optimization in Heterogeneous Networks
Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2018) · arXiv · doi:10.48550/arxiv.1812.06127 · Cited by 4,023
Understanding deep learning requires rethinking generalization
Zhang, C., Bengio, S., Hardt, M., Recht, B., & Vinyals, O. (2016) · arXiv · doi:10.48550/arxiv.1611.03530 · Cited by 2,838
Understanding deep learning (still) requires rethinking generalization
Zhang, C., Bengio, S., Hardt, M., Recht, B., & Vinyals, O. (2021) · Communications of the ACM · doi:10.1145/3446776 · Cited by 2,400
A Closer Look at Memorization in Deep Networks
Arpit, D., Jastrzębski, S., Ballas, N., Krueger, D., Bengio, E., Kanwal, M. S., Maharaj, T., Fischer, A., Courville, A., Bengio, Y., et al. (2017) · arXiv · doi:10.48550/arxiv.1706.05394 · Cited by 1,307
Wen, J., Thibeau-Sutre, E., Diaz-Melo, M., Samper-González, J., Routier, A., Bottani, S., Dormont, D., Durrleman, S., Burgos, N., & Colliot, O. (2020) · Medical Image Analysis · doi:10.1016/j.media.2020.101694 · Cited by 809
Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks
Bian, T., Xiao, X., Xu, T., Zhao, P., Huang, W., Rong, Y., & Huang, J. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i01.5393 · Cited by 796
Kernel methods in system identification, machine learning and function estimation: A survey
Pillonetto, G., Dinuzzo, F., Chen, T., De Nicolao, G., & Ljung, L. (2014) · Automatica · doi:10.1016/j.automatica.2014.01.001 · Cited by 741
Lago, J., De Ridder, F., & De Schutter, B. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.02.069 · Cited by 642
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“Other than adjusting the architecture of the model, one can mitigate overfitting to obtain better generalization via various explicit or implicit regularizations, such as early stopping [370], batch normalization [167], dropout [309], data augmentation, and weight decay [196].”
Unveiling COVID-19 from CHEST X-ray with deep learning: A hurdles race with small data
Tartaglione, E., Barbano, C. A., Berzovini, C., Calandri, M., & Grangetto, M. (2020) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph17186933 · Cited by 211
To understand deep learning we need to understand kernel learning
Belkin, M., Ma, S., & Mandal, S. (2018) · arXiv · doi:10.48550/arxiv.1802.01396 · Cited by 201
Duan, M., Liu, D., Chen, X., Tan, Y., Ren, J., Qiao, L., & Liang, L. (2019) · 2019 IEEE 37th International Conference on Computer Design (ICCD) · doi:10.1109/iccd46524.2019.00038 · Cited by 250
Missing data imputation through the use of the random forest algorithm
Pantanowitz, A., & Marwala, T. (2009) · Advances in Intelligent and Soft Computing · doi:10.1007/978-3-642-03156-4_6 · Cited by 106
Deep learning generalizes because the parameter-function map is biased towards simple functions
Valle-Pérez, G., Camargo, C. Q., & Louis, A. A. (2018) · arXiv · doi:10.48550/arxiv.1805.08522 · Cited by 105
GLOBEM: Cross-Dataset Generalization of Longitudinal Human Behavior Modeling
Xu, X., Liu, X., Zhang, H., Wang, W., Nepal, S., Sefidgar, Y., Seo, W., Kuehn, K. S., Huckins, J. F., Morris, M. E., et al. (2022) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3569485 · Cited by 96
Photometry of high-redshift blended galaxies using deep learning
Boucaud, A., Huertas-Company, M., Heneka, C., Ishida, E. E. O., Sedaghat, N., de Souza, R. S., Moews, B., Dole, H., Castellano, M., Merlin, E., et al. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stz3056 · Cited by 60
Deep generative modeling of sample-level heterogeneity in single-cell genomics
Boyeau, P., Hong, J., Gayoso, A., Kim, M., McFaline-Figueroa, J. L., Jordan, M. I., Azizi, E., Ergen, C., & Yosef, N. (2025) · Nature Methods · doi:10.1038/s41592-025-02808-x · Cited by 55
A Battery-Free Long-Range Wireless Smart Camera for Face Detection
Giordano, M., Mayer, P., & Magno, M. (2020) · Proceedings of the 8th International Workshop on Energy Harvesting and Energy-Neutral Sensing Systems · doi:10.1145/3417308.3430273 · Cited by 38
Revisiting Challenges in Data-to-Text Generation with Fact Grounding
Wang, H. (2019) · Proceedings of the 12th International Conference on Natural Language Generation · doi:10.18653/v1/w19-8639 · Cited by 34
aSGD: Stochastic Gradient Descent with Adaptive Batch Size for Every Parameter
Shi, H., Yang, N., Tang, H., & Yang, X. (2022) · Mathematics · doi:10.3390/math10060863 · Cited by 11
Learning higher-order sequential structure with cloned HMMs
Dedieu, A., Gothoskar, N., Swingle, S., Lehrach, W., Lázaro-Gredilla, M., & George, D. (2019) · arXiv · doi:10.48550/arxiv.1905.00507 · Cited by 7
Metadata
- Authors
- Yao, Y., Rosasco, L., & Caponnetto, A.
- Venue
- Constructive Approximation
- Published
- 2007-04-04
- Volume
- 26
- Issue
- 2
- Pages
- 289-315
- ISSN
- 0176-4276 (ISSN-L)
- 1432-0940
- OpenAlex
- W2034978228
- Cited by
- 970
- References
- 3
- FWCI
- 9.85
- 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
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.