<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.16236/</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/2006.16236/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by fheinsen</title><link>https://news.ycombinator.com/item?id=46889155</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:46889155</guid><pubDate>Wed, 04 Feb 2026 17:58:12 GMT</pubDate><description>&lt;p&gt;[3] is linear attention, https://arxiv.org/abs/2006.16236, a well-known result with ~3K citations: https://scholar.google.com/scholar_lookup?arxiv_id=2006.1623...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by fheinsen</title><link>https://news.ycombinator.com/item?id=46888888</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:46888888</guid><pubDate>Wed, 04 Feb 2026 17:41:45 GMT</pubDate><description>&lt;p&gt;This is a form of linear attention (https://arxiv.org/abs/2006.16236) that approximates standard scaled dot-product attention to arbitrary precision, by adding Taylor terms in an efficient manner. Each additional Taylor term improves the approximation. Efficiency is achieved by exploiting certain mathematical symmetries that become evident only after decomposing the standard formulation of attention into an expression over chains of tensor products. The github repository&amp;#x27;s README walks through examples. The first example is with 8 Taylor terms.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=46879585</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:46879585</guid><pubDate>Wed, 04 Feb 2026 00:28:22 GMT</pubDate><description>&lt;p&gt;&amp;gt; Who out there is working on ... infinite history? Many people are still working on improving RNNs, mostly in academia. Examples off the top of my head: * RWKV: https://arxiv.org/abs/2006.16236 / https://arxiv.org/abs/2404.05892 https://arxiv.org/abs/2305.13048 * Linear attention: https://arxiv.org/abs/2503.14456 * State space models: https://arxiv.org/abs/2312.00752 / https://arxiv.org/abs/2405.21060 * Linear RNNs: https://arxiv.org/abs/2410.01201 Industry OTOH has gone all-in on Transformers.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by korbip</title><link>https://news.ycombinator.com/item?id=43055517</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236: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/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by tripplyons</title><link>https://news.ycombinator.com/item?id=43050562</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:43050562</guid><pubDate>Fri, 14 Feb 2025 17:14:22 GMT</pubDate><description>&lt;p&gt;Here is a paper explaining it: https://arxiv.org/abs/2006.16236&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by SomewhatLikely</title><link>https://news.ycombinator.com/item?id=41406936</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:41406936</guid><pubDate>Sat, 31 Aug 2024 06:31:52 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2006.16236 Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by Fripplebubby</title><link>https://news.ycombinator.com/item?id=40847504</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:40847504</guid><pubDate>Mon, 01 Jul 2024 16:38:15 GMT</pubDate><description>&lt;p&gt;To further problematize this question (which I don&amp;#x27;t feel like I can actually answer), consider this paper: &amp;quot;Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention&amp;quot; - https://arxiv.org/pdf/2006.16236 What this shows is that actually a specific narrow definition of transformer (a transformer with &amp;quot;causal masking&amp;quot; - see paper) is equivalent to an RNN, and vice versa. Similarly Mamba (https://arxiv.org/abs/2312.00752), the other hot architecture at the moment, has an equivalent unit to a gated RNN. For performance reasons, I believe they use an equivalent CNN during…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=40564717</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:40564717</guid><pubDate>Mon, 03 Jun 2024 17:06:53 GMT</pubDate><description>&lt;p&gt;TL;DR: The authors show that if you simplify Mamba so its state-space layer uses a diagonal matrix A that is a scalar times the identity matrix, the state-space transformation can be expressed as a form of causal linear attention.[a] That&amp;#x27;s the duality the authors refer to in the title. The key practical benefit is that it enables more efficient (faster) training on GPUs. --- [a] https://arxiv.org/abs/2006.16236&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=40564607</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:40564607</guid><pubDate>Mon, 03 Jun 2024 16:57:32 GMT</pubDate><description>&lt;p&gt;Dao and Gu show that if you simplify Mamba so its state-space layer uses a diagonal matrix A_t that is a scalar times the identity matrix, i.e., A_t = a_t I, the state-space transformation can be expressed as a form of causal linear attention[a] by compounding coefficients a_1 ... a_t at each time step t. The equivalence of the simplified state-space layer and causal linear attention constitute the duality the authors refer to in the title. By taking advantage of this duality, Mamba-2 can be trained more efficiently, i.e., faster than original Mamba on GPUs. Theoretical stuff aside, Mamba-2&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=38529943</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:38529943</guid><pubDate>Tue, 05 Dec 2023 12:26:56 GMT</pubDate><description>&lt;p&gt;This looks great. Thank you Gu and Dao! For those who are unaware, previous &amp;quot;state-space models&amp;quot; (SSMs) took the classic state space model from control theory[a], parameterized its matrices, and applied it in discrete time to tokens in a sequence. Many people, including me, got excited by SSMs, given their linear cost... but they failed to live up to the hype. The key difference now is that, instead of parameterizing the transformation matrices as before, the authors propose computing them from the data. In other words, instead of applying the same transformation at each step in time (which…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by MacsHeadroom</title><link>https://news.ycombinator.com/item?id=35670312</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:35670312</guid><pubDate>Sat, 22 Apr 2023 19:51:04 GMT</pubDate><description>&lt;p&gt;Transformers are turing complete: https://arxiv.org/abs/1901.03429 Additionally, Transformers are RNNs: https://arxiv.org/abs/2006.16236 Transformers are turing complete RNNs, as are the Neocortex. There are differences like spiking vs non-spiking neurons, universal vs non-universal activation, the effects of brain waves, bicameralism, etc. But these differences may or may not be important depending on the topic of discussion. Additionally, the differences increasingly disappear as transformers are increasingly augmented with functionally equivalent systems.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by GistNoesis</title><link>https://news.ycombinator.com/item?id=35668373</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:35668373</guid><pubDate>Sat, 22 Apr 2023 16:43:18 GMT</pubDate><description>&lt;p&gt;^^ See above comment and &amp;quot;Transformers are RNNs&amp;quot; paper to convince yourself. There are various ways of seeing how transformer architectures work. For the past data, using a temporal causal mask, you can compute all past features as they would have been seen by applying the causal mask, which allows you to seemingly do all the past computations in parallel, which hide the sequential aspect of it. What I&amp;#x27;ve described correspond to the the simpler subvariant figure 1 of &amp;quot;Attention is all you need&amp;quot; https://arxiv.org/pdf/2006.16236.pdf , of the transformer architecture in the case where you don&amp;#x27;t…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by GistNoesis</title><link>https://news.ycombinator.com/item?id=35666365</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:35666365</guid><pubDate>Sat, 22 Apr 2023 13:22:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; They don’t have any internal state This is a common misconception : they do have internal state. Transformers are RNNs : section 3.4 (page 5) https://arxiv.org/pdf/2006.16236.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by PartiallyTyped</title><link>https://news.ycombinator.com/item?id=34451044</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:34451044</guid><pubDate>Fri, 20 Jan 2023 10:20:23 GMT</pubDate><description>&lt;p&gt;The key component is the linear attention[1] and residual connections. [1] https://arxiv.org/abs/2006.16236 &amp;gt; Transformers achieve remarkable performance in several tasks but due to their quadratic complexity, with respect to the input&amp;#x27;s length, they are prohibitively slow for very long sequences. To address this limitation, we express the self-attention as a linear dot-product of kernel feature maps and make use of the associativity property of matrix products to reduce the complexity from (N2) to (N), where N is the sequence length. We show that this formulation permits an iterative…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by GistNoesis</title><link>https://news.ycombinator.com/item?id=34446829</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:34446829</guid><pubDate>Thu, 19 Jan 2023 22:59:01 GMT</pubDate><description>&lt;p&gt;&amp;gt;As there is no hidden state, no &amp;quot;memory&amp;quot; or &amp;quot;intention&amp;quot; can be passed to the future This is probably your misconception : &amp;quot;Transformers are RNNs&amp;quot; https://arxiv.org/pdf/2006.16236.pdf (see section 3.4) Even though an inner state is not specified explicitly like in a LSTM, for a transformer it&amp;#x27;s possible to view the inner state as implicitly defined as the inner features (deterministically derived from the layers weights) applied to the past inputs. Therefore transformers can learn to do the task by learning to remember a,b,ab to this inner state and write them in order ab,a,b (Though to train…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — mentioned by 101101001010</title><link>https://news.ycombinator.com/item?id=23723487</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.16236:23723487</guid><pubDate>Fri, 03 Jul 2020 12:45:46 GMT</pubDate><description>&lt;p&gt;They are also efficient at inference-time. On GPUs the difference is noticeable only for sequences of length &amp;gt; 1024 (2048 for reformer since it adds some operations for hashing) thanks to the massive parallelism of GPUs amortizing the quadratic effect of the &amp;quot;usual&amp;quot; self-attention mechanism. [edit] Linformer (https://arxiv.org/pdf/2006.04768.pdf) is a different project from the one linked in https://linear-transformers.com/ (Transformers are RNNs https://arxiv.org/pdf/2006.16236.pdf).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention — HN submission</title><link>https://news.ycombinator.com/item?id=23721966</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.16236:23721966</guid><pubDate>Fri, 03 Jul 2020 07:55:10 GMT</pubDate><description>&lt;p&gt;Faster Autoregressive Transformers with Linear Attention&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.16236/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
