<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2101.03961/</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/2101.03961/feed.xml" rel="self" type="application/rss+xml" /><item><title>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by agunapal</title><link>https://news.ycombinator.com/item?id=47973067</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:47973067</guid><pubDate>Fri, 01 May 2026 10:21:45 GMT</pubDate><description>&lt;p&gt;Here is a paper from few years ago where they talk about 7x speed increase, which equates to savings. https://arxiv.org/abs/2101.03961&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by Tiberium</title><link>https://news.ycombinator.com/item?id=38355246</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:38355246</guid><pubDate>Mon, 20 Nov 2023 21:39:55 GMT</pubDate><description>&lt;p&gt;The title should be changed to reflect that the checkpoints were released 1.5 years ago [1], and the paper was published almost 3 years ago [2]. IMO &amp;quot;releases&amp;quot; means that it was released recently, but that&amp;#x27;s not the case. [1] https://github.com/google-research/t5x/commit/199f226eeff5f8... [2] https://arxiv.org/abs/2101.03961&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by DavidSJ</title><link>https://news.ycombinator.com/item?id=37807713</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:37807713</guid><pubDate>Sun, 08 Oct 2023 03:47:13 GMT</pubDate><description>&lt;p&gt;Neither does GPT-4 or other sparse mixtures of experts, such as e.g. switch transformers [1]. [1] https://arxiv.org/abs/2101.03961&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by brandall10</title><link>https://news.ycombinator.com/item?id=36786681</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:36786681</guid><pubDate>Wed, 19 Jul 2023 14:12:33 GMT</pubDate><description>&lt;p&gt;Several people hinted/remarked (starting w/ George Hotz, then others more closely linked to OpenAI) that it&amp;#x27;s a Mixture of Experts* approach comprised of 8 220B parameter models. * https://arxiv.org/pdf/2101.03961.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by radq</title><link>https://news.ycombinator.com/item?id=36414745</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:36414745</guid><pubDate>Wed, 21 Jun 2023 05:34:11 GMT</pubDate><description>&lt;p&gt;If it&amp;#x27;s similar to the switch transformer architecture [1], which I suspect it is, then the models are all trained on the same corpus and the routing model learns automatically which experts to route to. It&amp;#x27;s orthogonal to beam search - the benefit of the architecture is that it allows sparse inference. [1] https://arxiv.org/pdf/2101.03961.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by espadrine</title><link>https://news.ycombinator.com/item?id=35165874</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:35165874</guid><pubDate>Wed, 15 Mar 2023 09:53:48 GMT</pubDate><description>&lt;p&gt;My educated guess is that they use a MoE-style model similar to the Switch transformer[0], and combine a similar encoding as that of Kosmos-1[1] (with an “image” latch token, and a ViT-style transformer to process images). As a result, the parameter count is likely bigger, but since not all of them are involved in a forward pass, it is not as meaningful. [0]: https://arxiv.org/pdf/2302.14045.pdf [1]: https://arxiv.org/pdf/2101.03961.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by jayalammar</title><link>https://news.ycombinator.com/item?id=29781293</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:29781293</guid><pubDate>Mon, 03 Jan 2022 14:50:48 GMT</pubDate><description>&lt;p&gt;The size of the database, the training set, the details of the architecture, as well as results on benchmark tasks should all be considered in the comparison. I&amp;#x27;m also a fan of Behavioral Testing [1]. Parameter count is not very accurate measure of model performance. Mixture of Expert models like the Switch Transformer [2] can be 1 trillion parameters in size, but are not 5X the performance, for example. They clock the retrieval at 10 ms, unclear if that includes the BERT inference, however. My assumption is that it does not. [1] https://arxiv.org/abs/2005.04118 [2]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by dustfinger</title><link>https://news.ycombinator.com/item?id=28834964</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:28834964</guid><pubDate>Tue, 12 Oct 2021 01:21:17 GMT</pubDate><description>&lt;p&gt;The switch transformer has already achieved a trillion parameters. https://arxiv.org/abs/2101.03961&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by criticaltinker</title><link>https://news.ycombinator.com/item?id=28217528</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:28217528</guid><pubDate>Wed, 18 Aug 2021 03:41:24 GMT</pubDate><description>&lt;p&gt;First, congratulations to you and the other authors - this is a very informative and accessible paper with impressive results. &amp;gt; On both datasets, we find that synthesis performance scales log-linearly with model size This &amp;quot;scaling law&amp;quot; observation is starting to become a major trend in NLP [1] and other other modalities such as speech recognition [2] and protein structure/function prediction [3]. Do you have any insight or commentary to offer regarding the next step in improving program synthesis? For example, will techniques to scale up model size continue to be a primary focus (eg as in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — mentioned by danielmorozoff</title><link>https://news.ycombinator.com/item?id=25835036</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.03961:25835036</guid><pubDate>Tue, 19 Jan 2021 16:24:59 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s the paper: https://arxiv.org/abs/2101.03961&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — HN submission</title><link>https://news.ycombinator.com/item?id=25822059</link><guid isPermaLink="false">urn:hackerpapers:submission:2101.03961:25822059</guid><pubDate>Mon, 18 Jan 2021 14:25:29 GMT</pubDate><description>&lt;p&gt;Google breaks the trillion-parameter ceiling with the Switch Transformer&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;48 points; 4 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — HN submission</title><link>https://news.ycombinator.com/item?id=25774747</link><guid isPermaLink="false">urn:hackerpapers:submission:2101.03961:25774747</guid><pubDate>Thu, 14 Jan 2021 10:34:57 GMT</pubDate><description>&lt;p&gt;Switch Transformers: Scaling to Trillion Parameter Models with Simple Sparsity&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/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — HN submission</title><link>https://news.ycombinator.com/item?id=25765246</link><guid isPermaLink="false">urn:hackerpapers:submission:2101.03961:25765246</guid><pubDate>Wed, 13 Jan 2021 17:30:31 GMT</pubDate><description>&lt;p&gt;Switch Transformers Scaling to Trillion Parameter Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — HN submission</title><link>https://news.ycombinator.com/item?id=25755650</link><guid isPermaLink="false">urn:hackerpapers:submission:2101.03961:25755650</guid><pubDate>Tue, 12 Jan 2021 23:39:12 GMT</pubDate><description>&lt;p&gt;Switch Transformers: Trillion Parameter Models from Googleent Sparsity&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2101.03961/"&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>Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity — HN submission</title><link>https://news.ycombinator.com/item?id=25742799</link><guid isPermaLink="false">urn:hackerpapers:submission:2101.03961:25742799</guid><pubDate>Tue, 12 Jan 2021 05:44:50 GMT</pubDate><description>&lt;p&gt;Switch Transformers: Scaling to Trillion Parameter Models with Sparsity&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/2101.03961/"&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>
