<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Faith and Fate: Limits of Transformers on Compositionality · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.18654/</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/2305.18654/feed.xml" rel="self" type="application/rss+xml" /><item><title>Faith and Fate: Limits of Transformers on Compositionality — mentioned by travelalberta</title><link>https://news.ycombinator.com/item?id=45643455</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:45643455</guid><pubDate>Mon, 20 Oct 2025 13:07:05 GMT</pubDate><description>&lt;p&gt;&amp;gt; LLMs can&amp;#x27;t do math. Ignoring conversations about &amp;#x27;reasoning&amp;#x27;, at a fundamental level LLMs do not &amp;#x27;do math&amp;#x27; in the way that a calculator or a human does math. Sure we can train bigger and bigger models that give you the impression of this but there are proofs out there that with increased task complexity (in this case multi-digit multiplication) eventually the probability of incorrect predictions converges to 1 (https://arxiv.org/abs/2305.18654) &amp;gt; And your 2nd and third point about planning and compounding errors remain challenges.. probably unsolvable with LLM approaches. The same issue…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=44282477</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:44282477</guid><pubDate>Sun, 15 Jun 2025 14:32:23 GMT</pubDate><description>&lt;p&gt;Your entire edit essentially walks back your earlier strong claims. None of your current points actually support your position. 1. No, it doesn&amp;#x27;t. That&amp;#x27;s a ridiculous claim. Are you seriously suggesting that statistics require reasoning? 2. If you map that language to tokens, it&amp;#x27;s obvious the model will follow that mapping. etc. Here are papers showing that these models can&amp;#x27;t reason: https://arxiv.org/abs/2311.00871 https://arxiv.org/abs/2309.13638 https://arxiv.org/abs/2311.09247 https://arxiv.org/abs/2305.18654 https://arxiv.org/abs/2309.01809 You&amp;#x27;re mistaking pattern matching and the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — HN submission</title><link>https://news.ycombinator.com/item?id=43590792</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.18654:43590792</guid><pubDate>Sat, 05 Apr 2025 04:38:58 GMT</pubDate><description>&lt;p&gt;Faith and Fate: Limits of Transformers on Compositionality&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Faith and Fate: Limits of Transformers on Compositionality — mentioned by janalsncm</title><link>https://news.ycombinator.com/item?id=42907743</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:42907743</guid><pubDate>Sun, 02 Feb 2025 10:27:13 GMT</pubDate><description>&lt;p&gt;That’s a different paper than the one this article describes. The article describes this paper: https://arxiv.org/abs/2305.18654&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by monophonica</title><link>https://news.ycombinator.com/item?id=42745118</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:42745118</guid><pubDate>Sat, 18 Jan 2025 01:57:12 GMT</pubDate><description>&lt;p&gt;Would love to know if you know any other papers like: Faith and Fate: Limits of Transformers on Compositionality https://arxiv.org/abs/2305.18654 Maybe the analogy is something with gold mining. We could pretend that the machines that mine gold are actually creating gold. Pretending the entire gold mining sector is instead a discovery of alchemy. Maybe the way alchemy kind of leads to chemistry is the analogy that applies? I don&amp;#x27;t even know if that is right though. The intelligence is in the training data. The model then is extracting the intelligence. We can&amp;#x27;t forget Feynman&amp;#x27;s ideas here…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=41290430</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:41290430</guid><pubDate>Mon, 19 Aug 2024 12:26:29 GMT</pubDate><description>&lt;p&gt;&amp;gt; You can get them to solve unseen problems just fine Prove that the problem wasn&amp;#x27;t seen by them in other form. &amp;gt; Specify a grammar in BNF notation and tell it to generate or parse sentences for you. You can produce a more than random enough grammar that it it can&amp;#x27;t have derived the parsing of it from past text, but necessarily reasons about BNF notation sufficiently well to be able to use it to deduce the grammar, and use that to parse subsequent sentences. You can have it analyse them and tag them according to the grammar to. And generate sentences. Oh, come on. It&amp;#x27;s like rewriting the same…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=41290373</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:41290373</guid><pubDate>Mon, 19 Aug 2024 12:17:28 GMT</pubDate><description>&lt;p&gt;&amp;gt; &amp;quot;generalize to its dataset&amp;quot; is a contradiction Not &amp;quot;to&amp;quot; but over, example the same code written in one language over the other language. &amp;gt; if you think being able to generalize in ways similar to the whole of the internet does not give your meaningful abilities to reason, I&amp;#x27;m not sure what I can tell you If after reading papers below that show empirically that they can&amp;#x27;t reason, you will still think they can reason, then I don&amp;#x27;t know what I can tell you. https://arxiv.org/abs/2311.00871 https://arxiv.org/abs/2309.13638 https://arxiv.org/abs/2311.09247 https://arxiv.org/abs/2305.18654…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by blackbear_</title><link>https://news.ycombinator.com/item?id=39714527</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:39714527</guid><pubDate>Fri, 15 Mar 2024 11:54:51 GMT</pubDate><description>&lt;p&gt;This paper does indeed follow your intuition to investigate the limits of transformers on compositional tasks (i.e., those that require multi-step reasoning, including your multiplication example): https://arxiv.org/abs/2305.18654 &amp;gt; Our empirical findings suggest that transformer LLMs solve compositional tasks by reducing multi-step compositional reasoning into linearized subgraph matching, without necessarily developing systematic problem-solving skills. To round off our empirical study, we provide theoretical arguments on abstract multi-step reasoning problems that highlight how…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=39628030</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:39628030</guid><pubDate>Thu, 07 Mar 2024 12:02:24 GMT</pubDate><description>&lt;p&gt;There is evidence that they actually can&amp;#x27;t reason: https://arxiv.org/abs/2311.00871 https://arxiv.org/abs/2309.13638 https://arxiv.org/abs/2311.09247 https://arxiv.org/abs/2305.18654 https://arxiv.org/abs/2309.01809&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=39093457</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:39093457</guid><pubDate>Mon, 22 Jan 2024 18:41:00 GMT</pubDate><description>&lt;p&gt;For every N papers suggesting that LLM can &amp;quot;understand&amp;quot; you have X papers that suggests they can&amp;#x27;t. https://arxiv.org/abs/2311.00871 https://arxiv.org/abs/2309.13638 https://arxiv.org/abs/2311.09247 https://arxiv.org/abs/2305.18654 https://arxiv.org/abs/2309.01809&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=38905248</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:38905248</guid><pubDate>Sun, 07 Jan 2024 21:20:19 GMT</pubDate><description>&lt;p&gt;There is also a lot of evidence lately that they do not generalize. https://arxiv.org/abs/2311.00871 https://arxiv.org/abs/2309.13638 https://arxiv.org/abs/2311.09247 https://arxiv.org/abs/2305.18654&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=38784270</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:38784270</guid><pubDate>Wed, 27 Dec 2023 17:32:22 GMT</pubDate><description>&lt;p&gt;A few more interesting papers not mentioned in the article: &amp;quot;Faith and Fate: Limits of Transformers on Compositionality&amp;quot; https://arxiv.org/abs/2305.18654 &amp;quot;Comparing Humans, GPT-4, and GPT-4V On Abstraction and Reasoning Tasks&amp;quot;: https://arxiv.org/abs/2311.09247 &amp;quot;Embers of Autoregression: Understanding Large Language Models Through the Problem They are Trained to Solve&amp;quot; https://arxiv.org/abs/2309.13638 &amp;quot;Pretraining Data Mixtures Enable Narrow Model Selection Capabilities in Transformer Models&amp;quot; https://arxiv.org/abs/2311.00871&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — HN submission</title><link>https://news.ycombinator.com/item?id=37390633</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.18654:37390633</guid><pubDate>Tue, 05 Sep 2023 12:13:51 GMT</pubDate><description>&lt;p&gt;Faith and Fate: Limits of Transformers on Compositionality&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Faith and Fate: Limits of Transformers on Compositionality — mentioned by MAXPOOL</title><link>https://news.ycombinator.com/item?id=36759324</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:36759324</guid><pubDate>Mon, 17 Jul 2023 15:21:08 GMT</pubDate><description>&lt;p&gt;What about LLM reasoning ability? Faith and Fate: Limits of Transformers on Compositionality https://arxiv.org/abs/2305.18654 Transformers solve compositional reasoning tasks by reducing multi-step compositional reasoning into linearized subgraph matching without problem-solving skills. They can solve problems when they have reasoning graphs in the memory.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — HN submission</title><link>https://news.ycombinator.com/item?id=36405937</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.18654:36405937</guid><pubDate>Tue, 20 Jun 2023 15:55:35 GMT</pubDate><description>&lt;p&gt;Faith and Fate: Limits of Transformers on Compositionality&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Faith and Fate: Limits of Transformers on Compositionality — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=36371201</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654: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/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — mentioned by visarga</title><link>https://news.ycombinator.com/item?id=36254313</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.18654:36254313</guid><pubDate>Fri, 09 Jun 2023 07:02:40 GMT</pubDate><description>&lt;p&gt;This recent paper investigates the limits of symbolic operations in LLMs and found that they learn a weaker ability than actual reasoning - linearized subgraph matching. &amp;gt; &amp;quot;Faith and Fate: Limits of Transformers on Compositionality&amp;quot; - We investigate the limits of these models across three representative compositional tasks -- multi-digit multiplication, logic grid puzzles, and a classic dynamic programming problem. These tasks require breaking problems down into sub-steps and synthesizing these steps into a precise answer. We formulate compositional tasks as computation graphs to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&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>Faith and Fate: Limits of Transformers on Compositionality — HN submission</title><link>https://news.ycombinator.com/item?id=36241108</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.18654:36241108</guid><pubDate>Thu, 08 Jun 2023 12:57:23 GMT</pubDate><description>&lt;p&gt;Faith and Fate: Limits of Transformers on Compositionality&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.18654/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
