<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Linformer: Self-Attention with Linear Complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.04768/</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.04768/feed.xml" rel="self" type="application/rss+xml" /><item><title>Linformer: Self-Attention with Linear Complexity — mentioned by ctoth</title><link>https://news.ycombinator.com/item?id=24246738</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04768:24246738</guid><pubDate>Sat, 22 Aug 2020 19:46:12 GMT</pubDate><description>&lt;p&gt;I keep wanting to write a long explanation of just why this is so... silly? to read? But Gwern has already done the hard work. [0] The only other bit I&amp;#x27;d like to mention is that GPT-3 uses exactly none of the new techniques that have been coming out in the last two years that would have significant impact on text generation. From working methods to apply GANs to text, to far more efficient transformer models that can handle longer sequences. For instance [1] [2] [3] for better direction, or [4] [5] [6] for efficiency. Or perhaps the outside view might help. After seeing GPT-2 last year, did…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04768/"&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>Linformer: Self-Attention with Linear Complexity — mentioned by 101101001010</title><link>https://news.ycombinator.com/item?id=23723487</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04768: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.04768/"&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>Linformer: Self-Attention with Linear Complexity — HN submission</title><link>https://news.ycombinator.com/item?id=23481635</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.04768:23481635</guid><pubDate>Wed, 10 Jun 2020 20:23:39 GMT</pubDate><description>&lt;p&gt;Linformer: Self-Attention with Linear Complexity&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.04768/"&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>
