AIITITJul 14

Capability from Access Structure, Not Scale: Lower Bounds and Pre-Registered Tests for Hybrid Sequence Models

arXiv:2607.1414421.9h-index: 41
Predicted impact top 9% in AI · last 90 daysOriginality Highly original
AI Analysis

For the ML community studying sequence models, this work provides theoretical and empirical evidence that architectural access structure, not scale alone, determines capability, challenging the Platonic Representation Hypothesis.

The paper proposes the Capability Convergence Hypothesis (CCH), which states that under a fixed per-token inference budget, representational convergence does not imply capability convergence; instead, capability depends on access structure. Using information-theoretic lower bounds and pre-registered tests, they show that hybrid sequence models combining a compressive O(1)-state channel and a scalable verbatim-index channel achieve capabilities that pure architectures cannot, with exact-retrieval error dropping from 0.994 to 0.000 when a 64-scalar state gains one global-attention layer.

The Platonic Representation Hypothesis (PRH) holds that as models scale, representations of heterogeneous networks converge toward a shared model of reality. We propose its sequel and boundary, the Capability Convergence Hypothesis (CCH): under a fixed per-token inference budget, representational convergence does not entail capability convergence. Capability instead converges toward a class, the access-complete hybrid: any architecture holding both a compressive O(1)-state channel and a scalable verbatim-index channel. We anchor it on a witness task, the Newton's-apple problem in an infinite stream, and name three resource walls: a Shannon wall barring any o(Nb)-state architecture, a horizon wall barring any fixed window, and a circuit wall barring fixed-depth attention-only composition (conditional on TC0 != NC1). Under an explicit separability assumption a hybrid crosses all three by paying each wall's price, so capability is strictly super-additive under composition. We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture. We report the first pre-registered small-scale tests under criteria frozen before the data: the predicted scissors gap is measured (exact-retrieval error 0.994 vs. 0.000 once a 64-scalar state gains one global-attention layer), the state-tracking bifurcation lands at the registered boundary, and a conjunction witness shows an irreducibly two-channel solution; one prediction failed with its direction reversed and is reported as such. Representational convergence is given freely by scale; capability convergence must be purchased by access structure.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes