INQUIRING LINE

If AI reasons by combining reusable building blocks, skills should transfer between domains — but the evidence says that's not what's happening.

Why does compositional reasoning fail to explain cross-domain transfer?

This explores why the idea of 'reasoning by recombining known parts' doesn't account for how models carry skills from one domain to another — and what the corpus says actually happens instead.


This explores why compositional reasoning — the appealing story that a model learns reusable primitives and recombines them, so a skill learned in one area should snap together in another — keeps falling short as an explanation for cross-domain transfer. The short version the corpus points to: models mostly aren't composing in the first place. When you look under the hood, what looks like compositional reasoning turns out to be Do transformers actually learn systematic compositional reasoning? — transformers succeed in-distribution by matching memorized computation subgraphs, not by applying systematic rules, and they fall apart on genuinely novel combinations with errors compounding across steps. If the mechanism is pattern-matching dressed as composition, it can't be the thing that transports skills to a new domain.

A second thread explains why. The reasoning models actually do is bound to meaning, not form: Do large language models reason symbolically or semantically? shows that when you strip semantic content away and give a model correct rules in context, performance collapses. So-called reasoning is riding on parametric commonsense and token associations tied to the training distribution — exactly the associations that don't survive a domain change. This is reinforced by the finding that Do language models fail at reasoning due to complexity or novelty?: models break at instance novelty, not task complexity, because they fit instance-specific patterns rather than the general algorithm a true compositional account would predict. Compositional reasoning predicts smooth transfer across novel instances; what we observe is failure precisely at the novelty boundary.

The chain-of-thought work closes the loop. Does chain-of-thought reasoning reveal genuine inference or pattern matching? and What makes chain-of-thought reasoning fail in language models? find that visible reasoning steps reproduce familiar schemata from training rather than performing fresh symbolic inference — invalid prompts work about as well as valid ones, and performance degrades predictably under distribution shift. If the reasoning trace is imitation of a form, there's no portable abstract structure inside it to carry across domains.

So what does transfer, if not composition? The corpus quietly reframes the question. How do transformers perform analogical reasoning across domains? finds that cross-domain analogy works through geometric alignment of relational structure in embedding space plus a learned mapping — transfer as spatial correspondence, not symbol recombination. And Can discrete codes transfer better than text embeddings? shows discrete codes transfer across domains better than raw text embeddings precisely because they strip out domain-specific surface bias. Both suggest that transfer, where it happens, rides on shared representational geometry — not on the assembly-of-primitives picture compositional reasoning assumes.

The honest tension worth sitting with: Do neural networks naturally learn modular compositional structure? finds networks genuinely do develop isolated modular subroutines, and pretraining makes them more reliable. So composition isn't a myth — it's just local. Modules form within the training distribution but don't generalize as clean, transportable operators. Compositional reasoning fails to explain transfer not because models never compose, but because their composition is memorized and semantics-bound, while whatever carries across domains lives one level down, in the shape of the representation space itself.


Sources 8 notes

Do transformers actually learn systematic compositional reasoning?

Research shows transformers succeed on in-distribution tasks by memorizing computation subgraphs from training data, not by learning systematic rules. They fail drastically on novel compositions, with errors compounding across reasoning steps.

Do large language models reason symbolically or semantically?

When semantic content is decoupled from reasoning tasks, LLM performance collapses even with correct rules in context. Models rely on parametric commonsense and token associations rather than formal logical manipulation, constraining reasoning to training distribution semantics.

Do language models fail at reasoning due to complexity or novelty?

LRMs don't break at complexity thresholds but at instance-novelty boundaries. Models fit instance-based patterns rather than generalizable algorithms, so any reasoning chain succeeds if trained on similar instances, regardless of length.

Does chain-of-thought reasoning reveal genuine inference or pattern matching?

CoT works by constraining models to reproduce familiar reasoning patterns from training, not by enabling novel symbolic reasoning. Performance degrades predictably under distribution shifts—the signature of imitation rather than capability emergence.

What makes chain-of-thought reasoning fail in language models?

Research shows CoT mirrors reasoning form without true logical abstraction. Format matters more than content, invalid prompts work as well as valid ones, and scaling reasoning creates instruction-following deficits.

Show all 8 sources
How do transformers perform analogical reasoning across domains?

Mechanistic analysis reveals transformers perform analogical reasoning via two stages: geometric alignment of relational structure in embedding space, followed by learned functor application. This signature appears in both synthetic tasks and pretrained LLMs.

Can discrete codes transfer better than text embeddings?

VQ-Rec demonstrates that mapping item text to discrete codes via product quantization, then to embeddings, improves cross-domain transfer compared to direct text encoding. The discrete intermediate reduces text bias and enables efficient per-domain fine-tuning.

Do neural networks naturally learn modular compositional structure?

Pruning experiments reveal that neural networks implement compositional subroutines in isolated subnetworks, with ablations affecting only their corresponding function. Pretraining substantially increases the consistency and reliability of this modular structure across architectures and domains.

Papers this line draws on 8

The research behind the notes this line reads — ranked by how closely each paper relates.

Research prompt for your LLMexpand ↓

Copy into ChatGPT or Claude to take this line of inquiry further — it asks the model to find newer work and re-test which earlier constraints still hold.

You are a reasoning-and-transfer analyst. Open question, still unresolved: why does compositional reasoning fail to explain cross-domain transfer in LLMs?

What a curated library found — and when (dated claims, not current truth; findings span ~2022–2026):
- What looks like composition reduces to linearized subgraph matching — models match memorized computation subgraphs in-distribution and collapse on novel combinations, errors compounding across steps (~2023).
- Reasoning is semantics-bound: strip semantic content and supply correct rules in-context, and performance collapses — it rides parametric commonsense, not form (~2023).
- Breakdown is driven by instance-level unfamiliarity, not task complexity — models fit instance patterns, not the general algorithm (~2025).
- CoT is constrained imitation of reasoning form: invalid prompts work about as well as valid ones, and traces carry no portable abstract structure (~2025).
- Where transfer happens, it rides on geometric alignment of relational structure and discrete codes, not symbol recombination — yet networks genuinely form modular subroutines that stay local (~2023).

Anchor papers (verify; mind their dates): Faith and Fate (2023), In-Context Semantic Reasoners (2023), Break It Down: Structural Compositionality (2023), CoT is Not True Reasoning (2025).

Your task:
(1) Re-test each constraint. For every finding, judge whether newer models, training, tooling, orchestration (memory, multi-agent, latent-space reasoning), or evaluation has RELAXED or OVERTURNED it. Separate the durable question from the perishable limitation; cite what resolved it, and say plainly where a constraint still holds.
(2) This is a live tension — surface the strongest CONTRADICTING or SUPERSEDING work from the last ~6 months that argues models DO compose, or that geometric-transfer accounts are wrong.
(3) Propose 2 research questions assuming the regime may have moved.

Cite arXiv IDs; flag anything you cannot ground in a real paper.