<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Study-Notes on Nick Liu - Software Engineer</title>
    <link>https://nick-liu.com/tags/study-notes/</link>
    <description>Recent content in Study-Notes on Nick Liu - Software Engineer</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>nickboy@users.noreply.github.com (Nick Liu)</managingEditor>
    <webMaster>nickboy@users.noreply.github.com (Nick Liu)</webMaster>
    <copyright>2026 Nick Liu</copyright>
    <lastBuildDate>Fri, 10 Jul 2026 20:05:23 -0700</lastBuildDate><atom:link href="https://nick-liu.com/tags/study-notes/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Finding the Bottom of a Valley Blindfolded: Understanding Gradient Descent</title>
      <link>https://nick-liu.com/posts/ml-gradient-descent/</link>
      <pubDate>Fri, 20 Feb 2026 00:00:00 +0000</pubDate>
      <author>nickboy@users.noreply.github.com (Nick Liu)</author>
      <guid>https://nick-liu.com/posts/ml-gradient-descent/</guid>
      <description>&lt;div class=&#34;lead text-neutral-500 dark:text-neutral-400 !mb-9 text-xl&#34;&gt;&#xA;  &#xA;Imagine you&#39;re **blindfolded on a mountain** and you need to find the lowest valley. You can&#39;t see anything, but you *can* feel the ground under your feet. What would you do? You&#39;d feel which direction slopes downward, take a small step that way, and repeat. Congratulations. You just invented **gradient descent**, the algorithm behind nearly every modern AI system.&#xA;&#xA;&lt;/div&gt;&#xA;&#xA;&lt;nav class=&#34;series-progress&#34; aria-label=&#34;Series progress&#34;&gt;&#xA;    &lt;span class=&#34;series-progress-label&#34;&gt;ML Fundamentals · Part 1 of 3&lt;/span&gt;&#xA;    &lt;ol class=&#34;series-progress-dots&#34;&gt;&lt;li class=&#34;series-progress-dot is-current&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-gradient-descent/&#34; title=&#34;Finding the Bottom of a Valley Blindfolded: Understanding Gradient Descent&#34; aria-current=&#34;step&#34;&gt;1&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-entropy-and-information-gain/&#34; title=&#34;How Machines Ask Smart Questions: Entropy &amp;amp; Information Gain&#34;&gt;2&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-backpropagation/&#34; title=&#34;How Neural Networks Learn from Mistakes: Backpropagation Explained&#34;&gt;3&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;/ol&gt;&#xA;  &lt;/nav&gt;&#xA;&#xA;&lt;h2 class=&#34;relative group&#34;&gt;Why Should You Care?&#xA;    &lt;div id=&#34;why-should-you-care&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#why-should-you-care&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Optimization is everywhere. When your GPS finds the fastest route, when Netflix recommends a movie, when your phone recognizes your face, behind all of these is an algorithm trying to find the &lt;strong&gt;best possible answer&lt;/strong&gt; from a sea of possibilities. Gradient descent is &lt;em&gt;the&lt;/em&gt; workhorse algorithm that makes this happen.&lt;/p&gt;</description>
      
    </item>
    
    <item>
      <title>How Machines Ask Smart Questions: Entropy &amp; Information Gain</title>
      <link>https://nick-liu.com/posts/ml-entropy-and-information-gain/</link>
      <pubDate>Fri, 20 Feb 2026 00:00:00 +0000</pubDate>
      <author>nickboy@users.noreply.github.com (Nick Liu)</author>
      <guid>https://nick-liu.com/posts/ml-entropy-and-information-gain/</guid>
      <description>&lt;div class=&#34;lead text-neutral-500 dark:text-neutral-400 !mb-9 text-xl&#34;&gt;&#xA;  &#xA;Imagine you&#39;re playing **20 Questions**. You&#39;re trying to guess what animal your friend is thinking of. Would you start with &#34;Is it a golden retriever?&#34; or &#34;Does it live in water?&#34; The second question is obviously smarter, because it eliminates roughly half the possibilities in one shot. Decision trees in machine learning work exactly the same way, and they use **entropy** and **information gain** to figure out what the smartest question is.&#xA;&#xA;&lt;/div&gt;&#xA;&#xA;&lt;nav class=&#34;series-progress&#34; aria-label=&#34;Series progress&#34;&gt;&#xA;    &lt;span class=&#34;series-progress-label&#34;&gt;ML Fundamentals · Part 2 of 3&lt;/span&gt;&#xA;    &lt;ol class=&#34;series-progress-dots&#34;&gt;&lt;li class=&#34;series-progress-dot is-done&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-gradient-descent/&#34; title=&#34;Finding the Bottom of a Valley Blindfolded: Understanding Gradient Descent&#34;&gt;1&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot is-current&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-entropy-and-information-gain/&#34; title=&#34;How Machines Ask Smart Questions: Entropy &amp;amp; Information Gain&#34; aria-current=&#34;step&#34;&gt;2&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-backpropagation/&#34; title=&#34;How Neural Networks Learn from Mistakes: Backpropagation Explained&#34;&gt;3&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;/ol&gt;&#xA;  &lt;/nav&gt;&#xA;&#xA;&lt;h2 class=&#34;relative group&#34;&gt;What&amp;rsquo;s the Big Idea?&#xA;    &lt;div id=&#34;whats-the-big-idea&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#whats-the-big-idea&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h2&gt;&#xA;&lt;p&gt;When a machine learning algorithm builds a &lt;span class=&#34;flex cursor-pointer&#34;&gt;&#xA;  &#xA;  &#xA;  &#xA;  &#xA;    &lt;span&#xA;      class=&#34;rounded-md border border-primary-400 px-1 py-[1px] text-xs font-normal text-primary-700 dark:border-primary-600 dark:text-primary-400&#34;&gt;&#xA;  &#xA;    Decision Tree&#xA;  &lt;/span&gt;&#xA;&lt;/span&gt;&#xA;&#xA;, it needs to decide which question to ask first. Should it split the data by color? By size? By temperature? The answer comes from a beautifully simple concept: &lt;strong&gt;ask the question that reduces uncertainty the most&lt;/strong&gt;.&lt;/p&gt;</description>
      
    </item>
    
    <item>
      <title>How Neural Networks Learn from Mistakes: Backpropagation Explained</title>
      <link>https://nick-liu.com/posts/ml-backpropagation/</link>
      <pubDate>Fri, 20 Feb 2026 00:00:00 +0000</pubDate>
      <author>nickboy@users.noreply.github.com (Nick Liu)</author>
      <guid>https://nick-liu.com/posts/ml-backpropagation/</guid>
      <description>&lt;div class=&#34;lead text-neutral-500 dark:text-neutral-400 !mb-9 text-xl&#34;&gt;&#xA;  &#xA;When a factory produces a defective product, how do you trace the problem back through the assembly line to find which worker made the mistake? Neural networks face the exact same challenge. They have layers of &#34;workers&#34; (neurons), and when the final output is wrong, they need to figure out **who&#39;s responsible** and by how much. The algorithm that solves this is called **backpropagation**, and it&#39;s the reason deep learning works at all.&#xA;&#xA;&lt;/div&gt;&#xA;&#xA;&lt;nav class=&#34;series-progress&#34; aria-label=&#34;Series progress&#34;&gt;&#xA;    &lt;span class=&#34;series-progress-label&#34;&gt;ML Fundamentals · Part 3 of 3&lt;/span&gt;&#xA;    &lt;ol class=&#34;series-progress-dots&#34;&gt;&lt;li class=&#34;series-progress-dot is-done&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-gradient-descent/&#34; title=&#34;Finding the Bottom of a Valley Blindfolded: Understanding Gradient Descent&#34;&gt;1&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot is-done&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-entropy-and-information-gain/&#34; title=&#34;How Machines Ask Smart Questions: Entropy &amp;amp; Information Gain&#34;&gt;2&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;li class=&#34;series-progress-dot is-current&#34;&gt;&#xA;          &lt;a href=&#34;https://nick-liu.com/posts/ml-backpropagation/&#34; title=&#34;How Neural Networks Learn from Mistakes: Backpropagation Explained&#34; aria-current=&#34;step&#34;&gt;3&lt;/a&gt;&#xA;        &lt;/li&gt;&lt;/ol&gt;&#xA;  &lt;/nav&gt;&#xA;&#xA;&lt;h2 class=&#34;relative group&#34;&gt;Neural Networks Are Everywhere&#xA;    &lt;div id=&#34;neural-networks-are-everywhere&#34; class=&#34;anchor&#34;&gt;&lt;/div&gt;&#xA;    &#xA;    &lt;span&#xA;        class=&#34;absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none&#34;&gt;&#xA;        &lt;a class=&#34;text-primary-300 dark:text-neutral-700 !no-underline&#34; href=&#34;#neural-networks-are-everywhere&#34; aria-label=&#34;Anchor&#34;&gt;#&lt;/a&gt;&#xA;    &lt;/span&gt;&#xA;    &#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Neural networks are behind the phone in your pocket: face recognition, voice transcription, photo enhancement, text prediction. Self-driving cars, medical image analysis, language translation. All of it.&lt;/p&gt;</description>
      
    </item>
    
  </channel>
</rss>
