aspireai.
PUBLIC EDITION

Linear attention stores values in addresses, and this adds a second way to read them

AspireAI community · arXiv
Linear attention and state space models keep a fixed-size recurrent state, which needs careful management to preserve useful associations and limit interference. The delta rule corrects the value associated with each key, but it does not address how related value features are distributed across the state. Dual DeltaNet (DDN) reads the state two ways: the key-side delta rule reads with the current key to correct its associated value, and a complementary value-side delta rule reads with selected features of the current value to reorganise the addresses it occupies. It extends Kimi Delta Attention, with a chunkwise parallel training algorithm and a rank-2 recurrence that raises arithmetic intensity at inference. Compared with KDA, GDN-2 and Mamba-3, the authors report the strongest overall performance across language modelling, zero-shot downstream tasks and retrieval, at modest training and inference overhead relative to KDA. Code is released. Worth noting the line it extends is recent - KDA itself is not an old baseline.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.