<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Towards Understanding Grokking: An Effective Theory of Representation Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.10343/</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/2205.10343/feed.xml" rel="self" type="application/rss+xml" /><item><title>Towards Understanding Grokking: An Effective Theory of Representation Learning — mentioned by Imnimo</title><link>https://news.ycombinator.com/item?id=40569514</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.10343:40569514</guid><pubDate>Tue, 04 Jun 2024 00:49:45 GMT</pubDate><description>&lt;p&gt;Grokking may not even occur for datasets of that scale. Even the MNIST experiments require dropping the training data size from 50k examples to 1k. The reason for this is that the phenomenon seems to occur at a critical zone of having just barely enough training data to make generalization possible. See https://arxiv.org/abs/2205.10343 for details. Even figuring out how to induce grokking behavior on a 100M model or OpenWebText would be a big leap in the understanding of grokking. It&amp;#x27;s perfectly reasonable for a paper like this to show results on the standard tasks for which grokking has…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.10343/"&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>Towards Understanding Grokking: An Effective Theory of Representation Learning — mentioned by versteegen</title><link>https://news.ycombinator.com/item?id=34660635</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.10343:34660635</guid><pubDate>Sun, 05 Feb 2023 01:32:33 GMT</pubDate><description>&lt;p&gt;&amp;gt; It will never learn math this way, no matter how much training you give it. Not so. Actually, (for example) the phenomenon of &amp;quot;grokking&amp;quot; is when with enough training a NN eventually experiences a phase-change from memorising data to learning the general rules underlying it [1]. Grokking isn&amp;#x27;t actually desirable, it&amp;#x27;s better that the model go more directly and quickly to learning the general rule, which is achievable in toy problems (called &amp;quot;comprehension&amp;quot; in [2]). I feel that people seem to have forgotten that deep learning is so powerful because it performs feature/representation learning…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.10343/"&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>Towards Understanding Grokking: An Effective Theory of Representation Learning — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=34319044</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.10343:34319044</guid><pubDate>Tue, 10 Jan 2023 01:22:27 GMT</pubDate><description>&lt;p&gt;Ironic, since the relatively recently discovered double descent makes it clear that bias-variance tradeoff as we know it from statistical learning theory simply doesn&amp;#x27;t apply to &amp;quot;overparameterized&amp;quot; deep models. Much of old theory is barely applicable and people are, understandably, bewildered and in denial. If someone were to be inclined to theory, I&amp;#x27;d just recommend reading papers that don&amp;#x27;t try oversimplify the domain: https://arxiv.org/abs/2006.15191 https://arxiv.org/abs/2210.10749 https://arxiv.org/abs/2205.10343 https://arxiv.org/abs/2105.04026&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.10343/"&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>Towards Understanding Grokking: An Effective Theory of Representation Learning — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=33998975</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.10343:33998975</guid><pubDate>Thu, 15 Dec 2022 13:11:56 GMT</pubDate><description>&lt;p&gt;It is common to switch to a conservative mode of thought upon entering one&amp;#x27;s domain of competence; The question is, though, if the expertise and intuition developed during, say, running XGboost classifiers at scale in AdTech really of much relevance when thinking about large transformer models trained with a self-supervised objective and RLHF? If you try to study this in depth, these models can do something the usual &amp;quot;datascience&amp;quot;-tier ones commonly cannot: https://arxiv.org/abs/2205.10343 https://moultano.wordpress.com/2020/10/18/why-deep-learning-...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.10343/"&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>
