<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Beyond neural scaling laws: beating power law scaling via data pruning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2206.14486/</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/2206.14486/feed.xml" rel="self" type="application/rss+xml" /><item><title>Beyond neural scaling laws: beating power law scaling via data pruning — mentioned by waldarbeiter</title><link>https://news.ycombinator.com/item?id=47206261</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.14486:47206261</guid><pubDate>Sun, 01 Mar 2026 12:51:54 GMT</pubDate><description>&lt;p&gt;There is actually a whole lot of research around the &amp;quot;use less data&amp;quot; called data pruning. The goal in a lot of cases there is basically to achieve the same performance with less data. For example [1] received quite some attention in the past. [1] https://arxiv.org/abs/2206.14486&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.14486/"&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>Beyond neural scaling laws: beating power law scaling via data pruning — mentioned by peaslock</title><link>https://news.ycombinator.com/item?id=34049152</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.14486:34049152</guid><pubDate>Mon, 19 Dec 2022 06:26:36 GMT</pubDate><description>&lt;p&gt;Not necessarily: https://arxiv.org/abs/2206.14486 Also, even with &amp;quot;Chinchilla laws&amp;quot;, you still gain performance in a larger model, you just need a lot more data (if just as noisy) to reach the same level of convergence, but a larger model will have already partially converged to a superior model with the same amount data.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.14486/"&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>Beyond neural scaling laws: beating power law scaling via data pruning — HN submission</title><link>https://news.ycombinator.com/item?id=32517249</link><guid isPermaLink="false">urn:hackerpapers:submission:2206.14486:32517249</guid><pubDate>Fri, 19 Aug 2022 03:08:12 GMT</pubDate><description>&lt;p&gt;Beyond neural scaling laws: beating power law scaling via data pruning&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/2206.14486/"&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>Beyond neural scaling laws: beating power law scaling via data pruning — mentioned by cmorez</title><link>https://news.ycombinator.com/item?id=32203159</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.14486:32203159</guid><pubDate>Sat, 23 Jul 2022 13:28:33 GMT</pubDate><description>&lt;p&gt;This has the same flavor as the initial criticisms of AlphaGo. &amp;quot;It will never be able to play anything other than Go&amp;quot;, cue AlphaZero. &amp;quot;It will never be able to do so without being told the rules&amp;quot;, cue MuZero. &amp;quot;It will never be able to do so without obscene amounts of data&amp;quot;, cue EfficientZero. --- It has to be spoonfed because 1) It literally cannot see individual digits. (BPEs) 2) It has to infer context (mystery novel, comment section, textbook) 3) It has a fixed compute-budget per output. (96 layers per token, from quantum physics to translation). To make Language Models useful one must…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.14486/"&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>Beyond neural scaling laws: beating power law scaling via data pruning — HN submission</title><link>https://news.ycombinator.com/item?id=31960979</link><guid isPermaLink="false">urn:hackerpapers:submission:2206.14486:31960979</guid><pubDate>Sat, 02 Jul 2022 17:52:12 GMT</pubDate><description>&lt;p&gt;Beyond neural scaling laws: beating power law scaling via data pruning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2206.14486/"&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>
