On the Precise Error Analysis of Support Vector Machines
Abla Kammoun, Mohamed-Slim AlouiniFellow
IEEE Open Journal of Signal Processing · 2021
doi:10.1109/ojsp.2021.3051849 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This paper investigates the asymptotic behavior of the soft-margin and hard-margin support vector machine (SVM) classifiers for simultaneously high-dimensional and numerous data (large <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> and large <inline-formula><tex-math notation="LaTeX">$p$</tex-math></inline-formula> with <inline-formula><tex-math notation="LaTeX">$n/p\to \delta$</tex-math></inline-formula>) drawn from a Gaussian mixture distribution. Sharp predictions of the classification error rate of the hard-margin and soft-margin SVM are provided, as well as asymptotic limits of as such important parameters as the margin and the bias. As a further outcome, the analysis allows for the identification of the maximum number of training samples that the hard-margin SVM is able to separate. The precise nature of our results allows for an accurate performance comparison of the hard-margin and soft-margin SVM as well as a better understanding of the involved parameters (such as the number of measurements and the margin parameter) on the classification performance. Our analysis, confirmed by a set of numerical experiments, builds upon the convex Gaussian min-max Theorem, and extends its scope to new problems never studied before by this framework.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.