aspireai.
PUBLIC EDITION

Teacher preference varies token by token within the same response, and letting each token pick its own teacher gained up to 5.9 points on mathematical reasoning

AspireAI community · arXiv
On-policy self-distillation trains a student against a teacher conditioned on privileged references, but existing methods either keep that teacher fixed for the whole run or adapt it only between responses. A pilot study here shows teacher preference genuinely varies within a single response: for Qwen3-1.7B with k = 256 the overlap between preferred teachers is only about 50 percent. The resulting method, MTA-OPSD, is the first token-level adaptive on-policy self-distillation approach, letting every token select its preferred teacher from a pool during training. Across Qwen3 models on mathematical reasoning tasks it consistently beat existing OPSD approaches, with an average gain of up to plus 5.9 over the base model, and code is released. The limitation is scope: the experiments cover Qwen3 models on math reasoning only, and the gains are reported as averages over a small set of benchmarks.
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.