Local Support Vector Machines:Formulation and Analysis

09/14/2013
by   Ravi Ganti, et al.
0

We provide a formulation for Local Support Vector Machines (LSVMs) that generalizes previous formulations, and brings out the explicit connections to local polynomial learning used in nonparametric estimation literature. We investigate the simplest type of LSVMs called Local Linear Support Vector Machines (LLSVMs). For the first time we establish conditions under which LLSVMs make Bayes consistent predictions at each test point x_0. We also establish rates at which the local risk of LLSVMs converges to the minimum value of expected local risk at each point x_0. Using stability arguments we establish generalization error bounds for LLSVMs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2009

Qualitative Robustness of Support Vector Machines

Support vector machines have attracted much attention in theoretical and...
research
08/14/2007

Fast rates for support vector machines using Gaussian kernels

For binary classification we establish learning rates up to the order of...
research
06/03/2020

Near-Tight Margin-Based Generalization Bounds for Support Vector Machines

Support Vector Machines (SVMs) are among the most fundamental tools for ...
research
03/01/2017

L^3-SVMs: Landmarks-based Linear Local Support Vectors Machines

For their ability to capture non-linearities in the data and to scale to...
research
03/01/2019

Quantitative Robustness of Localized Support Vector Machines

The huge amount of available data nowadays is a challenge for kernel-bas...
research
12/05/2019

Modeling and Prediction of Iran's Steel Consumption Based on Economic Activity Using Support Vector Machines

The steel industry has great impacts on the economy and the environment ...
research
04/22/2020

Eigendecomposition of Q in Equally Constrained Quadratic Programming

When applying eigenvalue decomposition on the quadratic term matrix in a...

Please sign up or login with your details

Forgot password? Click here to reset