Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

December 2017, Vol. 29, No. 12, Pages 3353-3380
(doi: 10.1162/neco_a_00968)
© 2017 Massachusetts Institute of Technology
Learning Rates for Classification with Gaussian Kernels
Article PDF (269.67 KB)
Abstract

This letter aims at refined error analysis for binary classification using support vector machine (SVM) with gaussian kernel and convex loss. Our first result shows that for some loss functions, such as the truncated quadratic loss and quadratic loss, SVM with gaussian kernel can reach the almost optimal learning rate provided the regression function is smooth. Our second result shows that for a large number of loss functions, under some Tsybakov noise assumption, if the regression function is infinitely smooth, then SVM with gaussian kernel can achieve the learning rate of order m–1, where m is the number of samples.