RL-Unlocked MMLU Answers Are Only Partially Latent in the Base Model, and Emerge Late Rather Than Mid-Network
≈ $29.70 compute tokens $29.70 · GPU <$0.01
Download paper (PDF, NeurIPS format)
A Logit-Lens and Linear-Probe Test of the Elicitation Hypothesis
Ephraiem Sarabamoun
Abstract
A popular view of reinforcement learning and instruction tuning is the elicitation hypothesis: post-training mostly surfaces capabilities the base model already has rather than teaching new ones (Zhou et al., 2023; Lin et al., 2023). We test a strong, mechanistic form of that claim. If RL merely unlocks a latent answer, then an answer the instruct model gets right but the base model gets wrong should already be linearly decodable from the base model’s mid-layer hidden states. Using MMLU on Qwen2.5-7B and Llama-3.1-8B base and instruct pairs, we read mid-layer residuals two ways: the logit lens (Belrose et al., 2023), which projects a residual through the model’s own unembedding, and a five-fold linear probe on the residual. We find the strong form is not supported for this task. First, under a fixed raw prompt the base models already answer MMLU close to their instruct counterparts (Qwen 0.708 versus 0.724, Llama 0.640 versus 0.666), so the genuinely RL-unlocked set is small (165 and 222 of 2000 items). Second, the answer is near chance to the logit lens until the final fifth of the network, the answer becomes decodable only in late layers rather than the true middle, and the best-layer probe never exceeds the base model’s own output accuracy. Third, on the RL-unlocked subset (decoded at the best per-model layer) the base model’s internal answer is significantly above chance but far short of a clean latent-answer account: for Qwen the logit lens reaches 0.570 and the probe 0.412, and for Llama the logit lens is statistically at chance (0.284) while the probe reaches 0.365, against a 0.25 baseline and against within-model decodability above 0.95 elsewhere. We read this as evidence against the strong form of elicitation, that the unlocked answer is fully and mid-network linearly present, for MMLU multiple choice in these models, while being explicit that the content is partially latent rather than absent, that the decoding layer is late, and that these pairs show little MMLU unlocking to begin with, which limits the test’s power and is itself part of the finding.
1. Introduction
Whether post-training teaches or merely elicits has direct safety stakes. If instruction tuning and reinforcement learning from human feedback (Ouyang et al., 2022), including its helpful-and-harmless variants (Bai et al., 2022), mostly resurface latent base-model competence, then capability and safety auditing can in principle target the base model, and the answer should be readable from its internal states even when its output is wrong. The superficial-alignment and unlocking literatures argue exactly this at the behavioral level (Zhou et al., 2023; Lin et al., 2023), and a complementary interpretability line shows that truth, knowledge, and other high-level features are often linearly present in activations (Burns et al., 2022; Marks and Tegmark, 2023; Park et al., 2023). We turn that behavioral claim into a falsifiable mechanistic test: are the answers an instruct model unlocks already linearly decodable from the base model partway through the forward pass?
We operationalize decodability with two readouts. The logit lens applies the model’s final normalization and unembedding to an intermediate residual and asks which option token wins (Belrose et al., 2023), measuring whether the answer is legible in the model’s own output basis at that depth. The linear probe trains a multinomial classifier on the residual, measuring whether the answer is linearly present in any basis. We run both across layers for Qwen2.5-7B (Yang et al., 2024) and Llama-3.1-8B (Dubey et al., 2024), base and instruct, on MMLU (Hendrycks et al., 2020), and focus on the RL-unlocked subset where the instruct model is right and the base model’s output is wrong.
2. Related work
The elicitation view has behavioral support: small alignment datasets suffice (Zhou et al., 2023) and base models can be steered to aligned behavior with no weight updates (Lin et al., 2023). Direct preference optimization and reinforcement learning from human feedback are the dominant post-training recipes whose mechanism is in question (Rafailov et al., 2023; Ouyang et al., 2022; Bai et al., 2022). On the interpretability side, latent knowledge can be recovered from activations without supervision (Burns et al., 2022), correctness has linear geometry (Marks and Tegmark, 2023), and concepts can be both read and steered as directions (Zou et al., 2023; Li et al., 2023), with a single direction sometimes mediating a post-training-induced behavior such as refusal (Arditi et al., 2024). Models also carry calibrated self-knowledge of correctness (Kadavath et al., 2022), and some world features sit linearly in mid-network (Gurnee and Tegmark, 2023). Against this, output and internal computation can diverge (Turpin et al., 2023), and output-level correctness signals are an established alternative to internal probing (Manakul et al., 2023). Our contribution is a targeted negative result: for MMLU, the answers RL unlocks are not strongly linearly decodable from base mid-layers, in contrast to the refusal-direction case where an RL-shaped behavior is sharply latent.
3. Method
We sample 2000 MMLU test questions at seed 42 and format each as a fixed raw multiple-choice prompt ending in “Answer:”, identical for base and instruct models so their hidden states are comparable. We run each model with hidden-state output and capture the residual at the final input token, the position that predicts the answer letter, for ten evenly spaced layers. At each layer the logit lens applies the model’s final RMSNorm and unembedding, restricted to the four option tokens, and takes the argmax. To avoid materializing full-vocabulary logits we project the normalized residual onto only the four option rows of the unembedding, which is mathematically identical for these bias-free heads. The model’s own final-output prediction is the same projection on the last layer. Separately we train a multinomial logistic-regression probe on a 256-dimensional principal-component reduction of the residual, fit per fold inside five-fold stratified cross-validation so there is no leakage, and report out-of-fold accuracy. The RL-unlocked subset for each base-instruct pair is the set of items where the instruct model’s output is correct and the base model’s output is wrong. All accuracies carry percentile bootstrap 95 percent confidence intervals with 2000 resamples at seed 42, and a recompute script rebuilds every reported number from per-example predictions.
4. Results
The premise is weaker than the elicitation framing assumes. Under the raw prompt the base models already do well on MMLU: Qwen2.5-7B base reaches 0.708 against its instruct 0.724, and Llama-3.1-8B base reaches 0.640 against its instruct 0.666. Instruction tuning moves final-output accuracy by less than three points, so the genuinely RL-unlocked subset is small, 165 items for Qwen and 222 for Llama. Figure 5 shows this elicitation gap per model alongside the base model’s best mid-layer probe.


