Every time a transformer reads a sentence, it lets each word look at every other word. That flexibility is powerful — but it costs in time and memory. Double the sequence and you pay four times the price.
State-space models (SSMs) take a different bet. Instead of full attention, they compress the entire past into a compact hidden state and update it one step at a time. The update is a linear recurrence — fast, parallelisable, and in the sequence length.
The key insight, pioneered by S4 (Gu et al., 2021) and sharpened by Mamba (Gu & Dao, 2023), is that the right choice of structured matrices makes linear recurrence just as expressive as attention on most real tasks — language, audio, DNA — while being dramatically cheaper on long sequences.
This is an open research frontier. SSMs are not a settled theory; they are a fast-moving race to find the architecture that beats transformers and attention without paying the quadratic price.
Comments
Loading comments...