Research map / Large language models / Reasoning and chain of thought
Operads for compositional reasoning in LLMs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes modeling LLM question decomposition with operads, defining a questions operad and an operadic consistency diagnostic, with empirical evaluation deferred to a companion paper.
Problem
Question decomposition, used to improve LLM reasoning, lacks a rigorous mathematical foundation, and there is no principled way to define correctness or error propagation for decompositions without ground-truth labels.
Approach
Model question decomposition as the questions operad, in which operations are question templates with blanks and composition is substitution of sub-answers; interpret QA models as algebras over it and define operadic consistency as agreement of answers across partial collapses of a question decomposition tree.
Key results
- Illustrative example: Llama 3 8B Instruct gives three different answers ('Bess Truman' x3 vs 'Eleanor Roosevelt') across four partial collapses of one tree of questions, witnessing operadic inconsistency.
- Companion paper (not in this text) reportedly finds operadic consistency strongly correlated with accuracy across twelve LLMs and four multi-hop QA datasets, outperforming temperature-based self-consistency.
Limitations
- No empirical evaluation in this paper; results are deferred to a companion paper.
- Associativity holds only up to semantic equivalence when questions are realized in natural language.
- Depth-2 chain extraction is a minimal first attempt at formalizing reasoning traces.
Experimental setup
Builds on: chain-of-thought prompting decomposed prompting uncertainty of thoughts May's operad theory
Closest papers by meaning
- A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning (NeurIPS 2025 · similarity 0.90)
- Sample Smart, Not Hard: Correctness-First Decoding for Better Reasoning in LLMs (ICLR 2026 · similarity 0.89)
- CITE: Anytime Valid Statistical Inference in LLM Self-Consistency (NeurIPS 2026 · similarity 0.89)
- Optimal Self-Consistency for Efficient Reasoning with Large Language Models (ICML 2026 · similarity 0.89)
- Martingale Score: An Unsupervised Metric for Bayesian Rationality in LLM Reasoning (NeurIPS 2025 · similarity 0.88)
- AbstentionBench: Reasoning LLMs Fail on Unanswerable Questions (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
