The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A Generalized Representer Theorem
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Self-citationAronszajn, 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.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
Mangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
XVI. Functions of positive and negative type, and their connection the theory of integral equations
Mercer, J. (1909) · Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character · doi:10.1098/rsta.1909.0016 · Cited by 2,001
Kernel principal component analysis
Schölkopf, B., Smola, A., & Müller, K.-R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0020217 · Cited by 1,942
Self-citationTheoretical Foundations of the Potential Function Method in Pattern Recognition Learning
Айзерман, М. А. (1964) · Automation and Remote Control · Cited by 1,485
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
Some results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254
Harmonic Analysis on Semigroups
Berg, C., Christensen, J. P. R., & Ressel, P. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1128-0 · Cited by 1,134
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Woodhouse, C. (2024) · The Astrophotography Manual · doi:10.4324/9781003463108-19 · Cited by 1,037
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
Prediction with Gaussian Processes: From Linear Regression to Linear Prediction and Beyond
Williams, C. K. I. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_23 · Cited by 659
Text Classification using String Kernels
Lodhi, H. M., Shawe-Taylor, J. S., Cristianini, N., & Watkins, C. J. C. H. (2000) · Bristol Research (University of Bristol) · Cited by 620
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.2307/1990404 · Cited by 495
Kernel principal component analysis
Schölkopf, B., Smola, A. J., & Müller, K. (1999) · International Conference on Neural Information Processing · doi:10.5555/299094.299113 · Cited by 390
Self-citationSupport Vector Machines, Reproducing Kernel Hilbert Spaces, and Randomized GACV
Wahba, G. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0009 · Cited by 318
Generalization Performance of Support Vector Machines and Other Pattern Classifiers
Bartlett, P. L., & Shawe-Taylor, J. S. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/1130.003.0007 · Cited by 286
The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines
Frieß, T.-T., Cristianini, N., & Campbell, C. (1998) · International Conference on Machine Learning · Cited by 276
Watkins, C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0006 · Cited by 244
Asymptotic Analysis of Penalized Likelihood and Related Estimators
Cox, D. D., & O'Sullivan, F. (1990) · The Annals of Statistics · doi:10.1214/aos/1176347872 · Cited by 207
Algorithmic Stability and Generalization Performance
Bousquet, O., Elisseeff, A., & Bioinformatics, B. (2000) · Cited by 87
Semiparametric Support Vector and Linear Programming Machines
Smola, A. J., Frieß, T.-T., & Schölkopf, B. (1998) · Cited by 80
Self-citation
Cited by
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Self-citationA Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
“In light of the representer theorem [82], the parameter θ can be defined as θ = ∑n i=1 αiΦ(xi), and thus we have”
Background(2015) · Cited by 2,857
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
“We have thus derived the “kernel trick” 34 —albeit in a round-about fashion.”
Method
Metadata
- Authors
- Schölkopf, B., Herbrich, R., & Smola, A. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 416-426
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1540155273
- Cited by
- 1,589
- References
- 27
- FWCI
- 7.37
- Type
- conference paper
- 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.