<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Sparse Autoencoders on Programmer.ie: Modern AI programming</title>
    <link>http://programmer.ie/tags/sparse-autoencoders/</link>
    <description>Recent content in Sparse Autoencoders on Programmer.ie: Modern AI programming</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 08 Aug 2026 15:00:00 +0100</lastBuildDate>
    <atom:link href="http://programmer.ie/tags/sparse-autoencoders/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Models From First Principles 06: Inside Tiny — Residual Blocks, Attention and Sparse Autoencoders</title>
      <link>http://programmer.ie/post/models-from-first-principles-06/</link>
      <pubDate>Sat, 08 Aug 2026 15:00:00 +0100</pubDate>
      <guid>http://programmer.ie/post/models-from-first-principles-06/</guid>
      <description>&lt;h1 id=&#34;inside-tiny-residual-blocks-attention-and-sparse-autoencoders&#34;&gt;Inside Tiny: Residual Blocks, Attention and Sparse Autoencoders&lt;/h1&gt;&#xA;&lt;p&gt;In the previous post, we built a compact recursive model around one idea:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-text&#34; data-lang=&#34;text&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;context + candidate + latent state&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;              ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;          projection&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;              ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;         reusable core&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;              ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;       proposed update&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;              ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;      z ← z + α · update&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;              ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;            repeat&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;That architecture looked more sophisticated than MR.Q, EBT or SICQL because it introduced recurrence.&lt;/p&gt;&#xA;&lt;p&gt;But the central idea of this series is that a model stops looking mysterious when we keep opening it.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Models From First Principles 05: Tiny — Recursive Reasoning With a Small Neural Network</title>
      <link>http://programmer.ie/post/models-from-first-principles-05/</link>
      <pubDate>Sat, 08 Aug 2026 14:55:00 +0100</pubDate>
      <guid>http://programmer.ie/post/models-from-first-principles-05/</guid>
      <description>&lt;h1 id=&#34;tiny--recursive-reasoning-with-a-small-neural-network&#34;&gt;Tiny — Recursive Reasoning With a Small Neural Network&lt;/h1&gt;&#xA;&lt;p&gt;The previous post introduced a much more ambitious architecture.&lt;/p&gt;&#xA;&lt;p&gt;Instead of taking one representation and predicting from it once, the &lt;strong&gt;Hierarchical Reasoning Model&lt;/strong&gt; repeatedly updated two latent states:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-text&#34; data-lang=&#34;text&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;input&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;low-level state&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓ ↓ ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;high-level state&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;  ↓&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;repeat&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;That gave us something genuinely new:&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;computation could continue without adding a new set of parameters for every step.&lt;/strong&gt;&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
