<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.02177/</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/2201.02177/feed.xml" rel="self" type="application/rss+xml" /><item><title>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=48393617</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:48393617</guid><pubDate>Thu, 04 Jun 2026 03:59:34 GMT</pubDate><description>&lt;p&gt;&amp;gt;There are grammar rules, they are just very weak because the structure of human language is generally quite weak. When presented with languages which have strong consistent grammars the weights are very easily interpretable as a grammar: https://arxiv.org/abs/2201.02177 That paper did not train the models on &amp;#x27;a language with strong consistent grammars&amp;#x27;. Mathematical Operation tables are not a language. Grammar itself is a post-hoc rationalization and there&amp;#x27;s no evidence LLMs follow &amp;#x27;grammar rules&amp;#x27; anymore than the brain follows grammar rules. Of Course, that&amp;#x27;s not to say transformers can&amp;#x27;t…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by noosphr</title><link>https://news.ycombinator.com/item?id=48392754</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:48392754</guid><pubDate>Thu, 04 Jun 2026 02:04:13 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s not often I see something that&amp;#x27;s fractally wrong but here we are. There is a dictionary, it&amp;#x27;s called the tokenizer. There are grammar rules, they are just very weak because the structure of human language is generally quite weak. When presented with languages which have strong consistent grammars the weights are very easily interpretable as a grammar: https://arxiv.org/abs/2201.02177 The point of the original short story is that the computational substrate doesn&amp;#x27;t matter when you have Turing completeness. This one seems to think that you don&amp;#x27;t need structure and interpretability just…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by asmodeuslucifer</title><link>https://news.ycombinator.com/item?id=47003943</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:47003943</guid><pubDate>Fri, 13 Feb 2026 15:41:02 GMT</pubDate><description>&lt;p&gt;Yes I did find that paper, I did not find which one of the 5 authors it was, or someone not listed as an author. The word &amp;#x27;vacation&amp;#x27; is not in the paper. https://arxiv.org/pdf/2201.02177.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by yorwba</title><link>https://news.ycombinator.com/item?id=47001928</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:47001928</guid><pubDate>Fri, 13 Feb 2026 12:26:25 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2201.02177 This paper is not hard to find; it&amp;#x27;s the first result when you search for &amp;quot;grokking&amp;quot; with https://scholar.google.com&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by lxgr</title><link>https://news.ycombinator.com/item?id=40527587</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:40527587</guid><pubDate>Thu, 30 May 2024 19:16:49 GMT</pubDate><description>&lt;p&gt;They seem to be unrelated, but sharing an etymology: https://arxiv.org/abs/2201.02177&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by mjburgess</title><link>https://news.ycombinator.com/item?id=40029841</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:40029841</guid><pubDate>Sun, 14 Apr 2024 09:15:24 GMT</pubDate><description>&lt;p&gt;NNs (indeed, all statistical fitting algs) have no relevant properties here: properties derive just from the structure of the dataset. Here (https://arxiv.org/abs/2201.02177) NNs are trained on a &amp;#x27;complete world&amp;#x27; problem, ie., modulo arithmetic where the whole outcome space is trivial in size and abstract with complete information. Why should NNs eventually find a representation of this tiny, abstract, full-representable outcome space after an arbitrary amount of training time? Well it will do so, eventually, if this outcome space can be fully represented by sequences of conditional…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by woopwoop</title><link>https://news.ycombinator.com/item?id=37087862</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:37087862</guid><pubDate>Fri, 11 Aug 2023 12:21:12 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t think that is true? As far as I know the grokking phenomenon was first observed (and the name coined) in this paper, not in any blog post: https://arxiv.org/abs/2201.02177&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — HN submission</title><link>https://news.ycombinator.com/item?id=36133058</link><guid isPermaLink="false">urn:hackerpapers:submission:2201.02177:36133058</guid><pubDate>Wed, 31 May 2023 00:30:07 GMT</pubDate><description>&lt;p&gt;Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;13 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=35894407</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:35894407</guid><pubDate>Wed, 10 May 2023 22:35:12 GMT</pubDate><description>&lt;p&gt;&amp;gt; once a company creates a proto AGI where the path to a functional AGI is entirely predictable with more compute, I find it hard to believe this will happen. I expect AGI training to be more like a phase transition (or a bit like grokking https://arxiv.org/pdf/2201.02177.pdf)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — HN submission</title><link>https://news.ycombinator.com/item?id=35696690</link><guid isPermaLink="false">urn:hackerpapers:submission:2201.02177:35696690</guid><pubDate>Tue, 25 Apr 2023 05:02:30 GMT</pubDate><description>&lt;p&gt;Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by whimsicalism</title><link>https://news.ycombinator.com/item?id=35517617</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:35517617</guid><pubDate>Mon, 10 Apr 2023 21:28:58 GMT</pubDate><description>&lt;p&gt;I can see that. But are we sure that a rank-based difference that doesn&amp;#x27;t manifest early in the training process won&amp;#x27;t manifest as you get further along? See also &amp;#x27;grokking&amp;#x27; [0] [0]: https://arxiv.org/abs/2201.02177&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by rhn_mk1</title><link>https://news.ycombinator.com/item?id=35314852</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:35314852</guid><pubDate>Sun, 26 Mar 2023 14:35:16 GMT</pubDate><description>&lt;p&gt;To some limited extent, they are already good at maths: https://ar5iv.labs.arxiv.org/html/2201.02177 This paper makes me believe it&amp;#x27;s less about the lack of ability to understand maths, but the power to learn more of it.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by quotemstr</title><link>https://news.ycombinator.com/item?id=34680083</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:34680083</guid><pubDate>Mon, 06 Feb 2023 16:44:34 GMT</pubDate><description>&lt;p&gt;&amp;gt; ChatGPT doesn’t “comprehend” anything. You’re anthropomorphizing it. It wouldn&amp;#x27;t be a ChatGPT HN thread without someone claiming that LLMs are stupid predictors incapable of &amp;quot;real&amp;quot; understanding. Of course ChatGPT comprehends things. It does so under any useful definition of the word &amp;quot;comprehend&amp;quot;. The &amp;quot;grokking&amp;quot; paper [1] shows that it learns fundamental principles of various algorithms and isn&amp;#x27;t just predicting text. If this isn&amp;#x27;t comprehension, humans aren&amp;#x27;t capable of comprehension. [1] https://arxiv.org/abs/2201.02177 (check out the citation list too)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by versteegen</title><link>https://news.ycombinator.com/item?id=34660635</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177: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/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — HN submission</title><link>https://news.ycombinator.com/item?id=31958624</link><guid isPermaLink="false">urn:hackerpapers:submission:2201.02177:31958624</guid><pubDate>Sat, 02 Jul 2022 12:56:57 GMT</pubDate><description>&lt;p&gt;Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by moconnor</title><link>https://news.ycombinator.com/item?id=30979935</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:30979935</guid><pubDate>Sun, 10 Apr 2022 18:14:36 GMT</pubDate><description>&lt;p&gt;This is not the consensus among ML researchers. Transformers are showing strong generalisation[1] and their performance continues to surprise us as they scale[2]. The Socratic paper is not about “higher intelligence”, it’s about demonstrating useful behaviour purely by connecting several large models via language. [1] https://arxiv.org/abs/2201.02177 [2] https://arxiv.org/abs/2204.02311&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=30299723</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:30299723</guid><pubDate>Fri, 11 Feb 2022 10:33:08 GMT</pubDate><description>&lt;p&gt;Sure: Deep Symbolic Regression for Recurrent Sequences https://arxiv.org/abs/2201.04600 (Interactive demo: http://recur-env.eba-rm3fchmn.us-east-2.elasticbeanstalk.com... ) Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets https://arxiv.org/abs/2201.02177 Both of these models can generalize to numbers it have not seen.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by plutonorm</title><link>https://news.ycombinator.com/item?id=30299705</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:30299705</guid><pubDate>Fri, 11 Feb 2022 10:31:30 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/2201.02177.pdf This paper shows fairly conclusively that the network &amp;#x27;groks&amp;#x27; modular addition.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=30299704</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.02177:30299704</guid><pubDate>Fri, 11 Feb 2022 10:31:29 GMT</pubDate><description>&lt;p&gt;Take a look at this paper: Deep Symbolic Regression for Recurrent Sequences https://arxiv.org/abs/2201.04600 If you look at embedding visualization it is very clear that the model learns order of numbers. (Interactive demo: http://recur-env.eba-rm3fchmn.us-east-2.elasticbeanstalk.com... ) There is also: Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets https://arxiv.org/abs/2201.02177 Again, looking at visualizations the model very clearly grasps the structure of the function it models.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.02177/"&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>
