
  <rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
      <title>VishalMandrai</title>
      <link>https://www.vishalm.online/blog</link>
      <description>Personal blog and web development notes created by Curtis Warcup. Also contains projects and personal interests.</description>
      <language>en-us</language>
      <managingEditor>vishalm.nitt@gmail.com (Vishal Mandrai)</managingEditor>
      <webMaster>vishalm.nitt@gmail.com (Vishal Mandrai)</webMaster>
      <lastBuildDate>Tue, 02 Jun 2026 00:00:00 GMT</lastBuildDate>
      <atom:link href="https://www.vishalm.online/feed.xml" rel="self" type="application/rss+xml"/>
      
  <item>
    <guid>https://www.vishalm.online/blog/posts/llm-inference-vs-execution</guid>
    <title>Inference Is Not Execution: Why Some Problems Defeat Every LLM</title>
    <link>https://www.vishalm.online/blog/posts/llm-inference-vs-execution</link>
    <description>At some point, no matter how capable the model is, the task becomes impossible — not because the model lacks knowledge, but because it simply cannot perform enough computation before producing its next token. This realization changed how I think about Large Language Models. Their biggest limitation may not be hallucination or missing knowledge. It may be something much more fundamental: every LLM has a fixed computational budget during inference.</description>
    <pubDate>Tue, 02 Jun 2026 00:00:00 GMT</pubDate>
    <author>vishalm.nitt@gmail.com (Vishal Mandrai)</author>
    <category>LLM</category><category>Inference</category><category>Agentic AI</category>
  </item>

  <item>
    <guid>https://www.vishalm.online/blog/posts/regularization-ml-p3</guid>
    <title>Regularization in ML | Elastic-Net | Part 3/3</title>
    <link>https://www.vishalm.online/blog/posts/regularization-ml-p3</link>
    <description>Last post of Regularization trilogy. Here we&#39;ll dive into &quot;Elastic-Net Regularization&quot;. Often called the best of both worlds. Creates flexible, robust and interpretable solution. Jump in to see how combination of L1 and L2 penalty in loss function, work togther to make possible a great model.</description>
    <pubDate>Wed, 05 Nov 2025 00:00:00 GMT</pubDate>
    <author>vishalm.nitt@gmail.com (Vishal Mandrai)</author>
    <category>ML Algorithm</category><category>Ridge</category><category>Lasso</category><category>Elastic-Net</category><category>Regularization</category>
  </item>

  <item>
    <guid>https://www.vishalm.online/blog/posts/lasso-z-l-sign-exp</guid>
    <title>Geometric Intuition of how sign(𝑤ⱼ) aligns with sign(z) in Lasso Regression</title>
    <link>https://www.vishalm.online/blog/posts/lasso-z-l-sign-exp</link>
    <description>While deriving the optimal solution for Lasso Regression via Coordinate Descent based optimization. Their comes a defining point where solution turns to Soft Thresholding Operation for calculating optimal 𝑤ⱼ, because sign(𝑤ⱼ) aligns with sign(z). This post helps with geometric intuition of how sign(𝑤ⱼ) aligns with sign(z) that enables Soft Thresholding Operation for calculating optimal 𝑤ⱼ.</description>
    <pubDate>Tue, 04 Nov 2025 00:00:00 GMT</pubDate>
    <author>vishalm.nitt@gmail.com (Vishal Mandrai)</author>
    <category>Lasso</category><category>Regularization</category><category>ML Algorithm</category><category>Ridge</category><category>Elastic-Net</category>
  </item>

  <item>
    <guid>https://www.vishalm.online/blog/posts/regularization-ml-p2</guid>
    <title>Regularization in ML | Lasso | Part 2/3</title>
    <link>https://www.vishalm.online/blog/posts/regularization-ml-p2</link>
    <description>I hope you liked Part 1 of this trilogy. Next we&#39;ll dive into &quot;Lasso Regularization&quot;. The ruthless feature selection algorithm and a great simplifier. Prevent overfitting. Automatic feature selection by vanishing the coefficients of less important features. L1-penalty is the main reason for shrinkage. But how? It cannot be solved via Gradient Descent Algorithm needs a special optimization algorithm. Jump in to see which one?</description>
    <pubDate>Mon, 03 Nov 2025 00:00:00 GMT</pubDate>
    <author>vishalm.nitt@gmail.com (Vishal Mandrai)</author>
    <category>ML Algorithm</category><category>Ridge</category><category>Lasso</category><category>Elastic-Net</category><category>Regularization</category>
  </item>

  <item>
    <guid>https://www.vishalm.online/blog/posts/regularization-ml-p1</guid>
    <title>Regularization in ML | Ridge | Part 1/3</title>
    <link>https://www.vishalm.online/blog/posts/regularization-ml-p1</link>
    <description>A technique in ML that prevents overfitting in complex ML system, by adding a penalty to the Loss Function. Helps improve a model’s generalization ability. Introduced “Penalty” discourages the model from learning overly complex patterns in data, and instead learn the most visible pattern, hence later perform well on unseen data.</description>
    <pubDate>Sun, 02 Nov 2025 00:00:00 GMT</pubDate>
    <author>vishalm.nitt@gmail.com (Vishal Mandrai)</author>
    <category>ML Algorithm</category><category>Ridge</category><category>Lasso</category><category>Elastic-Net</category><category>Regularization</category>
  </item>

    </channel>
  </rss>
