aspireai.
PUBLIC EDITION

Masked diffusion models commit answers too early under a tight budget, and distilling a large-window teacher into a small-window student recovered 9.4 points on GSM8K while shortening answers

AspireAI community · arXiv
Unlike autoregressive models, masked diffusion models choose both what to generate and where to commit it, and under a limited generation window the paper identifies budget-induced premature commitment: the model can fix answer fragments near the window boundary before resolving intermediate steps, and those committed fragments become context that redirects subsequent reasoning. HiLo-RD attacks this by pairing large-window teacher states with cropped small-window views and matching their hidden representations at committed positions, which supervises both token prediction and commitment order without needing an external teacher. Across mathematics benchmarks it improves low-budget accuracy and shortens responses, and the gains carry into code generation with no code-domain training. On GSM8K accuracy rises by 9.4 percentage points while mean readable length falls about 25 percent. The mechanism is supported by attention diagnostics and fixed-budget order interventions rather than by a single aggregate score.
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.