Theory of Intelligence
MACHINE LEARNING•Classic Algorithms•Support Vector Machines•1.3 Nonlinear SVMs & Kernels

Introduction

Handle curved class boundaries by adding features, and use the kernel trick (polynomial and Gaussian RBF kernels) to get the same effect without the cost.

Introduction

Many datasets can't be separated by a straight line. Picture red points clustered in the middle of a plot, surrounded by a ring of blue points. No straight street can separate them.

SVMs have a beautiful solution. Imagine the points are on a flat sheet of rubber. If you push the middle of the sheet up into a hill, the red points rise while the blue ring stays low — and now a flat plane can slice between them. In other words: move the data into a higher-dimensional space where a straight boundary works.

This topic shows two ways to do that: adding features explicitly, and the famous kernel trick, which gets the same result without ever computing the new features.

Discuss theoretical concepts, mathematical formulas, and architectural foundations.

Supports inline code with `backticks`
No comments yet. Be the first to start the discussion!