REVIEW 3 cited by
Mimetic Initialization Helps State Space Models Learn to Recall
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Recent work has shown that state space models such as Mamba are significantly worse than Transformers on recall-based tasks due to the fact that their state size is constant with respect to their input sequence length. But in practice, state space models have fairly large state sizes, and we conjecture that they should be able to perform much better at these tasks than previously reported. We investigate whether their poor copying and recall performance could be due in part to training difficulties rather than fundamental capacity constraints. Based on observations of their "attention" maps, we propose a structured initialization technique that allows state space layers to more readily mimic attention. Across a variety of architecture settings, our initialization makes it substantially easier for Mamba to learn to copy and do associative recall from scratch.
Forward citations
Cited by 3 Pith papers
-
SHiPPO: Recurrent Memory with Transported Polynomial Projections
SHiPPO transports HiPPO coefficient memories via right actions into Sylvester dynamics, and diagnostics show this recovers order-sensitive memory changes that high-rank writes cannot.
-
Physics of Language Models: Part 4.1, Architecture Design and the Magic of Canon Layers
Canon layers—residual 1-d causal convolutions over adjacent tokens—boost synthetic reasoning depth 2-4x, lift NoPE to RoPE level, and bring GLA up to Mamba2/GDN, with qualitative real-world confirmation.
-
An Uncertainty Principle for Linear Recurrent Neural Networks
For linear RNNs, recalling an input K steps back with S hidden units has best-case error about 1-S/K when K exceeds S, with the filter's width scaling as K/S.
Discussion (0). Continue with ORCID to comment.