The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
The Mathematics of Learning: Dealing With Data
Abstract
Learning is key to developing systems tailored to abroad range of data analysis and information extraction tasks. We outline the mathematical foundations of learning theory and describe a key algorithm of it.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks
Broomhead, D. S., & Lowe, D. (1988) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3,443
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Multiclass cancer diagnosis using tumor gene expression signatures
Ramaswamy, S., Tamayo, P., Rifkin, R., Mukherjee, S., Yeang, C.-H., Angelo, M., Ladd, C., Reich, M., Latulippe, E., Mesirov, J. P., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.211566398 · Cited by 2,023
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-citationA general framework for object detection
Papageorgiou, C. P., Oren, M., & Poggio, T. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710772 · Cited by 1,438
Computational vision and regularization theory
Poggio, T., Torre, V., & Koch, C. (1985) · Nature · doi:10.1038/317314a0 · Cited by 1,412
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Interpolation of Scattered Data: Distance Matrices and Conditionally Positive Definite Functions
Micchelli, C. A. (1984) · Approximation Theory and Spline Functions · doi:10.1007/978-94-009-6466-2_7 · Cited by 1,297
Radial basis functions for multivariable interpolation: a review
Powell, M. J. D. (1987) · Clarendon Press eBooks · Cited by 1,197
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
Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
Poggio, T., & Girosi, F. (1990) · Science · doi:10.1126/science.247.4945.978 · Cited by 1,026
Proximal support vector machine classifiers
Fung, G., & Mangasarian, O. L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502527 · Cited by 842
Ill-posed problems in early vision
Bertero, M., Poggio, T. A., & Torre, V. (1988) · Proceedings of the IEEE · doi:10.1109/5.5962 · Cited by 723
A Nonparametric Approach to Pricing and Hedging Derivative Securities Via Learning Networks
HUTCHINSON, J. M., LO, A. W., & POGGIO, T. (1994) · The Journal of Finance · doi:10.1111/j.1540-6261.1994.tb00081.x · Cited by 717
An Equivalence Between Sparse Approximation and Support Vector Machines
Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017269 · Cited by 506
Data compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
An Approach to Time Series Analysis
Parzen, E. (1961) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704840 · Cited by 379
Scale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997) · Journal of the ACM · doi:10.1145/263867.263927 · Cited by 340
Micchelli, C. A., & Rivlin, T. J. (1977) · Optimal Estimation in Approximation Theory · doi:10.1007/978-1-4684-2388-4_1 · Cited by 329
The covering number in learning theory
Zhou, D.-X. (2002) · Journal of Complexity · doi:10.1006/jcom.2002.0635 · Cited by 316
Trainable videorealistic speech animation
Ezzat, T., Geiger, G., & Poggio, T. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566594 · Cited by 301
Image Representations for Visual Learning
Beymer, D., & Poggio, T. (1996) · Science · doi:10.1126/science.272.5270.1905 · Cited by 271
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
Self-citationOptimal nonlinear approximation
DeVore, R. A., Howard, R., & Micchelli, C. (1989) · Manuscripta Mathematica · doi:10.1007/bf01171759 · Cited by 227
Niyogi, P., & Girosi, F. (1996) · Neural Computation · doi:10.1162/neco.1996.8.4.819 · Cited by 172
Universal Donsker Classes and Metric Entropy
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_19 · Cited by 141
Categorization by Learning and Combining Object Parts
Heisele, B., Serre, T., Pontil, M., Vetter, T. R., & Poggio, T. (2001) · Cited by 118
Uniform and universal Glivenko-Cantelli classes
Dudley, R. M., Gin�, E., & Zinn, J. (1991) · Journal of Theoretical Probability · doi:10.1007/bf01210321 · Cited by 100
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
Smoothing and Ill-Posed Problems
Wahba, G. (1979) · Springer eBooks · doi:10.1007/978-1-4757-1466-1_7 · Cited by 37
Poggio, T., & Brunelli, R. (1992) · doi:10.21236/ada259337 · Cited by 37
Heisele, B., Verri, A., & Poggio, T. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.801450 · Cited by 26
Geometric Parameters in Learning Theory
Mendelson, S. (2004) · Lecture notes in mathematics · doi:10.1007/978-3-540-44489-3_17 · Cited by 23
Introduction: Learning and Vision at CBCL
Poggio, T., & Verri, A. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008127215780 · Cited by 11
Cited by
Surrogate-based analysis and optimization
Queipo, N. V., Haftka, R. T., Shyy, W., Goel, T., Vaidyanathan, R., & Kevin Tucker, P. (2005) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2005.02.001 · Cited by 2,446
Deep learning for smart manufacturing: Methods and applications
Wang, J., Ma, Y., Zhang, L., Gao, R. X., & Wu, D. (2018) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2018.01.003 · Cited by 1,740
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.006 · Cited by 1,187
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
Why and when can deep-but not shallow-networks avoid the curse of dimensionality: A review
Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., & Liao, Q. (2017) · International Journal of Automation and Computing · doi:10.1007/s11633-017-1054-2 · Cited by 559
Metadata
- Authors
- Smale, S.
- Venue
- 2005 International Conference on Neural Networks and Brain
- Publisher
- IEEE
- Published
- 2005
- Pages
- x-x
- OpenAlex
- W2535756153
- Cited by
- 398
- References
- 40
- Type
- conference abstract
- 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.