Benchmarking and Understanding Compositional Relational Reasoning of LLMs
On the map: LLM reasoning → Reasoning benchmarks and evaluation
Abstract (arXiv)
Compositional relational reasoning (CRR) is a hallmark of human intelligence, but we lack a clear understanding of whether and how existing transformer large language models (LLMs) can solve CRR tasks. To enable systematic exploration of the CRR capability of LLMs, we first propose a new synthetic benchmark called Generalized Associative Recall (GAR) by integrating and generalizing the essence of several tasks in mechanistic interpretability (MI) study in a unified framework. Evaluation shows that GAR is challenging enough for existing LLMs, revealing their fundamental deficiency in CRR. Meanwhile, it is easy enough for systematic MI study. Then, to understand how LLMs solve GAR tasks, we use attribution patching to discover the core circuits reused by Vicuna-33B across different tasks and a set of vital attention heads. Intervention experiments show that the correct functioning of these heads significantly impacts task performance. Especially, we identify two classes of heads whose activations represent the abstract notion of true and false in GAR tasks respectively. They play a fundamental role in CRR across various models and tasks. The dataset and code are available at https://github.com/Caiyun-AI/GAR.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Reasoning benchmarks and evaluation, one of 17 directions in LLM reasoning. Builds on 9 of its 38 references that are in the map. First posted on arXiv 17 Dec 2024.
Builds on
9 of 38 references.
References · 9
- 2022In-context Learning and Induction Headscited by 930
- 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 673
- 2024Do Large Language Models Latently Perform Multi-Hop Reasoning?cited by 165
- 2023Physics of Language Models: Part 3.2, Knowledge Manipulationcited by 142
- 2024Physics of Language Models: Part 2.1, Grade-School Math and the Hidden Reasoning Processcited by 107
- 2022Unveiling Transformers with LEGO: a synthetic reasoning taskcited by 105
- 2024Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queriescited by 78
- 2024Transformers, parallel computation, and logarithmic depthcited by 75
- 2024Limits of Transformer Language Models on Learning to Compose Algorithmscited by 13
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025MUDDFormer: Breaking Residual Bottlenecks in Transformers via Multiway Dynamic Dense Connectionscited by 27
- 2026Stop Taking Tokenizers for Granted: They Are Core Design Decisions in Large Language Modelscited by 5
- 2026Can LLMs Compress (and Decompress)? Evaluating Code Understanding and Execution via Invertibilitycited by 4
- 2026Toward Skill-Native LLMs: Skill Entropy for Benchmarking and Training Long-Horizon Reasoningcited by 0
- 2026Toward Skill-Native LLMs: Skill Entropy for Benchmarking and Training Long-Horizon Reasoning5 Aug 2026
- 2026Can LLMs Compress (and Decompress)? Evaluating Code Understanding and Execution via Invertibility19 Jan 2026
- 2026Stop Taking Tokenizers for Granted: They Are Core Design Decisions in Large Language Models19 Jan 2026
- 2025MUDDFormer: Breaking Residual Bottlenecks in Transformers via Multiway Dynamic Dense Connections13 Feb 2025
Similar, not cited
Close in wording, no citation either way
- 2024Understanding and Patching Compositional Reasoning in LLMs
- 2024Do Large Language Models Have Compositional Ability? An Investigation into Limitations and Scalability
- 2025Compositional Generalization from Learned Skills via CoT Training: A Theoretical and Structural Analysis for Reasoning
- 2025Mapping the Minds of LLMs: A Graph-Based Analysis of Reasoning LLM
- 2025How and Why LLMs Generalize: A Fine-Grained Analysis of LLM Reasoning from Cognitive Behaviors to Low-Level Patterns
- 2025CryptoX : Compositional Reasoning Evaluation of Large Language Models
- 2025Can LLMs Reason Structurally? Benchmarking via the Lens of Data Structures
- 2025Characterizing Pattern Matching and Its Limits on Compositional Task Structures