<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Model-Architecture on Jaehun's Blog</title><link>https://jaehun.me/en/categories/model-architecture/</link><description>Recent content in Model-Architecture on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Sat, 12 Sep 2026 09:30:29 +0900</lastBuildDate><atom:link href="https://jaehun.me/en/categories/model-architecture/index.xml" rel="self" type="application/rss+xml"/><item><title>Kalman Delta Networks: Uncertainty-aware Associative Memory</title><link>https://jaehun.me/en/posts/kalman-delta-networks-uncertainty-aware-associative-memory/</link><pubDate>Sat, 12 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/kalman-delta-networks-uncertainty-aware-associative-memory/</guid><description>&lt;h2 id="linear-attention-rewritten-with-a-kalman-filter-kalman-delta-networks"&gt;Linear Attention Rewritten with a Kalman Filter: Kalman Delta Networks&lt;a href="#linear-attention-rewritten-with-a-kalman-filter-kalman-delta-networks" class="heading-anchor" aria-label="Link to this section"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;h2 id="tldr"&gt;TL;DR&lt;a href="#tldr" class="heading-anchor" aria-label="Link to this section"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The fixed-size recurrent memory update of linear attention is reinterpreted as a &lt;strong&gt;linear-Gaussian state-space model&lt;/strong&gt;, and the covariance tracking of the optimal estimator, the &lt;strong&gt;Kalman filter&lt;/strong&gt;, is introduced to decide &amp;ldquo;how strongly to overwrite&amp;rdquo; based on uncertainty, yielding &lt;strong&gt;Kalman Delta Networks (KDN)&lt;/strong&gt;. DeltaNet, Gated DeltaNet, and KDA reduce to fixed-gain special cases that omit the covariance, and KDN outperforms every SOTA linear recurrent mixer evaluated at 750M/1.3B pretraining in both PPL and average accuracy (source: Abstract, §1).&lt;/p&gt;</description></item></channel></rss>