<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: MjolnirBearer</title>
    <description>The latest articles on DEV Community by MjolnirBearer (@bugged_but_alive).</description>
    <link>https://dev.to/bugged_but_alive</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3996230%2F6d0cdc89-8934-4e9f-9b3f-f4ba10405a7c.png</url>
      <title>DEV Community: MjolnirBearer</title>
      <link>https://dev.to/bugged_but_alive</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/bugged_but_alive"/>
    <language>en</language>
    <item>
      <title>Support Vector Machines</title>
      <dc:creator>MjolnirBearer</dc:creator>
      <pubDate>Mon, 22 Jun 2026 15:39:18 +0000</pubDate>
      <link>https://dev.to/bugged_but_alive/support-vector-machines-7io</link>
      <guid>https://dev.to/bugged_but_alive/support-vector-machines-7io</guid>
      <description>&lt;p&gt;Today I brushed up &lt;strong&gt;SVM&lt;/strong&gt;, and ngl, it felt confusing at first.&lt;br&gt;
But once the main idea clicked, everything started making sense.&lt;/p&gt;




&lt;h2&gt;
  
  
  🎯 The Core Idea
&lt;/h2&gt;

&lt;p&gt;SVM doesn’t just find &lt;strong&gt;any&lt;/strong&gt; boundary between classes.&lt;/p&gt;

&lt;p&gt;It finds the &lt;strong&gt;best possible boundary&lt;/strong&gt; — the one with the &lt;strong&gt;maximum margin&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Think of it like this:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;If two groups are standing apart, SVM tries to build the &lt;strong&gt;widest road&lt;/strong&gt; between them.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;Wider road = safer separation.&lt;/p&gt;

&lt;p&gt;And safer separation = better predictions on new data.&lt;/p&gt;




&lt;h2&gt;
  
  
  📏 What is Margin?
&lt;/h2&gt;

&lt;p&gt;Margin is simply:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Distance between the decision boundary and the nearest data points.&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Why does it matter?&lt;/p&gt;

&lt;p&gt;✅ Bigger margin = better generalization&lt;br&gt;
✅ Less chance of messing up on unseen data&lt;/p&gt;

&lt;p&gt;Simple but powerful.&lt;/p&gt;




&lt;h2&gt;
  
  
  ⭐ Support Vectors
&lt;/h2&gt;

&lt;p&gt;This part was interesting.&lt;/p&gt;

&lt;p&gt;Not every point matters.&lt;/p&gt;

&lt;p&gt;Only the points closest to the boundary actually affect where the boundary is placed.&lt;/p&gt;

&lt;p&gt;These important points are called:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Support Vectors&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;That’s literally where SVM gets its name from.&lt;/p&gt;

&lt;p&gt;Main characters fr 😤&lt;/p&gt;




&lt;h2&gt;
  
  
  🛣 Large Margin Classification
&lt;/h2&gt;

&lt;p&gt;The whole goal:&lt;/p&gt;

&lt;p&gt;Find the boundary with the &lt;strong&gt;largest margin possible&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Not just separation.&lt;/p&gt;

&lt;p&gt;Confident separation.&lt;/p&gt;

&lt;p&gt;That distinction made a lot of sense today.&lt;/p&gt;




&lt;h2&gt;
  
  
  🔒 Hard Margin SVM
&lt;/h2&gt;

&lt;p&gt;Works when data is &lt;strong&gt;perfectly separable&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Means:&lt;/p&gt;

&lt;p&gt;❌ No mistakes allowed&lt;br&gt;
✅ Strict separation&lt;/p&gt;

&lt;p&gt;Problem?&lt;/p&gt;

&lt;p&gt;Very sensitive to outliers.&lt;/p&gt;

&lt;p&gt;One weird point can mess things up.&lt;/p&gt;




&lt;h2&gt;
  
  
  🌊 Soft Margin SVM
&lt;/h2&gt;

&lt;p&gt;This is more practical.&lt;/p&gt;

&lt;p&gt;Real-world data is messy.&lt;/p&gt;

&lt;p&gt;Soft margin allows:&lt;/p&gt;

&lt;p&gt;✅ Some mistakes&lt;br&gt;
✅ Better flexibility&lt;br&gt;
✅ Better generalization&lt;/p&gt;

&lt;p&gt;Basically:&lt;/p&gt;

&lt;p&gt;“Okay, a few mistakes are fine if the overall boundary is better.”&lt;/p&gt;

&lt;p&gt;Makes way more sense.&lt;/p&gt;




&lt;h2&gt;
  
  
  🎛 C Hyperparameter
&lt;/h2&gt;

&lt;p&gt;This controls how strict SVM is.&lt;/p&gt;

&lt;h3&gt;
  
  
  Big C:
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Tries hard to avoid mistakes&lt;/li&gt;
&lt;li&gt;Smaller margin&lt;/li&gt;
&lt;li&gt;More strict&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Small C:
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Allows more mistakes&lt;/li&gt;
&lt;li&gt;Bigger margin&lt;/li&gt;
&lt;li&gt;More relaxed&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;So basically:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;C = strictness controller&lt;/strong&gt;&lt;/p&gt;




&lt;h2&gt;
  
  
  🌀 When Linear Boundaries Fail
&lt;/h2&gt;

&lt;p&gt;Sometimes data looks weird.&lt;/p&gt;

&lt;p&gt;Like circles inside circles.&lt;/p&gt;

&lt;p&gt;A straight line won’t work there.&lt;/p&gt;

&lt;p&gt;That’s where SVM gets cooler.&lt;/p&gt;




&lt;h2&gt;
  
  
  ✨ Kernel Trick
&lt;/h2&gt;

&lt;p&gt;Probably the coolest part.&lt;/p&gt;

&lt;p&gt;Kernel trick helps SVM handle non-linear data by transforming it into higher dimensions.&lt;/p&gt;

&lt;p&gt;But the crazy part?&lt;/p&gt;

&lt;p&gt;It does this &lt;strong&gt;without actually computing the transformation directly&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Felt like magic.&lt;/p&gt;




&lt;h2&gt;
  
  
  🔧 Types of Kernels
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Polynomial Kernel
&lt;/h3&gt;

&lt;p&gt;Useful when patterns are polynomial-like.&lt;/p&gt;

&lt;p&gt;Creates curved boundaries.&lt;/p&gt;

&lt;h3&gt;
  
  
  RBF Kernel
&lt;/h3&gt;

&lt;p&gt;Most common one.&lt;/p&gt;

&lt;p&gt;Super flexible.&lt;/p&gt;

&lt;p&gt;Works great for complex data.&lt;/p&gt;




&lt;p&gt;This was SVMs in a nutshell for me..&lt;br&gt;
Simple idea..yet powerful&lt;/p&gt;

</description>
      <category>machinelearning</category>
    </item>
  </channel>
</rss>
