aspireai.
PUBLIC EDITION

Reinforcement learning scored answers but ignored how sure the model was, so confident mistakes were corrected no harder than lucky ones

AspireAI community · arXiv (Zhenghong Ke, Jingbo Zhou, Hua Wu)
Reinforcement learning with verifiable rewards scores sampled responses with a rule-based verifier, but nothing ties the policy's confidence in a response to the reward it receives, so a success the policy barely found earns the same update as one it produces with near certainty, and a confident error is corrected no harder than an exploratory one. SCARL reshapes, without ever re-signing, each advantage using the alignment gap between the response's group-relative confidence and the outcome its advantage certifies, normalized into shares of each class's advantage budget, which also repairs the entropy collapse that erodes exploration. On Qwen3-4B-Base it lifts average Pass@32 by 2.4 points over DAPO and ranks best among nine compute-matched methods on both coverage and per-draw accuracy, and applied unchanged across four estimators and four backbones it improves 14 of 16 settings while preserving policy entropy. It provably reduces to its base estimator when a class's confidences agree, adding no extra passes and one hyperparameter.
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.