<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Solvable Model of Neural Scaling Laws · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2210.16859/</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/2210.16859/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Solvable Model of Neural Scaling Laws — mentioned by hodgehog11</title><link>https://news.ycombinator.com/item?id=46999857</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.16859:46999857</guid><pubDate>Fri, 13 Feb 2026 07:16:12 GMT</pubDate><description>&lt;p&gt;Fine, that&amp;#x27;s fair. I believe the statement that you made is countered by my claim, which is: Theorem. For any tolerance epsilon &amp;gt; 0, there exists a transformer neural network of sufficient size that follows, up to the factor epsilon, the policy that most optimally achieves arbitrary goals in arbitrary stochastic environments. Proof (sketch). For any stochastic environment with a given goal, there exists a model that maximizes expected return under this goal (not necessarily unique, but it exists). From Solomonoff&amp;#x27;s convergence theorem (Theorem 3.19 in [1]), Bayes-optimal predictors under the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.16859/"&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>
