<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Investigating the Limitations of Transformers with Simple Arithmetic Tasks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2102.13019/</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/2102.13019/feed.xml" rel="self" type="application/rss+xml" /><item><title>Investigating the Limitations of Transformers with Simple Arithmetic Tasks — mentioned by spyder</title><link>https://news.ycombinator.com/item?id=35378992</link><guid isPermaLink="false">urn:hackerpapers:mention:2102.13019:35378992</guid><pubDate>Thu, 30 Mar 2023 21:24:10 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s also an interesting one, but I think I found it, but it&amp;#x27;s a little different from what I remembered because it&amp;#x27;s not just the scientific notation that helps but more so the addition of positional tokens: https://arxiv.org/abs/2102.13019 The essence of it from the abstract: &amp;quot;. In particular, the model fails to learn addition of five-digit numbers when using subwords (e.g., “32”), and it struggles to learn with character-level representations (e.g., “3 2”). By introducing position tokens (e.g., “3 10e1 2”), the model learns to accurately add and subtract numbers up to 60 digits. We…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2102.13019/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Investigating the Limitations of Transformers with Simple Arithmetic Tasks — mentioned by versteegen</title><link>https://news.ycombinator.com/item?id=34673452</link><guid isPermaLink="false">urn:hackerpapers:mention:2102.13019:34673452</guid><pubDate>Mon, 06 Feb 2023 04:46:34 GMT</pubDate><description>&lt;p&gt;I wrote that double descent is widespread, not grokking. Of course a transformer can&amp;#x27;t do multiplication or any other kind of operation on an infinite set of numbers, because it has only bounded depth which limits the number of steps it can emulate of any algorithm. But I think I see how I could build a transformer by hand that could multiply any two 4-digit numbers. The difficulty is the quadratic number of steps. Addition and subtraction are far easier, [1] shows that can be solved: &amp;quot;By introducing position tokens (e.g., &amp;quot;3 10e1 2&amp;quot;), the model learns to accurately add and subtract numbers…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2102.13019/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
