The DOI matches its Crossref record; 88 of the 88 references it cites were found in a registry or an index.
Regularization Networks and Support Vector Machines
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Brown, R. A., Hastie, T. J., & Tibshirani, R. J. (1991) · Biometrics · doi:10.2307/2532174 · Cited by 8,176
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
Methods of Mathematical Physics
Courant, R., & Hilbert, D. (1989) · Wiley eBooks · doi:10.1002/9783527617210 · Cited by 8,067
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
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
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Self-citationEntropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
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
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Applied nonparametric regression
(1991) · Choice Reviews Online · doi:10.5860/choice.29-0364 · Cited by 2,580
Spline Functions: Basic Theory.
Smith, P. W., & Schumaker, L. (1982) · Mathematics of Computation · doi:10.2307/2007301 · Cited by 2,463
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Convergence of Stochastic Processes.
Robinson, P. M., & Pollard, D. (1985) · Economica · doi:10.2307/2553898 · Cited by 2,184
A New Learning Algorithm for Blind Signal Separation
Амари, Ш.-И., Cichocki, A. S., & Yang, H. H. (1995) · Cited by 1,904
Convergence of Stochastic Processes
Pollard, D. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5254-2 · Cited by 1,841
Learning from Data: Concepts, Theory, and Methods
Cherkassky, V., & Mulier, F. M. (1998) · Cited by 1,637
The Relationship Between Variable Selection and Data Agumentation and a Method for Prediction
Allen, D. M. (1974) · Technometrics · doi:10.1080/00401706.1974.10489157 · Cited by 1,469 · cited 2×
“The RKHS becomes simply the subspace of L 2 ([0] [1] d ) of the functions such that f 2 K = ∞ n=1 | ˜ f (n)| 2 λ n +∞.”
BackgroundInfluentialMethods of Mathematical Physics
Courant, R., Hilbert, D., & Teichmann, T. (1962) · Physics Today · doi:10.1063/1.3057861 · Cited by 1,419
Computational vision and regularization theory
Poggio, T., Torre, V., & Koch, C. (1985) · Nature · doi:10.1038/317314a0 · Cited by 1,412
Self-citationRegularization 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
Self-citationInterpolation 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
Interpolation of scattered data: Distance matrices and conditionally positive definite functions
Micchelli, C. A. (1986) · Constructive Approximation · doi:10.1007/bf01893414 · Cited by 1,247
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
(2017) · Approximation Techniques for Engineers · doi:10.1201/9781315205007-4 · Cited by 1,155
A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
Kimeldorf, G. S., & Wahba, G. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697089 · Cited by 939
(2018) · Physics Subject Headings (PhySH) · doi:10.29172/0660b3fe-654b-49c9-a7fa-79f18efe2aa0 · Cited by 882
DeVore, R. A. (1998) · Acta Numerica · doi:10.1017/s0962492900002816 · Cited by 877
Probabilistic Solution of Ill-Posed Problems in Computational Vision
Marroquin, J., Mitter, S., & Poggio, T. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478393 · Cited by 766
Self-citationIll-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
Self-citationA Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
Self-citationThe Theory of Radial Basis Function Approximation in 1990
Powell, M. J. D. (1992) · Advances in Numerical Analysis · doi:10.1093/oso/9780198534396.003.0003 · Cited by 576
Bottou, L., & Vapnik, V. (1992) · Neural Computation · doi:10.1162/neco.1992.4.6.888 · Cited by 542
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Wahba, G. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349743 · Cited by 523
An Equivalence Between Sparse Approximation and Support Vector Machines
Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017269 · Cited by 506
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.2307/1990404 · Cited by 495
Chen, S., & Donoho, D. L. (1994) · Cited by 467
(1992) · neural information processing systems · Cited by 460
Spline Smoothing: The Equivalent Variable Kernel Method
Silverman, B. W. (1984) · The Annals of Statistics · doi:10.1214/aos/1176346710 · Cited by 441
Numerical Procedures for Surface Fitting of Scattered Data by Radial Functions
Dyn, N., Levin, D., & Rippa, S. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907043 · Cited by 402
A course on empirical processes
Dudley, R. M. (1984) · Lecture Notes in Mathematics · doi:10.1007/bfb0099432 · Cited by 384
Efficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80062-5 · Cited by 373
A unifying information-theoretic framework for independent component analysis
Lee, T.-W., Girolami, M., Bell, A. J., & Sejnowski, T. J. (2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)00101-2 · Cited by 355
Model Selection for Support Vector Machines
Chapelle, O., & Vapnik, V. N. (1999) · Cited by 355
Incorporating prior information in machine learning by creating virtual examples
Niyogi, P., Girosi, F., & Poggio, T. (1998) · Proceedings of the IEEE · doi:10.1109/5.726787 · Cited by 313
Self-citationOn a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion
Smola, A. J., & Schölkopf, B. (1998) · Algorithmica · doi:10.1007/pl00013831 · Cited by 298
Vapnik, V. N. (1982) · Springer eBooks · Cited by 295
Prior Knowledge in Support Vector Kernels
Schölkopf, B., Simard, P., Smola, A. J., & Vapnik, V. N. (1998) · Cited by 295
The nonlinear PCA learning rule in independent component analysis
Oja, E. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)00045-3 · Cited by 218
Probabilistic Kernel Regression Models
Jaakkola, T., & Haussler, D. H. (1999) · Cited by 208
Niyogi, P., & Girosi, F. (1996) · Neural Computation · doi:10.1162/neco.1996.8.4.819 · Cited by 172
Williamson, R. C., Smola, A. J., & Scholkopf, B. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.945262 · Cited by 172
Positive definite functions and generalizations, an historical survey
Stewart, J. (1976) · Rocky Mountain Journal of Mathematics · doi:10.1216/rmj-1976-6-3-409 · Cited by 167
An experimental and theoretical comparison of model selection methods
Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225301 · Cited by 167
Ivanov, V. V., & Gupta, G. D. (1978) · Journal of Applied Mechanics · doi:10.1115/1.3424255 · Cited by 142
On optimal nonlinear associative recall
Poggio, T. (1975) · Biological Cybernetics · doi:10.1007/bf02281970 · Cited by 139
Self-citationFat-shattering and the learnability of real-valued functions
Bartlett, P. L., Long, P. M., & Williamson, R. C. (1994) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/180139.181158 · Cited by 117
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
Development of low entropy coding in a recurrent network
Harpur, G. F., & Prager, R. W. (1996) · Network Computation in Neural Systems · doi:10.1088/0954-898x/7/2/007 · Cited by 91
Regularization methods for linear inverse problems
Bertero, M. (1986) · Lecture notes in mathematics · doi:10.1007/bfb0072660 · Cited by 87
A Sparse Representation for Function Approximation
Poggio, T., & Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017250 · Cited by 81
Self-citationLearning Nonlinear Overcomplete Representations for Efficient Coding
Lewicki, M. S., & B, T. J. S. A. (1997) · Cited by 72
On the Noise Model of Support Vector Machines Regression
Pontil, M., Mukherjee, S., & Girosi, F. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40992-0_24 · Cited by 59
Self-citationScale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa‐Bianchi, N., & Haussler, D. H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366858 · Cited by 53
Learning linear, sparse, factorial codes
Olshausen, B. A. (1996) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 40
Neural networks for localized approximation of real functions
Mhaskar, H. N. (2002) · Machine learning for signal processing ... · doi:10.1109/nnsp.1993.471870 · Cited by 27
From Regression to Classification in Support Vector Machines
Pontil, M., Rifkin, R. M., & Evgeniou, T. (1998) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 24
Self-citationModels of Noise and Robust Estimation
Girosi, F. (1991) · Defense Technical Information Center (DTIC) · Cited by 23
On the V γ Dimension for Regression in Reproducing Kernel Hilbert Spaces
Evgeniou, T., & Pontil, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46769-6_9 · Cited by 23
Self-citationBounds on the Generalization Performance of Kernel Machine Ensembles
Evgeniou, T., Perez-Breva, L., Pontil, M., & Poggio, T. (2000) · Cited by 21
Self-citationA Note on Support Vector Machine Degeneracy
Rifkin, R. M., Pontil, M., & Verri, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46769-6_21 · Cited by 16
Self-citationFrom Regression to Classication in Support Vector Machines
Pontil, M., Rifkin, R. M., & Evgeniou, T. (1999) · Cited by 3
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
(2006) · Cited by 3,624
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
Self-citationOn 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
Regularized multi--task learning
Evgeniou, T., & Pontil, M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014067 · Cited by 1,433
Self-citationObject perception as Bayesian inference
Kersten, D., Mamassian, P., & Yuille, A. (2004) · Annual Review of Psychology · doi:10.1146/annurev.psych.55.090902.142005 · Cited by 1,269
Metadata
- Authors
- Evgeniou, T., Pontil, M., & Poggio, T.
- Venue
- Advances in Computational Mathematics
- Published
- 2000-04
- Volume
- 13
- Issue
- 1
- Pages
- 1-50
- ISSN
- 1019-7168 (ISSN-L)
- 1572-9044
- OpenAlex
- W2110652811
- Cited by
- 1,197
- References
- 88
- FWCI
- 37.90
- 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.