Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
Top Cited Papers
- 1 July 2003
- journal article
- Published by MIT Press in Neural Computation
- Vol. 15 (7) , 1667-1689
- https://doi.org/10.1162/089976603321891855
Abstract
Support vector machines (SVMs) with the gaussian (RBF) kernel have been popular for practical use. Model selection in this class of SVMs involves two hyper parameters: the penalty parameter C and the kernel width σ. This letter analyzes the behavior of the SVM classifier when these hyper parameters take very small or very large values. Our results help in understanding the hyperparameter space that leads to an efficient heuristic method of searching for hyperparameter values with small generalization errors. The analysis also indicates that if complete model selection using the gaussian kernel has been conducted, there is no need to consider linear SVM.Keywords
This publication has 4 references indexed in Scilit:
- Training v-Support Vector Classifiers: Theory and AlgorithmsNeural Computation, 2001
- Formulations of Support Vector Machines: A Note from an Optimization Point of ViewNeural Computation, 2001
- Bounds on Error Expectation for Support Vector MachinesNeural Computation, 2000
- Interpolation of scattered data: Distance matrices and conditionally positive definite functionsConstructive Approximation, 1986