Base Models Can Reason By Taking a Cue From Training Data
cs.LG, cs.AI, cs.CL
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: Project page: https://www.sophielwang.com/cues Code: https://github.com/sophicle/cues
Code: https://github.com/sophicle/cues
Project page: https://www.sophielwang.com/cues
License: http://creativecommons.org/licenses/by/4.0/
The gist: In this paper, we study how training data creates associations between the tokens at the start of a base model's response and the reasoning behavior that follows.
Abstract
In this paper, we study how training data creates associations between the tokens at the start of a base model's response and the reasoning behavior that follows. First, we demonstrate that fixing particular starting token cues makes a base model's performance competitive with that of its reinforcement learning (RL)-trained counterparts on math and coding. For instance, the cue ". " raises Olmo-3-7B's MATH-500 pass@1 accuracy from 42% to 78%, while "Alright," raises Qwen3-14B's from 72% to 87%. Second, RL makes these cues more likely, while fixing them recovers much of its performance gain over the base model. Third, we trace the reasoning effects of token cues to the training data. We perform causal data interventions to turn an arbitrary word, such as "chicken", into an effective reasoning cue, or remove an existing cue's effect. A similar edit makes the prompt instruction "Think duck duck goose" as effective as "Think step by step" at eliciting reasoning. We also find that the hidden state representations induced by different cues correlate with different document types from the training set. Finally, we extend our study of token cues with a case study in language model safety, finding that different cues elicit distinct refusal and compliance behaviors that correspond to different types of training data.
Sources
- Evaluating Large Language Models Trained on Code
- Training Verifiers to Solve Math Word Problems
- The Llama 3 Herd of Models
- Studying Large Language Model Generalization with Influence Functions
- CTRL: A Conditional Transformer Language Model for Controllable Generation
- Adam: A Method for Stochastic Optimization
- Olmo 3
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- The Truth Lies Somewhere in the Middle (of the Generated Tokens)
- OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling
- Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement
- Qwen3 Technical Report
- Universal and Transferable Adversarial Attacks on Aligned Language Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks