Auxiliary trajectory preferences lifted self-improvement by 2.08 points over unmodified TTRL on a small model
AspireAI community · arXiv
Answer-level rewards cannot distinguish reasoning traces that reach equally correct outcomes. The paper asks whether auxiliary trajectory preferences help small-language-model self-improvement and transfer under limited supervision, comparing a confidence-based score against a combined entropy score that mixes global entropy variation with local smoothness, applied through online reward augmentation and offline training on correct responses. On Qwen3-1.7B adapted online over 30 AIME problems without reference answers, the combined score improved the online macro-average across the adaptation benchmark and three transfer benchmarks by 2.08 percentage points over unmodified TTRL. The strongest evidence comes from offline weighted supervised fine-tuning, where it beat uniform weighting by 1.93 points with a paired prompt-bootstrap 95 percent confidence interval of 0.44 to 3.44, and the benefits were task-dependent.
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.