Pith. sign in

REVIEW 2 cited by

Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.20332 v2 pith:VRSKYGDO submitted 2025-02-27 cs.CL cs.AI

classification cs.CLcs.AI
keywords abstractreasoningsymbolicemergentmechanismsheadslayerscapabilities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many recent studies have found evidence for emergent reasoning capabilities in large language models (LLMs), but debate persists concerning the robustness of these capabilities, and the extent to which they depend on structured reasoning mechanisms. To shed light on these issues, we study the internal mechanisms that support abstract reasoning in LLMs. We identify an emergent symbolic architecture that implements abstract reasoning via a series of three computations. In early layers, symbol abstraction heads convert input tokens to abstract variables based on the relations between those tokens. In intermediate layers, symbolic induction heads perform sequence induction over these abstract variables. Finally, in later layers, retrieval heads predict the next token by retrieving the value associated with the predicted abstract variable. These results point toward a resolution of the longstanding debate between symbolic and neural network approaches, suggesting that emergent reasoning in neural networks depends on the emergence of symbolic mechanisms.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Can Large Language Models Generalize Procedures Across Representations?

    cs.CL 2026-02 conditional novelty 6.0 of 10

    Post-training on graph or code versions of a planning task does not transfer to natural-language versions, but a symbolic-then-natural-language RL curriculum achieves strong transfer.

  2. A Group Theoretic Analysis of the Symmetries Underlying Base Addition and Their Learnability by Neural Networks

    cs.LG 2025-07 conditional novelty 6.0 of 10

    For bases 3-5, the structural complexity of a base-addition carry rule (fractal dimension, carry frequency, associativity) strongly predicts whether a tiny recurrent network can learn it and generalize from 3-digit to...

Pith tools