<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Memory Efficiency on Jaehun's Blog</title><link>https://jaehun.me/en/tags/memory-efficiency/</link><description>Recent content in Memory Efficiency on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 08 Sep 2026 03:26:23 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/tags/memory-efficiency/index.xml" rel="self" type="application/rss+xml"/><item><title>Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention</title><link>https://jaehun.me/en/posts/native-sparse-attention-hardware-aligned-and-natively-trainable-sparse-attention/</link><pubDate>Mon, 07 Jul 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/native-sparse-attention-hardware-aligned-and-natively-trainable-sparse-attention/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2502.11089v2"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="native-sparse-attention-nsa--11-faster-even-at-64k-tokens-accuracy-intact"&gt;Native Sparse Attention (NSA) — 11× faster even at 64k tokens, accuracy intact&lt;a href="#native-sparse-attention-nsa--11-faster-even-at-64k-tokens-accuracy-intact" 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;&lt;strong&gt;NSA combines a three-branch sparse attention — “compress → select → slide” — with a GQA/MQA-friendly kernel to make decoding 11.6× faster and training up to 9× faster at 64k context, while improving average performance over Full Attention.&lt;/strong&gt;&lt;/p&gt;</description></item></channel></rss>