<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Support Vector Machines on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/support-vector-machines/</link><description>Recent content in Support Vector Machines on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 27 Jan 2026 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/support-vector-machines/index.xml" rel="self" type="application/rss+xml"/><item><title>ML Math Derivations (8): Support Vector Machines</title><link>https://www.chenk.top/en/ml-math-derivations/08-support-vector-machines/</link><pubDate>Tue, 27 Jan 2026 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/ml-math-derivations/08-support-vector-machines/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>Hook.&lt;/strong> You have two clouds of points and infinitely many lines that separate them. Which line is &amp;ldquo;best&amp;rdquo;? SVM gives a startlingly geometric answer: the line that sits in the middle of the &lt;em>widest empty corridor&lt;/em> between the two classes. Push that single idea through Lagrangian duality and it produces a sparse model (only the points on the corridor wall matter), a quadratic program with a global optimum, and — almost as a free gift — the kernel trick that lets the same linear machinery carve curved boundaries in infinite-dimensional spaces.&lt;/p></description></item></channel></rss>