Claims of emergence in AI should be grounded in information decomposition
Organizations: Khoury College of Computer Sciences Northeastern University Boston, MA 02115 · Department of Informatics University of Sussex Brighton, BN1 9RH
Abstract
When a language model develops capabilities not traceable to its individual components, when a multi-agent AI system outperforms each agent on its own, or when a human-AI pair succeeds where either fails in isolation, AI researchers describe it as a case of synergy'' or emergence''. However, these are usually informal assessments not supported by a theoretical framework, making these claims impossible to compare or even meaningfully dispute. Here we argue that information decomposition can serve as a unifying formal framework to operationalize assessments about synergy in AI systems. Information decomposition provides a way to distinguish qualitatively different types of information, including unique information available from individual components, redundant information shared across multiple components, and synergistic information accessible only from parts taken together. This gives claims of emergence a precise, falsifiable criterion: a system's behavior is emergent only if it carries synergistic information about task-relevant outcomes. We apply this lens to attention heads, autonomous agents, and human-AI teams, showing how it organizes existing knowledge across scales and substrates, while also generating cross-level conjectures that siloed fields would miss.
Figures & tables
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
| Question / stage | Recommended approach | Key caveat | |
| Decide | What are the parts, target, and timescale? | Fix parts, target, timescale , and redundancy measure on theoretical grounds | Not given by the theory; claims are bounded by these choices. Substantiate claims by demonstrating robustness across granularities (e.g., heads and experts), orders (e.g., pairs/triplets), and targets (e.g., group error and principal component) |
| Estimate | Small system ( ), full structure needed | Exact PID, named redundancy measure (BROJA bivariate; / discrete) | Report the measure; check for robustness |
| Large system, net balance suffices | Localized/gradient O-information | Conflates Red/Syn; use per-node, not one global number; report strength measure (S-information or total correlation) to distinguish more synergy from less redundancy; size-matched random baseline to address bias. | |
| “Is there any emergence?” screen | Emergence-capacity (pairwise ); (Eq. 4) | Negative inconclusive (redundancy subtracted up to times); consider redundancy-corrected [ 92 ] | |
| LLM circuits—which units | Pairwise/subset synergy per-node ranks (as in the core work) | Blind to high-order; needs null; add ablation for causal claims | |
| Dynamical / multi-agent over time | TDMI-based causal-emergence / ID | Requires block-shuffled nulls; timescale is a choice; state and report at least one alternative . |
| PID Principle | Observable Signature | Design Levers |
|---|---|---|
| Synergy requires differentiation | Identical experts / agents produce only redundancy | Sparsity and routing in MoE systems (larger in top- gating synergy [ 101 , 29 ] ); data augmentation ( redundancy [ 98 ] ); personas/roles ( synergy [ 82 ] ); division of labor ( uniqueness) vs. co-creation ( synergy) |
| Synergy is fragile, redundancy is robust | Sharp failure modes vs. graceful degradation; flat-gradient stalling on synergistic tasks; robust OOD when structure is stable vs. brittle if composition shifts; path-dependent collapse | Dropout ( redundancy [ 2 , 74 ] ); BatchNorm / LayerNorm ( synergy potential [ 20 ] ); early stopping ( redundancy) vs. extended training, warmup schedules ( synergy); individual rewards ( independence & uniqueness) vs. shared rewards ( synergy); shaped rewards for coordination ( synergy) |
| Synergistic information is non-local | Not locally attributable; modular interpretability fails | Attention mechanism ( synergy [ 101 ] ); data curation in multi-modal training ( synergy [ 52 ] ); centralized ( synergy) vs. decentralized training execution ( redundancy); adaptivity & personalization ( synergy [ 14 , 49 , 43 ] ) |
| Synergy provides superlinear capacity | Superlinear performance gains but data-hungry estimation | Network width ( synergy) vs. depth ( synergy); ToM in multi-agent systems & human-AI ( synergy; differentiation [ 78 , 80 , 82 ] ); full observability ( synergy) vs. partial observability ( synergy) |
| Rung | Synergistic core [ 101 ] | Multi-agent [ 82 ] | Human-AI [ 80 ] |
|---|---|---|---|
| Detect | Pairwise ID synergy ranks | ; emergence capacity | Bounded residual; formal PID |
| Localize | Middle layers; heads and experts | Agent pairs, not triplets; identity-linked roles | Hard and AI-unsolvable items; trait |
| Identify causally | Ablation of synergistic vs. redundant heads | Randomized Plain / Persona / ToM conditions | Randomized assignment; users items crossed; phases rule out learning |
| Control | RL fine-tuning of synergistic regions | ToM prompt as control parameter | Open: ToM is measured, not manipulated |
| Predict | Conjectures 1–4 | Conjecture 5 | Conjecture 5 |
| Name | License | Language | Cont. | Disc. | Framework | Ref. |
| Partial Information Decomposition | ||||||
| IDTxl | GPLv3 | Python | ✓ | ✓ | PID, PED | [ 108 ] |
| dit | BSD-3 | Python | × | ✓ | PID | [ 39 ] |
| BROJA_2PID | Apache 2 | Python | × | ✓ | PID (bivariate) | [ 57 ] |
| SxPID | GPLv3 | Python | × | ✓ | PID | [ 56 ] |
| infotheory | MIT | Python/C++ | ✓ | ✓ | PID | [ 11 ] |
| Hypothesis |
|---|
| Grokking as redundancy-to-synergy transition: |
| Track O-information of the hidden representation across training; confirmed if flips from positive to negative within the test-accuracy jump (and an -penalty delays it), falsified if drifts smoothly with train accuracy. |
| Jagged intelligence as a factored-representation boundary: |
| Score each task by synergistic depth ; confirmed if accuracy falls with depth after partialling out human-rated difficulty, falsified if accuracy is unrelated to or difficulty dominates once depth is controlled. |
| Test-time compute as synergy unrolling: |
| Measure per-pass synergy (synergy-redundancy rank) for a reasoning vs. base model; confirmed if the reasoning model shows lower per-pass synergy and compute gains shrink with synergistic depth, falsified if its per-pass synergy is equal or higher. |