<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SVM on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/svm/</link><description>Recent content in SVM 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/svm/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><item><title>Essence of Linear Algebra (15): Linear Algebra in Machine Learning</title><link>https://www.chenk.top/en/linear-algebra/15-linear-algebra-in-machine-learning/</link><pubDate>Wed, 09 Apr 2025 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/linear-algebra/15-linear-algebra-in-machine-learning/</guid><description>&lt;p>Ask any senior ML engineer &amp;ldquo;what math do you actually use day to day?&amp;rdquo; and the answer is almost always &lt;strong>linear algebra&lt;/strong>. Calculus shows up in derivations; probability shows up in modeling; but the runtime of a real ML system is dominated by matrix-vector multiplies, decompositions, and projections. PyTorch&amp;rsquo;s &lt;code>Linear&lt;/code>, scikit-learn&amp;rsquo;s &lt;code>PCA&lt;/code>, Spark MLlib&amp;rsquo;s &lt;code>ALS&lt;/code>, and a Transformer&amp;rsquo;s attention head are all the same primitive in different costumes.&lt;/p>
&lt;p>This chapter covers the algorithms used in production ML systems — PCA, LDA, SVM with kernels, matrix factorization for recommenders, regularized linear regression, neural network layers, and attention — and explains the linear algebra behind each. We focus on intuition first, then geometry, and finally formulas.&lt;/p></description></item><item><title>Kernel Methods (5): Kernel SVM, Kernel PCA, and Kernel Ridge Regression</title><link>https://www.chenk.top/en/kernel-methods/05-kernel-algorithms/</link><pubDate>Tue, 14 Dec 2021 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/kernel-methods/05-kernel-algorithms/</guid><description>&lt;p>Your features are two-dimensional, your data is clearly a circle inside a circle, and &lt;code>LinearSVC&lt;/code> is at 50% accuracy with the wide-eyed look of an algorithm that genuinely believes a straight line is the answer. You stare at the scatter plot, you stare at the model, and somewhere in the back of your head the words &lt;em>kernel SVM&lt;/em> surface. You type &lt;code>kernel='rbf'&lt;/code>, the accuracy jumps to 0.98, and the rest of the afternoon you wonder what exactly just happened — and why the same trick also gives you a Kernel PCA that unfolds a Swiss roll and a Kernel Ridge regressor that fits a sine wave with three lines of code.&lt;/p></description></item></channel></rss>