<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>2609.04971v1 on Jaehun's Blog</title><link>https://jaehun.me/tags/2609.04971v1/</link><description>Recent content in 2609.04971v1 on Jaehun's Blog</description><generator>Hugo</generator><language>ko-kr</language><lastBuildDate>Mon, 07 Sep 2026 14:31:22 +0000</lastBuildDate><atom:link href="https://jaehun.me/tags/2609.04971v1/index.xml" rel="self" type="application/rss+xml"/><item><title>BeaconKV: Key-Value Cache Compression Guided by Beacon Queries for Efficient Large Reasoning Model Inference</title><link>https://jaehun.me/posts/beaconkv-key-value-cache-compression-guided-by-beacon-queries-for-efficient-large-reasoning-model-inference/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/beaconkv-key-value-cache-compression-guided-by-beacon-queries-for-efficient-large-reasoning-model-inference/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.04971v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&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="모델이-생각을-다시-꺼내-보는-순간을-잡아라-beaconkv가-비콘-쿼리로-추론-kv-캐시를-58배-압축하는-법"&gt;모델이 &amp;lsquo;생각을 다시 꺼내 보는&amp;rsquo; 순간을 잡아라: BeaconKV가 비콘 쿼리로 추론 KV 캐시를 5.8배 압축하는 법&lt;a href="#%eb%aa%a8%eb%8d%b8%ec%9d%b4-%ec%83%9d%ea%b0%81%ec%9d%84-%eb%8b%a4%ec%8b%9c-%ea%ba%bc%eb%82%b4-%eb%b3%b4%eb%8a%94-%ec%88%9c%ea%b0%84%ec%9d%84-%ec%9e%a1%ec%95%84%eb%9d%bc-beaconkv%ea%b0%80-%eb%b9%84%ec%bd%98-%ec%bf%bc%eb%a6%ac%eb%a1%9c-%ec%b6%94%eb%a1%a0-kv-%ec%ba%90%ec%8b%9c%eb%a5%bc-58%eb%b0%b0-%ec%95%95%ec%b6%95%ed%95%98%eb%8a%94-%eb%b2%95" class="heading-anchor" aria-label="이 섹션에 대한 링크"&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; — Large Reasoning Model(LRM)은 긴 Chain-of-Thought(CoT)를 생성할수록 KV 캐시가 선형으로 불어나, Qwen3-4B가 32K 토큰을 배치 크기 16으로 생성하면 KV 캐시만 &lt;strong&gt;77 GB&lt;/strong&gt; 를 넘어 80 GB GPU 한계에 닿는다 (근거: §1). 기존 압축 기법들은 &lt;strong&gt;최근 쿼리(recent queries)&lt;/strong&gt; 로 미래의 중요 토큰을 예측하는데, 추론 중에는 모델이 &lt;strong&gt;멀리 떨어진 과거 맥락(문제 정의·풀이 계획)을 다시 읽는 Thought Revisiting Token(TRT)&lt;/strong&gt; 이라는 현상 때문에 이 가정이 무너진다 (근거: §3). BeaconKV는 TRT를 유발하는 &lt;strong&gt;전역 쿼리(global query)&lt;/strong&gt; 가 임베딩 공간에서 소수의 군집을 이룬다는 기하학적 통찰을 바탕으로, 각 군집을 대표하는 &lt;strong&gt;비콘 쿼리(beacon query)&lt;/strong&gt; 를 Continual FPS로 온라인 선정해 KV 캐시를 압축한다. 그 결과 &lt;strong&gt;최대 5.8× 메모리 절감(77.0 → 13.3 GB)&lt;/strong&gt;, &lt;strong&gt;4.3× 처리량 향상(82.3 → 356.4 tokens/s)&lt;/strong&gt; 을 달성하면서, RPC·R-KV 대비 최대 &lt;strong&gt;31.7 pp&lt;/strong&gt; 의 정확도 향상을 얻는다 (근거: §5.4, Fig. 8).&lt;/p&gt;</description></item></channel></rss>