Label-free steering: Compressing test-time reinforcement learning into bias-only subspaces
Naveen Vakada, Mingyuan Li, Shaoxiong Ji
University of Turku · ELLIS Institute Finland
Published September 28, 2026 · on the feed October 1, 2026 · ▲ 3 · arXiv 2609.18587
The abstract
Test-time reinforcement learning (TTRL) enables models to improve their reasoning without relying on labeled training data, but existing approaches typically optimize a large fraction of the model parameters. This raises a natural question: can effective test-time adaptation emerge when both the reward signal and the optimization space are severely restricted? We answer this question with label-free bias-only TTRL, which uses majority-vote pseudolabels as rewards and optimizes only ~100K bias parameters while keeping the pretrained backbone frozen. On MATH-500, our approach reaches 76.67% accuracy with Qwen2.5-7B, slightly exceeding our own labeled bias-steering reproduction while optimizing 76,000x fewer parameters than full-parameter TTRL. The same training procedure improves performance across vision-language and audio reasoning tasks, including MathVista, AI2D, LogicVista, and MMAU. We further show that the learned steering vectors transfer to 4,500 held-out MATH problems, indicating that the adaptation is not limited to the problems used during test-time optimization. Finally, we analyze why this highly restricted adaptation can work, showing that majority-vote reliability improves with rollout consensus and that bias subspaces with greater accessible gradient energy exhibit stronger downstream trainability. These results demonstrate that substantial test-time adaptation can emerge from optimizing a tiny bias-only subspace using entirely label-free rewards.
The Brief
2:42A short podcast summary of the paper. Written and voiced by AI.
Transcript
Label-free steering. Compressing test-time reinforcement learning into bias-only subspaces. By Naveen Vakada and two others, from the University of Turku and the ELLIS Institute Finland. Published on the twenty-eighth of September. Its code repository is public but slight: eight source files.
Test-time reinforcement learning, or TTRL, lets a model improve its reasoning without labeled training data. The catch is in what gets trained. Existing approaches typically optimize a large fraction of the model's parameters. That raises a pointed question: can useful adaptation at test time still emerge when both the reward signal and the space being optimized are severely restricted? No labels to define the reward, and almost nothing to move. Each restriction alone removes something that adaptation would normally lean on. Together they make a stringent test of how little test-time learning actually needs.
The answer offered here is label-free bias-only TTRL. Rewards come from majority-vote pseudolabels: the model's own most common answer stands in for the correct one. And the only thing trained is a set of roughly one hundred thousand bias parameters, with the pretrained backbone kept frozen. What the bias terms learn act as steering vectors laid on top of an unchanged model.
Restricted that tightly, why would it work at all? The authors analyze exactly that and point to two conditions. Majority-vote reliability improves as rollouts reach consensus, so the pseudolabel becomes more trustworthy when the model agrees with itself. And bias subspaces with greater accessible gradient energy show stronger downstream trainability, so some small subspaces simply carry more room to learn than others.
On MATH-500 with Qwen2.5-7B, the approach reaches seventy-six point six seven percent accuracy. That slightly exceeds the authors' own labeled bias-steering reproduction, and it does so while optimizing seventy-six thousand times fewer parameters than full-parameter TTRL. Put differently, giving up the labels did not cost accuracy against the labeled version of the same bias-only setup.
The same training procedure improves performance beyond text, on vision-language and audio reasoning tasks including MathVista, AI2D, LogicVista, and MMAU. The learned steering vectors also transfer to four thousand five hundred held-out MATH problems, which indicates the adaptation is not confined to the problems it was optimized on.
Strip test-time learning down to its smallest pieces: no labels, a frozen backbone, a hundred thousand biases. What remains is still substantial adaptation, and it carries across text, images, audio, and problems never seen during optimization. The reward needs only the model's agreement with itself, and the parameter budget needs only a subspace with enough gradient energy to move.
Paper Quest · 7 chapters · about 39 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
No answer key, and a budget that barely buys anything. Start there.
You want a reasoning model to get better at a set of maths problems right now, while you are testing it. There is no answer key: nobody has labelled these problems.
The road ahead
- 1 · The problem ~6 min You want a model to improve on unlabelled maths problems during testing, but current methods retrain huge numbers of weights, which is expensive.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Reward the model for agreeing with its own majority answer, and train only small bias vectors on a frozen backbone, choosing a subspace with useful gradient.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Sample rollouts, vote for a pseudolabel, reward matches, then update only the bias vectors while the backbone stays frozen.
- 6 · The experiment ~6 min You’ll guess: With no labels at all, how did label-free bias-only TTRL on MATH-500 with Qwen2.5-7B compare to the authors' labeled bias-steering reproduction?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.