Decodability across depth does not match the latent-answer picture. Figure 1 plots the Qwen base and instruct logit-lens and probe accuracy by layer. The logit lens sits at chance, near 0.22, through the entire first three quarters of the network and only rises in the last few layers, reaching the output accuracy of 0.708 essentially at the final block. The best mid-layer logit lens for Qwen base reaches only 0.704, and that peak is itself almost at the output layer rather than in the true middle. The linear probe rises earlier, to about 0.65 by three quarters depth, but it plateaus below the base model’s own output accuracy rather than above it, so there is no depth at which the answer is more decodable internally than the model already states. Llama base shows the same shape with lower ceilings: its best mid-layer logit lens reaches 0.618 and its best mid-layer probe reaches 0.599, again only in the second half of the network and never above the base output accuracy of 0.640. Figure 4 contrasts the two readouts for Qwen base directly, showing the lens lagging the probe until the very end. Figure 3 shows the probe-by-layer curves for all four models, with the same shape for base and instruct and for both model families (Park et al., 2023).



The decisive test is the RL-unlocked subset, shown in Figure 2. Here the base model’s output is wrong by construction, and the elicitation hypothesis predicts the answer should still be recoverable from its mid-layers. It is recoverable above chance but only partially, and these numbers come from each base model’s best decoding layer, which sits late in the network rather than at the true middle. For Qwen that layer recovers 0.570 by logit lens (95 percent CI 0.491 to 0.649) and 0.412 by linear probe (0.339 to 0.485); both confidence intervals exclude the 0.25 chance baseline, so the answer is significantly present, yet both fall far below the within-model decodability above 0.95 seen when the base model is correct. For Llama the logit lens is statistically at chance, 0.284 (0.230 to 0.347), while the probe is modestly above chance at 0.365 (0.297 to 0.432). So on exactly the items where RL changes the answer, the base model’s internal representation carries partial but weak linear information about the unlocked answer, well below what a clean unlocking-a-fully-latent-answer account predicts, and for Llama undetectable in the model’s own output basis. This contrasts with cases where an RL-shaped behavior is sharply linear, such as the single refusal direction (Arditi et al., 2024), and it should be read as partial latency, not absence.
5. Discussion and limitations
The honest reading is a bounded negative result. For MMLU multiple choice in Qwen2.5-7B and Llama-3.1-8B, the strong mechanistic form of elicitation, that RL-unlocked answers are already linearly decodable from base mid-layers, does not hold: the answer is legible to the logit lens only late in the network, the mid-layer probe never beats the base model’s own output, and on RL-unlocked items decodability is weak to chance. This is consistent with output and computation being more entangled than a simple readout story allows (Turpin et al., 2023), and it bounds how far the activation-steering successes elsewhere (Li et al., 2023; Zou et al., 2023) generalize to the specific answers post-training changes.
Three limitations shape the scope, and the first is the most important. These base and instruct pairs already answer MMLU at near-instruct accuracy under a good prompt, so post-training unlocks little on this task and the unlocked subset is small and plausibly enriched for genuinely hard or ambiguous items rather than format-gated ones. A task where base models truly fail for format reasons, such as open-ended instruction following or chat-formatted refusal, would be a higher-power testbed and is where the behavioral unlocking literature lives (Zhou et al., 2023; Lin et al., 2023); our result should not be read as evidence against elicitation there. Second, multiple-choice letter decoding measures whether the answer index is recoverable, not whether the model would generate the correct free-form answer, so a null here is compatible with richer latent content that a four-way letter probe cannot see. Third, we used last-token residuals, a fixed prompt, a 256-dimensional probe, and two seven-to-eight billion parameter models, and a trained tuned lens or a larger probe might recover more than the logit lens does, though the probe we ran already had more freedom than the lens and still fell short on the unlocked subset. The unsupervised-latent-knowledge result (Burns et al., 2022) and the linear-truth-geometry result (Marks and Tegmark, 2023) show internal answers can be found in other settings; our finding narrows where that holds.
6. Conclusion
We tested whether the answers RL and instruction tuning unlock are already linearly present in the base model’s mid-layers, using a logit lens and a linear probe on MMLU for two base-instruct pairs. They are only partially: the answer becomes lens-decodable only in the final layers rather than the true middle, the best-layer probe never exceeds the base model’s own output, and on the items RL actually fixes the base model’s internal representation predicts the answer significantly above chance but far below ceiling for Qwen and only modestly above chance for Llama, undetectable to the logit lens there. The result argues against the strong read-out-a-fully-latent-answer account of elicitation for this task, without denying that partial latent content exists, and it points to open-ended, genuinely format-gated tasks as the setting where the unlocking story should be tested with more power (Kadavath et al., 2022; Manakul et al., 2023).
References
- [belrose2023tunedlens] Belrose, Nora and Furman, Zach and Smith, Logan and Halawi, Danny and Ostrovsky, Igor and McKinney, Lev and Biderman, Stella and Steinhardt, Jacob (2023). Eliciting Latent Predictions from Transformers with the Tuned Lens. arXiv:2303.08112.Defines the tuned lens and the logit-lens lineage we use to read mid-layer predictions; the central method of this paper.
- [zhou2023lima] Zhou, Chunting and Liu, Pengfei and Xu, Puxin and Iyer, Srinivasan and Sun, Jiao and Mao, Yuning and Ma, Xuezhe and Efrat, Avia and Yu, Ping and Yu, Lili and others (2023). LIMA: Less Is More for Alignment. arXiv:2305.11206.The superficial-alignment hypothesis: alignment mostly surfaces base knowledge; the claim our decodability test probes mechanistically.
- [lin2023unlocking] Lin, Bill Yuchen and Ravichander, Abhilasha and Lu, Ximing and Dziri, Nouha and Sclar, Melanie and Chandu, Khyathi and Bhagavatula, Chandra and Choi, Yejin (2023). The Unlocking Spell on Base LLMs: Rethinking Alignment via In-Context Learning. arXiv:2312.01552.Argues tuning mainly shifts output style and that base models can be unlocked without weight updates; direct motivation for asking whether the answer is already latent.
- [ouyang2022instructgpt] Ouyang, Long and Wu, Jeffrey and Jiang, Xu and Almeida, Diogo and Wainwright, Carroll and Mishkin, Pamela and Zhang, Chong and Agarwal, Sandhini and Slama, Katarina and Ray, Alex and others (2022). Training language models to follow instructions with human feedback. arXiv:2203.02155.The canonical RLHF post-training pipeline whose "unlocking" effect we examine at the representational level.
- [bai2022hh] Bai, Yuntao and Jones, Andy and Ndousse, Kamal and Askell, Amanda and Chen, Anna and DasSarma, Nova and Drain, Dawn and Fort, Stanislav and Ganguli, Deep and Henighan, Tom and others (2022). Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback. arXiv:2204.05862.Establishes RLHF as the dominant post-training method; context for what "RL-unlocked" means in current instruct models.
- [rafailov2023dpo] Rafailov, Rafael and Sharma, Archit and Mitchell, Eric and Ermon, Stefano and Manning, Christopher D and Finn, Chelsea (2023). Direct Preference Optimization: Your Language Model is Secretly a Reward Model. arXiv:2305.18290.A widely used preference-optimization variant of post-training; part of the family of methods whose mechanism we ask about.
- [burns2022ccs] Burns, Collin and Ye, Haotian and Klein, Dan and Steinhardt, Jacob (2022). Discovering Latent Knowledge in Language Models Without Supervision. arXiv:2212.03827.Latent knowledge can be read from activations unsupervised; the strongest prior that internal states hold answers the output may not surface.
- [marks2023geometry] Marks, Samuel and Tegmark, Max (2023). The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasets. arXiv:2310.06824.Linear decodability of correctness from activations; the methodological template for our linear probe.
- [li2023iti] Li, Kenneth and Patel, Oam and Vi\'egas, Fernanda and Pfister, Hanspeter and Wattenberg, Martin (2023). Inference-Time Intervention: Eliciting Truthful Answers from a Language Model. arXiv:2306.03341.Shows answers can be elicited by intervening on activations; a positive instance of latent-answer recovery that our negative MMLU result bounds.
- [zou2023repe] Zou, Andy and Phan, Long and Chen, Sarah and Campbell, James and Guo, Phillip and Ren, Richard and Pan, Alexander and Yin, Xuwang and Mazeika, Mantas and others (2023). Representation Engineering: A Top-Down Approach to AI Transparency. arXiv:2310.01405.Reads and steers high-level concepts as activation directions; frames decodability as a readout question.
- [kadavath2022know] Kadavath, Saurav and Conerly, Tom and Askell, Amanda and Henighan, Tom and Drain, Dawn and Perez, Ethan and Schiefer, Nicholas and Hatfield-Dodds, Zac and DasSarma, Nova and others (2022). Language Models (Mostly) Know What They Know. arXiv:2207.05221.Models carry internal self-knowledge of correctness; the behavioral analogue to the internal answer signal we probe.
- [arditi2024refusal] Arditi, Andy and Obeso, Oscar and Syed, Aaquib and Paleka, Daniel and Panickssery, Nina and Gurnee, Wes and Nanda, Neel (2024). Refusal in Language Models Is Mediated by a Single Direction. arXiv:2406.11717.A behavior introduced by post-training localizes to a single activation direction; a case where RL-shaped behavior is linearly latent, contrasting our MMLU finding.
- [turpin2023saywhat] Turpin, Miles and Michael, Julian and Perez, Ethan and Bowman, Samuel R (2023). Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Prompting. arXiv:2305.04388.Output can diverge from internal computation; motivates comparing internal decodability against the model's own output.
- [park2023linearrep] Park, Kiho and Choe, Yo Joong and Veitch, Victor (2023). The Linear Representation Hypothesis and the Geometry of Large Language Models. arXiv:2311.03658.Formalizes when concepts are linear directions; grounds our linear-probe and logit-lens decodability metrics.
- [gurnee2023spacetime] Gurnee, Wes and Tegmark, Max (2023). Language Models Represent Space and Time. arXiv:2310.02207.Linear world-feature directions emerge across layers; evidence that some content is linearly present mid-network, which we test for answers.
- [hendrycks2021mmlu] Hendrycks, Dan and Burns, Collin and Basart, Steven and Zou, Andy and Mazeika, Mantas and Song, Dawn and Steinhardt, Jacob (2020). Measuring Massive Multitask Language Understanding. arXiv:2009.03300.The MMLU benchmark we use as the answer-bearing task.
- [manakul2023selfcheck] Manakul, Potsawee and Liusie, Adian and Gales, Mark JF (2023). SelfCheckGPT: Zero-Resource Black-Box Hallucination Detection for Generative Large Language Models. arXiv:2303.08896.Output-level correctness signals; contrast for our internal-state decodability approach.
- [qwen2024report] Yang, An and Yang, Baosong and Zhang, Beichen and Hui, Binyuan and Zheng, Bo and Yu, Bowen and Li, Chengyuan and Liu, Dayiheng and Huang, Fei and Wei, Haoran and others (2024). Qwen2.5 Technical Report. arXiv:2412.15115.Model card for the Qwen2.5-7B base and instruct pair we study.
- [llama2024herd] Dubey, Abhimanyu and Jauhri, Abhinav and Pandey, Abhinav and Kadian, Abhishek and Al-Dahle, Ahmad and Letman, Aiesha and Mathur, Akhil and Schelten, Alan and Yang, Amy and Fan, Angela and others (2024). The Llama 3 Herd of Models. arXiv:2407.21783.Model card for the Llama-3.1-8B base and instruct pair we study.