<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>N-Gram on Jaehun's Blog</title><link>https://jaehun.me/en/tags/n-gram/</link><description>Recent content in N-Gram on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 08 Sep 2026 13:42:29 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/n-gram/index.xml" rel="self" type="application/rss+xml"/><item><title>[Paper Review] Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models</title><link>https://jaehun.me/en/posts/paper-review-conditional-memory-via-scalable-lookup-a-new-axis-of-sparsity-for-large-language-models/</link><pubDate>Wed, 14 Jan 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-review-conditional-memory-via-scalable-lookup-a-new-axis-of-sparsity-for-large-language-models/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2601.07372v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="engram-the-second-sparsity-axis-after-conditional-computation-moe-conditional-memory"&gt;Engram: The Second Sparsity Axis After Conditional Computation (MoE), Conditional Memory&lt;a href="#engram-the-second-sparsity-axis-after-conditional-computation-moe-conditional-memory" 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="one-line-summary-tldr"&gt;One-Line Summary (TL;DR)&lt;a href="#one-line-summary-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;Engram adds a &amp;ldquo;knowledge lookup primitive&amp;rdquo; to the Transformer, offloading the static-knowledge/local-pattern reconstruction burden performed by standard models in early layers to &lt;strong&gt;constant-time $O(1)$ N-gram memory lookup&lt;/strong&gt;, and simultaneously shows broad benchmark gains over MoE under iso-activated conditions — &lt;strong&gt;MMLU +3.0, BBH +5.0&lt;/strong&gt; — together with a sharp &lt;strong&gt;NIAH-MQ +12.8pt (iso-loss)&lt;/strong&gt; jump in 32k long context.&lt;/p&gt;</description></item></channel></rss>