Robustness and Regularization of Support Vector Machines

Details Robustness and Regularization of Support Vector Machines Robustness and Regularization of Support Vector Machines

2008-03-25

arxiv.org/abs/0803.3490v2

Journal of Machine Learning Research, vol 10, 1485-1510, year 2009

Computer Science

Learning

Scientific paper

We consider regularized support vector machines (SVMs) and show that they are precisely equivalent to a new robust optimization formulation. We show that this equivalence of robust optimization and regularization has implications for both algorithms, and analysis. In terms of algorithms, the equivalence suggests more general SVM-like algorithms for classification that explicitly build in protection to noise, and at the same time control overfitting. On the analysis front, the equivalence of robustness and regularization, provides a robust optimization interpretation for the success of regularized SVMs. We use the this new robustness interpretation of SVMs to give a new proof of consistency of (kernelized) SVMs, thus establishing robustness as the reason regularized SVMs generalize well.

Affiliated with

Also associated with

No associations

Rating

Robustness and Regularization of Support Vector Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness and Regularization of Support Vector Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness and Regularization of Support Vector Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348491