<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Compute-Optimal Is Not Cluster-Optimal: Systems-Aware Scaling for Sparse Mixture-of-Experts · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2608.10605/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2608.10605/feed.xml" rel="self" type="application/rss+xml" /><item><title>Compute-Optimal Is Not Cluster-Optimal: Systems-Aware Scaling for Sparse Mixture-of-Experts — HN submission</title><link>https://news.ycombinator.com/item?id=49289372</link><guid isPermaLink="false">urn:hackerpapers:submission:2608.10605:49289372</guid><pubDate>Thu, 13 Aug 2026 17:40:09 GMT</pubDate><description>&lt;p&gt;Compute-optimal is not cluster-optimal&lt;/p&gt;&lt;p&gt;https://arxiv.org/pdf/2608.10605: Our new paper folds the systems stage into the scaling-law stage. Price every candidate architecture on what the cluster actually delivers, and the answer changes: the sparsity an MoE &amp;#x27;should&amp;#x27; have depends on the cluster you train it on.&lt;/p&gt;&lt;p&gt;13 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2608.10605/"&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>
