<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficiently Scaling Transformer Inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2211.05102/</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/2211.05102/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficiently Scaling Transformer Inference — mentioned by deepnotderp</title><link>https://news.ycombinator.com/item?id=39503007</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.05102:39503007</guid><pubDate>Sun, 25 Feb 2024 17:55:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; GPUs Groq will still come out on top because you can never reduce latency by adding more parallel compute :) You literally can, in fact that’s the entire reason to use multiple chips. See eg the TPU group’s paper: https://arxiv.org/abs/2211.05102&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.05102/"&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>Efficiently Scaling Transformer Inference — mentioned by yvn1uo</title><link>https://news.ycombinator.com/item?id=36702363</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.05102:36702363</guid><pubDate>Wed, 12 Jul 2023 22:11:19 GMT</pubDate><description>&lt;p&gt;One possible explanation is that they hit the teraflops number during the prefill stage, where you can process all tokens at once, and are generally more operationally intensive, so you can use more compute. Utilization usually drops during the token generation stage. The utilization of the TPU during token generation is 3% when batch size 16. (https://arxiv.org/pdf/2211.05102.pdf, Table on the last page).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.05102/"&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>Efficiently Scaling Transformer Inference — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=36451298</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.05102:36451298</guid><pubDate>Fri, 23 Jun 2023 19:38:58 GMT</pubDate><description>&lt;p&gt;&amp;gt; Though inference for the 8B model is almost definitely not capable of near real time inference yet Google previously showed you could get the fullsized 540b-parameter PaLM-1 model down to &amp;quot;a low-batch-size latency of 29ms per token during generation (with int8 weight quantization)&amp;quot; https://arxiv.org/abs/2211.05102#google . How many tokens per 1000ms do humans speak? I&amp;#x27;m guessing fewer than 34. The real question is who wants to pay for it.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.05102/"&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>
