Quantifying Memory Utilization with Effective State-Size
Not on the map. Why?
Abstract (arXiv)
The need to develop a general framework for architecture analysis is becoming increasingly important, given the expanding design space of sequence models. To this end, we draw insights from classical signal processing and control theory, to develop a quantitative measure of textitmemory utilization: the internal mechanisms through which a model stores past information to produce future outputs. This metric, which we call textbftextiteffective state-size (ESS), is tailored to the fundamental class of systems with textitinput-invariant and textitinput-varying linear operators, encompassing a variety of computational units such as variants of attention, convolutions, and recurrences. Unlike prior work on memory utilization, which either relies on raw operator visualizations (e.g. attention maps), or simply the total textitmemory capacity (i.e. cache size) of a model, our metrics provide highly interpretable and actionable measurements. In particular, we show how ESS can be leveraged to improve initialization strategies, inform novel regularizers and advance the performance-efficiency frontier through model distillation. Furthermore, we demonstrate that the effect of context delimiters (such as end-of-speech tokens) on ESS highlights cross-architectural differences in how large language models utilize their available memory to recall information. Overall, we find that ESS provides valuable insights into the dynamics that dictate memory utilization, enabling the design of more efficient and effective sequence models.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Apr 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Preconditioned DeltaNet: Curvature-aware Sequence Modeling for Linear Recurrencescited by 7
- 2026On State Reduction in Linear Attentioncited by 6
- 2026On the Recall Scaling Laws in Mamba: A Theoretical and Mechanistic Study via Hashingcited by 1
- 2026The Rank the Task Demands: A Causal Rank Law for Matrix Memories Trained on Group Compositioncited by 1
- 2026Anatomy of Associative Recall in Fixed-State Recurrences: A Matched-State Decomposition, an Interference Wall, and a Curriculum That Breaks Itcited by 1
- 2026Anatomy of Associative Recall in Fixed-State Recurrences: A Matched-State Decomposition, an Interference Wall, and a Curriculum That Breaks It14 Sep 2026
- 2026The Rank the Task Demands: A Causal Rank Law for Matrix Memories Trained on Group Composition10 Sep 2026
- 2026On the Recall Scaling Laws in Mamba: A Theoretical and Mechanistic Study via Hashing7 Sep 2026
- 2026Preconditioned DeltaNet: Curvature-aware Sequence Modeling for Linear Recurrences22 Apr 2026
- 2026On State Reduction in Linear Attention4 Feb 2026