Support Vector Machines

Find the widest street between two classes. That is the entire idea.

Build 1.5 hr Python

Prerequisites: Phase 1 (Lessons 08 Optimization, 14 Norms and Distances, 18 Convex Optimization)

#Learning Objectives

  • Implement a linear SVM from scratch using hinge loss and gradient descent on the primal formulation
  • Explain the maximum margin principle and identify support vectors from a trained model
  • Compare linear, polynomial, and RBF kernels and explain how the kernel trick avoids explicit high-dimensional mapping
  • Evaluate the tradeoff controlled by the C parameter between margin width and classification errors
Full Access lesson

Keep going. The rest of this lesson is one step away.

Unlock all 503 lessons, video, code, quizzes and every future update. Pay in your own currency with Paystack.

The text and code of this lesson are based on AI Engineering from Scratch by Rohit Ghumare, MIT licensed.