aspireai.
PUBLIC EDITION

Cord learned when to break from confidence decoding for masked diffusion language models, lifting average task success from 32.0 to 48.2 percent

AspireAI community · arXiv
Masked diffusion language models decode by revealing tokens in some order, and the usual rule - reveal whichever token the model is most confident about - ignores whether that reveal actually helps the rest of the generation. Cord keeps confidence decoding as a stable reference and learns a small prompt-conditioned residual over generation direction, proximity to revealed context and two-sided infilling, sampling one low-dimensional coefficient matrix per rollout so a single policy decision induces a whole reveal trajectory. Across three dLLMs and five reasoning, code and constraint-satisfaction benchmarks, average task success rose from 32.0% to 48.2%, beating the best per-domain fixed residual. It costs 0.53 million trainable parameters, no extra backbone forward passes and 5.39% inference latency overhead, and because it is trained as a contextual bandit on sequence-level rewards there is no step-level credit assignment.
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.