Abstract
We derive new bounds for the generalization error of kernel machines, such as support vector machines and related regularization networks by obtaining new bounds on their covering numbers. The proofs make use of a viewpoint that is apparently novel in the field of statistical learning theory. The hypothesis class is described in terms of a linear operator mapping from a possibly infinite-dimensional unit ball in feature space into a finite-dimensional space. The covering numbers of the class are then determined via the entropy numbers of the operator. These numbers, which characterize the degree of compactness of the operator, can be bounded in terms of the eigenvalues of an integral operator induced by the kernel function used by the machine. As a consequence, we are able to theoretically explain the effect of the choice of kernel function on the generalization performance of support vector machines.
Keywords
MathematicsEntropy (arrow of time)Eigenvalues and eigenvectorsStatistical learning theoryBounded functionSupport vector machinePositive-definite kernelOperator (biology)Discrete mathematicsComputer scienceArtificial intelligenceOperator theoryMathematical analysisFourier integral operator
Affiliated Institutions
Related Publications
Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
In this letter, we show a direct relation between spectral embedding methods and kernel principal components analysis and how both are special cases of a more general learning p...
Gaussian regression and optimal finite dimensional linear models
The problem of regression under Gaussian assumptions is treated generally. The relationship between Bayesian prediction, regularization and smoothing is elucidated. The ideal re...
Kernel Logistic Regression and the Import Vector Machine
The support vector machine (SVM) is known for its good performance in two-class classification, but its extension to multiclass classification is still an ongoing research issue...
Kernel k-means
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have ...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
Publication Info
- Year
- 2001
- Type
- article
- Volume
- 47
- Issue
- 6
- Pages
- 2516-2532
- Citations
- 169
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
169
OpenAlex
Cite This
Robert C. Williamson,
Alex Smola,
Bernhard Schölkopf
(2001).
Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators.
IEEE Transactions on Information Theory
, 47
(6)
, 2516-2532.
https://doi.org/10.1109/18.945262
Identifiers
- DOI
- 10.1109/18.945262