betaFeedback

WorksMathematics

Fast rates for support vector machines using Gaussian kernels

Abstract

For binary classification we establish learning rates up to the order of n−1n^{-1} for support vector machines (SVMs) with hinge loss and Gaussian RBF kernels. These rates are in terms of two assumptions on the considered distributions: Tsybakov's noise assumption to establish a small estimation error, and a new geometric noise condition which is used to bound the approximation error. Unlike previously proposed concepts for bounding the approximation error, the geometric noise assumption does not employ any smoothness assumption.

Paper details

vlnc:W_8vjzb4m3
Version
v1 · latest
Published
Added
License
LicenseRef-arXiv-undeclared
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…