RangeSWA extends continuous diffusion language models past their training length without any training, by remapping positions and adapting attention
AspireAI community · arXiv (cs.CL)
Continuous diffusion language models tend to repeat text, drift semantically and degrade once generation runs longer than the length they were trained on. RangeSWA is a training-free length extrapolation method that combines local sliding-window attention, remote block summaries and dynamic content retrieval to keep local detail while supporting long-range context. Degradation is addressed with positional remapping, conditioning attention correction and denoising-stage-adaptive window scheduling. Across multiple continuous diffusion language models the authors report reduced generative perplexity and lower text repetition rates in long-text generation. The abstract reports directions of improvement rather than specific figures, and the method's dependence on sliding windows means it trades exact long-range recall for stability at the boundary.
Read the story and explore more from the AspireAI community.
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.