<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hinge Loss on Arshad Siddiqui</title><link>https://arshadhs.github.io/tags/hinge-loss/</link><description>Recent content in Hinge Loss on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Thu, 28 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://arshadhs.github.io/tags/hinge-loss/index.xml" rel="self" type="application/rss+xml"/><item><title>Primal and Dual Perspective for Linear SVM</title><link>https://arshadhs.github.io/docs/ai/maths/010-linear-algebra/07-dimensionality-reduction/15-primal-dual-perspective-for-linear-svm/</link><pubDate>Thu, 28 May 2026 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/maths/010-linear-algebra/07-dimensionality-reduction/15-primal-dual-perspective-for-linear-svm/</guid><description>&lt;h1 id="primal-and-dual-perspective-for-linear-svm">
 Primal and Dual Perspective for Linear SVM
 
 &lt;a class="anchor" href="#primal-and-dual-perspective-for-linear-svm">#&lt;/a>
 
&lt;/h1>
&lt;p>A linear Support Vector Machine finds a hyperplane that separates two classes with the maximum possible margin.&lt;/p>
&lt;p>The primal view gives the direct geometric optimisation problem.
The dual view rewrites the problem using Lagrange multipliers and reveals why only support vectors matter.&lt;/p>
&lt;blockquote class="book-hint info">
&lt;p>&lt;strong>Key takeaway:&lt;/strong> Linear SVM maximises the margin by minimising
&lt;span>
( \frac{1}{2}|w|^2 )
&lt;/span>&lt;/p>
&lt;p>subject to correct-classification constraints.
The dual solution expresses
&lt;span>
( w )
&lt;/span>&lt;/p></description></item></channel></rss>