<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sparse is Enough in Scaling Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2111.12763/</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/2111.12763/feed.xml" rel="self" type="application/rss+xml" /><item><title>Sparse is Enough in Scaling Transformers — mentioned by spi</title><link>https://news.ycombinator.com/item?id=36044780</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.12763:36044780</guid><pubDate>Tue, 23 May 2023 14:24:02 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m pretty sure in GPT3.5+ models, this concept of attention holds no longer true. In [1] the author suggests they are using &amp;quot;Intra-tensor sparsity&amp;quot; from a 2021 paper from Google [2]. Details aside, math suggests they _must_ be using some sparse attention method: the memory used by attention is O(l^2 * d) (here O notation is a bit of overkill: it&amp;#x27;s exactly that number in 8 bit quantization or twice that in 16 bit floats). With l=32k, and d probably in the order of a few k (even &amp;quot;old&amp;quot; BERT model had it at 768, it only went up since), that would be of the order of a few TB. For (a piece of) _a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.12763/"&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>Sparse is Enough in Scaling Transformers — mentioned by kir-gadjello</title><link>https://news.ycombinator.com/item?id=35825297</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.12763:35825297</guid><pubDate>Fri, 05 May 2023 04:42:00 GMT</pubDate><description>&lt;p&gt;It is quite likely GPT-4 uses one or even two sparsity approaches on top of each other (namely, coarse grained switch transformer-like and fine grained intra-tensor block sparsity), if you look at the openly available contributors&amp;#x27; research CVs. Google, in collaboration with OpenAI, has published an impressive tour de force where they have throughly developed and validated at scale a sparse transformer architecture, applied to general language modeling task: https://arxiv.org/abs/2111.12763 This happened in November of 2021, and there is a public implementation of this architecture on the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.12763/"&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>Sparse is Enough in Scaling Transformers — mentioned by kir-gadjello</title><link>https://news.ycombinator.com/item?id=35806920</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.12763:35806920</guid><pubDate>Wed, 03 May 2023 19:55:49 GMT</pubDate><description>&lt;p&gt;Impressive model, thank you for releasing it under a business-friendly license! Have you considered using Google&amp;#x27;s sparse &amp;quot;scaling transformer&amp;quot; architecture as the base? Even at 3B scale it can generate 3-4x more tokens per FLOP while being competitive at perplexity with a dense transformer. I think OpenAI uses a variant of it in their ChatGPT-3.5-Turbo product. Here is the paper https://arxiv.org/abs/2111.12763 and the implementation https://github.com/google/trax/blob/master/trax/models/resea... if you are interested. Hope you get to look into this!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.12763/"&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>Sparse is Enough in Scaling Transformers — mentioned by kir-gadjello</title><link>https://news.ycombinator.com/item?id=35608857</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.12763:35608857</guid><pubDate>Tue, 18 Apr 2023 01:25:11 GMT</pubDate><description>&lt;p&gt;Thank you for developing the pipeline and amassing considerable compute for gathering and preprocessing this dataset! I&amp;#x27;m not sure if this is the right place to ask about this, but could you consider training an LLM using a more advanced, sparse transformer architecture (specifically, &amp;quot;Terraformer&amp;quot; from this paper https://arxiv.org/abs/2111.12763 and this codebase https://github.com/google/trax/blob/master/trax/models/resea... by Google Brain and OpenAI)? I understand the pressure to focus on training a straightforward LLaMA replication, but of course you see that it&amp;#x27;s a legacy dense…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.12763/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
