<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2307.02628/</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/2307.02628/feed.xml" rel="self" type="application/rss+xml" /><item><title>SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference — mentioned by airgapstopgap</title><link>https://news.ycombinator.com/item?id=36781875</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.02628:36781875</guid><pubDate>Wed, 19 Jul 2023 03:40:40 GMT</pubDate><description>&lt;p&gt;Not really. They have a way of squaring this circle, by changing their inference code. Speculative sampling [1] would still make their first claim a lie – sure, there&amp;#x27;d still be the original GPT-4 model, plus a smaller draft worker. But early exit decoding [2] allows you to get almost as good results for much cheaper from exactly the same checkpoint. We know that this line of research for large-scale inference is going strong [3] so it stands to reason that OpenAI, with their wealth of talent focused on GPT-4 throughput&amp;amp;inference [4], large contexts and aggressive pricing policy, would also…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.02628/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
