<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>2609.03235v1 on Jaehun's Blog</title><link>https://jaehun.me/en/tags/2609.03235v1/</link><description>Recent content in 2609.03235v1 on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 08 Sep 2026 01:04:59 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/2609.03235v1/index.xml" rel="self" type="application/rss+xml"/><item><title>SGD-KV: Summarization Guided KV Cache Compression</title><link>https://jaehun.me/en/posts/sgd-kv-summarization-guided-kv-cache-compression/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/sgd-kv-summarization-guided-kv-cache-compression/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.03235v1"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="sgd-kv-finding-heads-that-are-good-at-summarizing-cuts-the-1m-token-kv-cache-by-up-to-75"&gt;SGD-KV: Finding &amp;lsquo;heads that are good at summarizing&amp;rsquo; cuts the 1M-token KV cache by up to 75%&lt;a href="#sgd-kv-finding-heads-that-are-good-at-summarizing-cuts-the-1m-token-kv-cache-by-up-to-75" 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;&#10; &lt;blockquote&#10; class="border-primary bg-muted/30 hover:bg-muted/40 my-6 rounded-r-lg border-l-4 py-4 pr-4 pl-6 italic transition-all duration-200 ease-out hover:translate-x-1"&#10; &gt;&#10; &lt;div class="prose prose-sm max-w-none"&gt;&#10; &lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Attention heads do not all do the same job. &lt;strong&gt;SGD-KV&lt;/strong&gt; pinpoints the &lt;strong&gt;summarization heads&lt;/strong&gt; — the ones responsible for the high-level information compression called &amp;lsquo;summarization&amp;rsquo; — with a diagnostic task, then hands out the KV cache budget in proportion to their scores. At contexts of up to 1 million (1M) tokens it cuts KV cache memory by up to &lt;strong&gt;75%&lt;/strong&gt; while beating existing head-level compression methods.&lt;/p&gt;</description></item></channel></rss>