<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Overcoming the Communication-Performance Tradeoff in LLM Pretraining · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2508.15706/</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/2508.15706/feed.xml" rel="self" type="application/rss+xml" /><item><title>Overcoming the Communication-Performance Tradeoff in LLM Pretraining — mentioned by synapz_org</title><link>https://news.ycombinator.com/item?id=45095764</link><guid isPermaLink="false">urn:hackerpapers:mention:2508.15706:45095764</guid><pubDate>Mon, 01 Sep 2025 19:22:12 GMT</pubDate><description>&lt;p&gt;Paper: https://arxiv.org/abs/2508.15706 Code: https://github.com/tplr-ai/SparseLoCo Templar AI has developed SparseLoCo, a distributed training algorithm that achieves extreme compression ratios (1-3% sparsity + 2-bit quantization) while outperforming existing methods like DiLoCo and DeMo on both loss and communication efficiency. The Core Problem Training LLMs across data centers or over the internet is bottlenecked by communication: as model scale grows, each synchronization can require transferring hundreds of gigabytes of pseudo-gradients. DiLoCo reduces the frequency of synchronizations…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2508.15706/"&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>Overcoming the Communication-Performance Tradeoff in LLM Pretraining — HN submission</title><link>https://news.ycombinator.com/item?id=45095763</link><guid isPermaLink="false">urn:hackerpapers:submission:2508.15706:45095763</guid><pubDate>Mon, 01 Sep 2025 19:22:12 GMT</pubDate><description>&lt;p&gt;SparseLoCo: Communication-Efficient LLM Training&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;19 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2508.15706/"&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>
