<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Big Bird: Transformers for Longer Sequences · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2007.14062/</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/2007.14062/feed.xml" rel="self" type="application/rss+xml" /><item><title>Big Bird: Transformers for Longer Sequences — HN submission</title><link>https://news.ycombinator.com/item?id=40801466</link><guid isPermaLink="false">urn:hackerpapers:submission:2007.14062:40801466</guid><pubDate>Wed, 26 Jun 2024 15:59:09 GMT</pubDate><description>&lt;p&gt;Ask HN: Complexity Theory for SSMs&lt;/p&gt;&lt;p&gt;Hi HN! TLDR: How important are complexity-based arguments for limitations of SSMs in the real world? With all the discussion right now on Mamba vs transformers, I am reminded of the Big Bird paper from late 2020 (https://arxiv.org/pdf/2007.14062). Big Bird introduces a nice sparse attention implementation, and goes on to provide a strong example of its limitations. Specifically, it leverages the Orthogonal Vector Conjecture to show there are tasks a full transformer can do in a single layer that a sparse transformer cannot solve with a fixed number of layers. I think a lot of the critiques of…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2007.14062/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Big Bird: Transformers for Longer Sequences — mentioned by NaiveBayesian</title><link>https://news.ycombinator.com/item?id=37423279</link><guid isPermaLink="false">urn:hackerpapers:mention:2007.14062:37423279</guid><pubDate>Thu, 07 Sep 2023 18:18:10 GMT</pubDate><description>&lt;p&gt;There was actually a series of language models named after Sesame Street characters back in 2018-2020, starting with ELMo, then BERT, ERNIE (a different model from 2019), Big Bird, ... There are likely some more that I missed. ELMo: https://arxiv.org/abs/1802.05365 BERT: https://arxiv.org/abs/1810.04805 ERNIE: https://arxiv.org/abs/1904.09223v1 Big Bird: https://arxiv.org/abs/2007.14062&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2007.14062/"&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>Big Bird: Transformers for Longer Sequences — mentioned by ctoth</title><link>https://news.ycombinator.com/item?id=24246738</link><guid isPermaLink="false">urn:hackerpapers:mention:2007.14062: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/2007.14062/"&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>Big Bird: Transformers for Longer Sequences — HN submission</title><link>https://news.ycombinator.com/item?id=24049158</link><guid isPermaLink="false">urn:hackerpapers:submission:2007.14062:24049158</guid><pubDate>Tue, 04 Aug 2020 12:13:31 GMT</pubDate><description>&lt;p&gt;Big Bird: Transformers for Longer Sequences&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/2007.14062/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Big Bird: Transformers for Longer Sequences — HN submission</title><link>https://news.ycombinator.com/item?id=24042731</link><guid isPermaLink="false">urn:hackerpapers:submission:2007.14062:24042731</guid><pubDate>Mon, 03 Aug 2020 20:09:45 GMT</pubDate><description>&lt;p&gt;Big Bird: Transformers for Longer Sequences&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2007.14062/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Big Bird: Transformers for Longer Sequences — HN submission</title><link>https://news.ycombinator.com/item?id=23986717</link><guid isPermaLink="false">urn:hackerpapers:submission:2007.14062:23986717</guid><pubDate>Wed, 29 Jul 2020 13:58:48 GMT</pubDate><description>&lt;p&gt;Big Bird: Transformers for Longer Sequences&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/2007.14062/"&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>
