Skip to content

Support-vector networks

Why this mattered

Support-vector networks mattered because it turned statistical learning theory into a practical, competitive machine-learning method. Cortes and Vapnik showed how a classifier could be built by maximizing the margin between classes, with the final decision boundary depending only on a subset of training examples: the support vectors. This reframed classification away from fitting all data points or hand-designing feature rules, toward solving a well-defined convex optimization problem with explicit capacity control.

The key paradigm shift was the combination of margin maximization, slack variables for nonseparable data, and kernel-based nonlinear decision functions. After this paper, high-dimensional nonlinear classification could be done without explicitly constructing the high-dimensional feature space, while still retaining a strong theoretical account of generalization. That made support vector machines unusually attractive in the late 1990s and early 2000s for text classification, bioinformatics, handwriting recognition, and other domains where feature spaces were large and training data were limited.

Its later importance also lies in how it shaped the language of modern machine learning. Concepts such as regularization, convex surrogate losses, kernel methods, sparse decision rules, and generalization through capacity control became central to the field. Although deep learning later displaced SVMs in many perceptual tasks, the paper helped establish the template for learning algorithms that are theoretically grounded, optimization-driven, and effective in high-dimensional settings.

Abstract

(no abstract available)

Sources