English

Support vector machines and linear regression coincide with very high-dimensional features

Machine Learning 2021-10-28 v2 Statistics Theory Machine Learning Statistics Theory

Abstract

The support vector machine (SVM) and minimum Euclidean norm least squares regression are two fundamentally different approaches to fitting linear models, but they have recently been connected in models for very high-dimensional data through a phenomenon of support vector proliferation, where every training example used to fit an SVM becomes a support vector. In this paper, we explore the generality of this phenomenon and make the following contributions. First, we prove a super-linear lower bound on the dimension (in terms of sample size) required for support vector proliferation in independent feature models, matching the upper bounds from previous works. We further identify a sharp phase transition in Gaussian feature models, bound the width of this transition, and give experimental support for its universality. Finally, we hypothesize that this phase transition occurs only in much higher-dimensional settings in the 1\ell_1 variant of the SVM, and we present a new geometric characterization of the problem that may elucidate this phenomenon for the general p\ell_p case.

Keywords

Cite

@article{arxiv.2105.14084,
  title  = {Support vector machines and linear regression coincide with very high-dimensional features},
  author = {Navid Ardeshir and Clayton Sanford and Daniel Hsu},
  journal= {arXiv preprint arXiv:2105.14084},
  year   = {2021}
}

Comments

34 pages, 9 figures

R2 v1 2026-06-24T02:35:17.180Z