How deeply does Sutskever's List cover support vector machine?

Defines sharp boundaries and maximum margins, and notes convex optimization, but does not derive the optimization procedure.

Support vector machine

As explained in Sutskever's List

A support vector machine is a supervised learning model that determines decision boundaries using maximum-margin principles.

A support vector machine (SVM) is a shallow classifier that selects a sharp, maximum-margin decision boundary in a fixed feature space. That space may be explicit or kernel-defined. section 2.0 section 3.8

SVMs gained popularity in the 1990s and 2000s partly because convex optimization offered an appealing guarantee: a globally optimal solution could be found efficiently. section 2.0

In computer vision pipelines, SVMs classified engineered image features rather than learning hierarchical representations. Systems built features from descriptors such as SIFT, then used shallow learners such as SVMs to map those inputs to outputs. section 2.1

An SVM has no depth to increase: extra computation can solve its optimization more precisely, but does not create the deep-learning scaling loop associated with learning layered representations. section 3.8

How Sutskever's List covers it

liveBook manning.com

Read Sutskever's List on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Grokking Machine LearningA model that separates classes or fits targets using an optimized margin and support vectors.
liveBook manning.com

Machine Learning Algorithms in DepthA supervised learning model that separates classes by selecting a decision boundary with a large margin, optionally using a kernel for nonlinear separation.
liveBook manning.com

Data-Driven CybersecurityA support vector machine is a supervised-learning model that separates classes or predicts values by constructing a boundary based on support vectors.
liveBook manning.com

Ensemble Methods for Machine LearningA support vector machine is a supervised learning model that finds a maximum-margin separating function, optionally using kernels to represent nonlinear decision boundaries.

Compare how 5 books explain support vector machine →

Related concepts

kernel functionuses · A kernel function is a mathematical function that measures similarity between pairs of inputs, often representing an inner product in an implicit feature space.
convex optimizationuses · Convex optimization is the minimization or maximization of a convex or concave objective over a convex feasible set, a structure that permits global optimality guarantees.
anomaly detectionuses · Anomaly detection is the identification of observations, events, or behaviors that substantially deviate from expected patterns or a normal baseline.
classifierkind of · A classifier is a predictive computational model that assigns inputs to one or more discrete classes or categories.

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.