<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Simple linear attention language models balance the recall-throughput tradeoff · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.18668/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2402.18668/feed.xml" rel="self" type="application/rss+xml" /><item><title>Simple linear attention language models balance the recall-throughput tradeoff — mentioned by korbip</title><link>https://news.ycombinator.com/item?id=43055517</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.18668:43055517</guid><pubDate>Sat, 15 Feb 2025 03:04:16 GMT</pubDate><description>&lt;p&gt;There is a LOT of effort in the research community currently: 1. Improving the Self-Attention in the Transformer as is, keeping the quadratic complexity, which has some theoretical advantage in principle[1]: The most hyped one probably DeepSeek&amp;#x27;s Multi-Latent Attention[15], which kind of is Attention still - but also somehow different. 2. Linear RNNs: This starts from Linear Attention[2], DeltaNet[3], RKWV[4], Retention[5], Gated Linear Attention[6], Mamba[7], Griffin[8], Based[9], xLSTM[10], TTT[11], Gated DeltaNet[12], Titans[13]. They all have an update like: C_{t} = F_{t} C_{t-1} + i_{t}…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.18668/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Simple linear attention language models balance the recall-throughput tradeoff — mentioned by f_devd</title><link>https://news.ycombinator.com/item?id=41736688</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.18668:41736688</guid><pubDate>Fri, 04 Oct 2024 00:49:41 GMT</pubDate><description>&lt;p&gt;Transformers actually have an quantifiable state size (see https://hazyresearch.stanford.edu/static/posts/2024-06-22-ac...) although it&amp;#x27;s anywhere between 200k and 2M floats (for 360M and 1.33B respectively iinm). So a sufficiently sized RNN could have the same state capacity as a transformer. (this is from the Based paper: https://arxiv.org/pdf/2402.18668)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.18668/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
