Qualitative Robustness of Support Vector Machines

Details Qualitative Robustness of Support Vector Machines Qualitative Robustness of Support Vector Machines

2009-12-04

arxiv.org/abs/0912.0874v2

Statistics

Machine Learning

Scientific paper

Support vector machines have attracted much attention in theoretical and in applied statistics. Main topics of recent interest are consistency, learning rates and robustness. In this article, it is shown that support vector machines are qualitatively robust. Since support vector machines can be represented by a functional on the set of all probability measures, qualitative robustness is proven by showing that this functional is continuous with respect to the topology generated by weak convergence of probability measures. Combined with the existence and uniqueness of support vector machines, our results show that support vector machines are the solutions of a well-posed mathematical problem in Hadamard's sense.

Affiliated with

Also associated with

No associations

Rating

Qualitative Robustness 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 Qualitative Robustness of Support Vector Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Qualitative Robustness of Support Vector Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420884