The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale
arXiv:2607.14144
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper isolates a useful architectural principle: prediction can only exploit history through the query-time accessible state, regardless of how expressive the hidden representation is. Its data-processing bound turns an architectural bottleneck into a measurable quantity, and motivates combining a fixed-size compressive state with a query-dependent verbatim retrieval channel. The most actionable transfer is a budgeted hybrid recurrent/SSM backbone augmented by sparse attention or external memory, with the retrieval path activated when the state channel cannot preserve the required information. This is not merely a larger state: the two channels support qualitatively different operations, compression for long-range mixing and indexed access for exact facts.
Ideas from this paper
Unverified
2026
Replace a purely recurrent or state-space history summary with two explicitly separated paths: a fixed-size state channel for compressed sequence mixing and a query-dependent indexed channel for exact or near-exact retrieval. Train a lightweight gate to invoke top-k retrieval only when the recurrent state has insufficient evidence for the current query, preserving near-constant cost on ordinary tokens while preventing catastrophic failures on long-range exact-recall tasks.
Useful6/10
Difficulty5/10
Novelty4/10