<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Petals: Collaborative Inference and Fine-tuning of Large Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2209.01188/</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/2209.01188/feed.xml" rel="self" type="application/rss+xml" /><item><title>Petals: Collaborative Inference and Fine-tuning of Large Models — HN submission</title><link>https://news.ycombinator.com/item?id=48969101</link><guid isPermaLink="false">urn:hackerpapers:submission:2209.01188:48969101</guid><pubDate>Sun, 19 Jul 2026 15:37:21 GMT</pubDate><description>&lt;p&gt;Petals: Collaborative Inference and Fine-Tuning of Large Models&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/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by ftxbro</title><link>https://news.ycombinator.com/item?id=35240361</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:35240361</guid><pubDate>Mon, 20 Mar 2023 23:28:44 GMT</pubDate><description>&lt;p&gt;This link just goes to their website. Last I looked at this project, I was happy that it existed but I was disappointed (given my over-optimistic expectations) for two reasons: 1) It&amp;#x27;s for the BLOOM model which isn&amp;#x27;t great compared to somewhat recent gpts. Like I think I read that it&amp;#x27;s worse than the openai models on a per parameter basis. 2) It&amp;#x27;s faster than using RAM/SSD as faux VRAM but &amp;#x27;only&amp;#x27; by 10x. That was even before LLaMA or its improvements had existed for running locally. So by my old understanding, bloom/petals wouldn&amp;#x27;t be even as good as those ones even though it technically has…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — HN submission</title><link>https://news.ycombinator.com/item?id=35194358</link><guid isPermaLink="false">urn:hackerpapers:submission:2209.01188:35194358</guid><pubDate>Fri, 17 Mar 2023 07:40:54 GMT</pubDate><description>&lt;p&gt;Petals: Collaborative Inference and Fine-Tuning of Large Models&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/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by zavrel</title><link>https://news.ycombinator.com/item?id=35038644</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:35038644</guid><pubDate>Mon, 06 Mar 2023 08:16:26 GMT</pubDate><description>&lt;p&gt;There was great work last year on distributed training and inference: Petals: Collaborative Inference and Fine-tuning of Large Models Alexander Borzunov, Dmitry Baranchuk, Tim Dettmers, Max Ryabinin, Younes Belkada, Artem Chumachenko, Pavel Samygin, Colin Raffel https://arxiv.org/abs/2209.01188 Would be wonderful to use this host this model LLaMA: Open and Efficient Foundation Language Models https://arxiv.org/abs/2302.13971&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by borzunov</title><link>https://news.ycombinator.com/item?id=34874976</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:34874976</guid><pubDate>Tue, 21 Feb 2023 00:46:50 GMT</pubDate><description>&lt;p&gt;Note that the authors report the speed of generating many sequences in parallel (per token): &amp;gt; The batch size is tuned to a value that maximizes the generation throughput for each system. &amp;gt; FlexGen cannot achieve its best throughput in [...] single-batch case. For 175B models, this likely means that the system takes a few seconds for each generation step, but you can generate multiple sequences in parallel and get a good performance _per token_. However, what you actually need for ChatGPT and interactive LM apps is to generate _one_ sequence reasonably quickly (so it takes &amp;lt;= 1 sec/token to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by joaogui1</title><link>https://news.ycombinator.com/item?id=34393422</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:34393422</guid><pubDate>Sun, 15 Jan 2023 21:08:39 GMT</pubDate><description>&lt;p&gt;This initiative is getting some pretty good practical results https://arxiv.org/abs/2209.01188, taking a look at their citations should lead you to other examples in the field&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by borzunov</title><link>https://news.ycombinator.com/item?id=34222309</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:34222309</guid><pubDate>Mon, 02 Jan 2023 19:15:26 GMT</pubDate><description>&lt;p&gt;Theoretical best-case for RAM offloading is 5.5 sec/token, for SSD offloading - 22 sec/token. Implementations we&amp;#x27;ve tested are not faster than 10 sec/token though. See details in our paper: https://arxiv.org/pdf/2209.01188.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by taink</title><link>https://news.ycombinator.com/item?id=34216209</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:34216209</guid><pubDate>Mon, 02 Jan 2023 10:00:50 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s mentioned in their paper: https://arxiv.org/pdf/2209.01188.pdf Several recent works aim to democratize LLMs by “offloading” model parameters to slower but cheaper memory (RAM or SSD), then running them on the accelerator layer by layer (Pudipeddi et al., 2020; Ren et al., 2021). This method allows running LLMs with a single low-end accelerator by loading parameters from RAM justin-time for each forward pass. Offloading can be efficient for processing many tokens in parallel, but it has inher- ently high latency: for example, generating one to- ken with BLOOM-176B takes at least 5.5…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>Petals: Collaborative Inference and Fine-tuning of Large Models — mentioned by borzunov</title><link>https://news.ycombinator.com/item?id=34071464</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.01188:34071464</guid><pubDate>Tue, 20 Dec 2022 19:50:32 GMT</pubDate><description>&lt;p&gt;See technical details in the paper: https://arxiv.org/abs/2209.01188&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.01188/"&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>
