<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>llm-sys</title><link>https://llmsys.net/</link><description>Recent content on llm-sys</description><generator>Hugo</generator><language>en</language><copyright>llm-sys</copyright><lastBuildDate>Tue, 20 Oct 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://llmsys.net/index.xml" rel="self" type="application/rss+xml"/><item><title>DoSA: Dots Sparse Attention</title><link>https://llmsys.net/blog/dosa/</link><pubDate>Tue, 20 Oct 2026 00:00:00 +0800</pubDate><guid>https://llmsys.net/blog/dosa/</guid><description>&lt;p&gt;Mixture-of-experts models made feed-forward layers conditional: each token pays for a few experts, not all of them. Sparse attention promises the same for attention, since each query reads only a small set of keys. In practice the promise stops short. DeepSeek Sparse Attention (DSA) picks those keys with a multi-head &lt;em&gt;indexer&lt;/em&gt;, and the indexer scores &lt;strong&gt;every&lt;/strong&gt; visible key with &lt;strong&gt;every&lt;/strong&gt; indexer head before taking the Top-&lt;span class="katex"&gt;&lt;span class="katex-mathml"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;mi&gt;K&lt;/mi&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;K&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt;&lt;span class="katex-html" aria-hidden="true"&gt;&lt;span class="katex-base"&gt;&lt;span class="katex-strut" style="height:0.6833em;"&gt;&lt;/span&gt;&lt;span class="mord mathnormal" style="margin-right:0.0715em;"&gt;K&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;. The attention is sparse; the selection is dense.&lt;/p&gt;</description></item><item><title>About</title><link>https://llmsys.net/about/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://llmsys.net/about/</guid><description>&lt;p&gt;llm-sys studies how large language model architectures evolve and how to make them efficient: attention and sparsity, model structure, and the kernels and serving stacks that run them. We publish papers with code and write up the ideas here.&lt;/p&gt;</description></item></channel></rss>