<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transformers Learn Shortcuts to Automata · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2210.10749/</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.10749/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transformers Learn Shortcuts to Automata — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=36371201</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.10749:36371201</guid><pubDate>Sat, 17 Jun 2023 15:44:53 GMT</pubDate><description>&lt;p&gt;The current generation of LLMs will never generalize on problems whose expected complexity is significantly harder than the training set. One way to think of why this is the case is because transformers are learning shortcuts to multistep reasoning tasks [1, 2], but do not learn to reason systematically and unsurprisingly fail to generalize when presented with more challenging tasks. The proper way to evaluate systematic reasoning is by training on a curriculum of problems of increasing average-case complexity. Think random k-SAT in the critical region, bisimulation games, or interpolation in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.10749/"&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>Transformers Learn Shortcuts to Automata — mentioned by fithisux</title><link>https://news.ycombinator.com/item?id=36194918</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.10749:36194918</guid><pubDate>Mon, 05 Jun 2023 11:34:24 GMT</pubDate><description>&lt;p&gt;My 2 cents https://medium.com/mlearning-ai/understanding-and-coding-the... https://arxiv.org/pdf/2210.10749.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.10749/"&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>Transformers Learn Shortcuts to Automata — HN submission</title><link>https://news.ycombinator.com/item?id=35709710</link><guid isPermaLink="false">urn:hackerpapers:submission:2210.10749:35709710</guid><pubDate>Wed, 26 Apr 2023 04:42:24 GMT</pubDate><description>&lt;p&gt;Transformers Learn Shortcuts to Automata&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;37 points; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2210.10749/"&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>Transformers Learn Shortcuts to Automata — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=34319044</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.10749: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/2210.10749/"&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>
