<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>What Algorithms can Transformers Learn? A Study in Length Generalization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2310.16028/</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/2310.16028/feed.xml" rel="self" type="application/rss+xml" /><item><title>What Algorithms can Transformers Learn? A Study in Length Generalization — mentioned by Vetch</title><link>https://news.ycombinator.com/item?id=42417567</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.16028:42417567</guid><pubDate>Sat, 14 Dec 2024 15:09:48 GMT</pubDate><description>&lt;p&gt;!Long post warning! Tokenization is often scapegoated for many transformer limitations. I suppose it&amp;#x27;s because reading about the many limitations of the transformer architecture is harder than dumping everything on tokenization (which to be fair, is often indirectly involved with or exacerbating some deeper issue). &amp;gt; Why can&amp;#x27;t LLM spell words? Tokenization. LLMs can spell if you ask them to though. And there have been investigations into this capability (ref:2). Tokenization makes computations that involve spelling more difficult, but this is downstream of deeper computational limitations of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.16028/"&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>What Algorithms can Transformers Learn? A Study in Length Generalization — mentioned by hansonw</title><link>https://news.ycombinator.com/item?id=40181032</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.16028:40181032</guid><pubDate>Sat, 27 Apr 2024 16:09:21 GMT</pubDate><description>&lt;p&gt;This is also a good paper on the subject: What Algorithms can Transformers Learn? A Study in Length Generalization https://arxiv.org/abs/2310.16028&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.16028/"&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>What Algorithms can Transformers Learn? A Study in Length Generalization — mentioned by astrange</title><link>https://news.ycombinator.com/item?id=39497840</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.16028:39497840</guid><pubDate>Sun, 25 Feb 2024 05:09:52 GMT</pubDate><description>&lt;p&gt;We can prove that transformers can do computation beyond memorization, and that they can learn it from examples, unless you think learning an algorithm is memorization. https://arxiv.org/abs/2301.05217 https://arxiv.org/abs/2310.16028&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.16028/"&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>What Algorithms can Transformers Learn? A Study in Length Generalization — HN submission</title><link>https://news.ycombinator.com/item?id=39310848</link><guid isPermaLink="false">urn:hackerpapers:submission:2310.16028:39310848</guid><pubDate>Fri, 09 Feb 2024 02:55:05 GMT</pubDate><description>&lt;p&gt;What Algorithms Can Transformers Learn? A Study in Length Generalization&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/2310.16028/"&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>
