We study reasoning for accessing world knowledge stored in a language model's parameters. For example, recalling that Canberra is Australia's capital may benefit from thinking through major cities and the concept of purpose-built capitals. While reasoning language models are trained via reinforcement learning to produce reasoning traces on tasks such as mathematics, they may not reason well for accessing their own world knowledge. We first find that models do not generate their best world knowledge reasoning by default: adding a simple "think step-by-step" cue demonstrates statistically significant improvement in knowledge recall but not math. Motivated by this, we propose training models to reason over their parametric knowledge using world-knowledge question answering as a verifiable reward. After reinforcement learning on TriviaQA (+9.9%), performance also improves on Natural Questions, HotpotQA, SimpleQA, and StrategyQA by 4.2%, 2.1%, 0.6%, and 3.0%, respectively. Reasoning models are under-optimized for parametric knowledge access, but can be easily trained to reason better.
Figures & tables
Figure 1: Left: GPT-OSS-20B performance: base vs. with think step-by-step cue vs. post-RLVR. Right: Sample reasoning trace from the post-RLVR model on a Natural Questions example.
Cue?
Reasoning?
TriviaQA
NQ
MATH
GPT-OSS-20B
− Cue
− Reasoning
45.2%
24.6%
25.9%
− Cue
+ Reasoning
60.1%
30.7%
80.9%
+ Cue
+ Reasoning
61.2% ∗
32.0%
80.4%
Olmo-3-7B-Think
− Cue
− Reasoning
41.4%
23.1%
71.6%
Table 1: Performance across datasets and models with and without the think step-by-step cue and reasoning tokens. NQ = Natural Questions. + denotes presence and − denotes absence. Ex-Recall for TriviaQA and NQ; accuracy for MATH. ∗ indicates the difference between + Cue + Reasoning and − Cue + Reasoning is statistically significant at the 95% level by McNemar’s test ( McNemar, 1947 ) .
TriviaQA
NQ
HotpotQA
SimpleQA
StrategyQA
Model
Metric
Base
EM
36.5
6.0
7.5
1.8
71.5
Ex-Recall
60.1
30.7
25.5
3.5
–
Reasoning-SFT
EM
38.8
6.1
7.3
1.9
72.5
Ex-Recall
63.8
31.5
26.0
4.0
–
RL-trained (ours)
EM
63.6 ∗
18.2 ∗
17.0 ∗
3.3 ∗
74.5 ∗
Table 2: GPT-OSS-20B performance before and after RL training on knowledge recall tasks. For our RL-trained model, ∗ indicates the improvement over the base model is statistically significant at the 95% level by McNemar’s test.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Dataset
Example
TriviaQA
Q: In which country was the first permanent bungee jumping site situated?
A: New Zealand
Natural Questions
Q: When was Harry Potter and the Philosopher’s Stone published?
A: 1997
MATH
Q: If (2x+5)(x−3)=14 , find the sum of the possible values of x .
A: 21
Appendix
Table 3: Example questions and answers from each dataset.
Model
Temperature
Top- p
DeepSeek-R1-Distill-Qwen-1.5B
0.6
0.95
Olmo-3-7B-Think
0.6
0.95
GPT-OSS-20B
1.0
1.0
Appendix
Table 4: Decoding hyperparameters used for each model.
Model
Metric
TriviaQA
NQ
HotpotQA
SimpleQA
StrategyQA
RL-trained (no-cues)
EM
63.6
18.2
17.0
3.3
74.5
Ex-Recall
70.0
34.9
27.6
4.1
–
RL-trained (with-cues)
EM
62.1
15.1
14.6
3.1
74.3
Ex-Recall
70.6
36.5
28.2
4.2
–
Delta
EM
-1.5 ∗
-3.1 ∗
-2.4 ∗
-0.2
-0.2
Ex-Recall
+0.6 ∗
+1.6 ∗
+0.6
+0.1
–
Appendix
Table 5: GPT-OSS-20B performance after RL training with and without the think step-by-step cue on knowledge access datasets. ∗ indicates the delta is statistically significant at the 95% level by McNemar’s test.
Cue?
Reasoning?
Accuracy
Base
− Cue
+ Reasoning
80.9%
+ Cue
+ Reasoning
80.4%
RL-trained
− Cue
+ Reasoning
83.9%
+ Cue
+ Reasoning
80.4%
Appendix
Table 6: GPT-OSS-20B accuracy on MATH before and after RL training. A statistically significant improvement is observed in the no-cue setting (p < 0.05) by McNemar’s test.
Dataset
Model
Avg.
Recalled
Non-Recalled
TriviaQA
Base
94.11
41.04
174.13
SFT
103.66
46.45
204.60
RL
106.71
55.41
226.66
RL+cues
118.65
62.02
254.88
NQ
Base
90.56
44.70
110.93
SFT
94.60
46.38
116.77
Appendix
Table 7: Average thinking token length across datasets for GPT-OSS-20B variants. SFT here refers to Reasoning-SFT.
Reinforcement learning (RL) is often credited with improving language model reasoning at the expense of knowledge. We challenge this narrative by showing that reasoning models consistently outperform their instruction-tuned versions on pure knowledge recall tasks. These gains do not reflect newly acquired information, but rather an improved procedural skill in navigating and searching existing knowledge hierarchies within the model parameters. Structured prompting, which explicitly guides models through hierarchical traversal -- recovers most of the instruct-reasoning gap across five model families. A controlled RL experiment on unseen, non-extractable facts improves recall of held-out frequent but previously inaccessible facts, ruling out simple data exposure. On depth-stratified retrieval tasks, reasoning models exhibit superior traversal as retrieval depth grows. Layerwise activation analysis further shows that while factual representations maintain high cosine similarity between instruct and reasoning models, query representations diverge noticeably, indicating that reasoning primarily reshapes how models traverse knowledge rather than the knowledge representation itself. Finally, we find that distilled models often fail to match reasoning models on knowledge recall because they imitate self-correction without acquiring the exploratory behavior needed for hierarchical navigation. Together, these findings suggest that improving factual recall in LLMs depends not only on expanding what models know but also on teaching them to navigate it -- motivating future post-training methods that optimize traversal.
Renfei Zhang, Manasa Kaniselvan, Rylan Schaeffer abd Niloofar Mireshghallah
Carnegie Mellon University · MIT · Stanford University
Reinforcement learning (RL) has achieved remarkable success in LLM reasoning, but whether it can also improve direct recall of parametric knowledge remains an open question. We study this question in a controlled zero-shot, one-hop, closed-book QA setting with no chain-of-thought, training only on binary correctness rewards and applying fact-level train-test deduplication to ensure gains reflect improved recall rather than reasoning or memorization. Across three model families and multiple factual QA benchmarks, RL yields ~27% average relative gains, surpassing both training- and inference-time baselines alike. Mechanistically, RL primarily redistributes probability mass over existing knowledge rather than acquiring new facts, moving correct answers from the low-probability tail into reliable greedy generations. Our data-attribution study reveals that the hardest examples are the most informative: those whose answers never appear in 128 pre-RL samples (only ~18% of training data) drive ~83% of the gain, since rare correct rollouts still emerge during training and get reinforced. Together, these findings broaden the role of RL beyond reasoning, repositioning it as a tool for unlocking rather than acquiring latent parametric knowledge.
Wanli Yang, Hongyu Zang, Junwei Zhang +5
University of Chinese Academy of Sciences · State Key Laboratory of AI Safety, Institute of Computing Technology, CAS
While reasoning in LLMs plays a natural role in math, code generation, and multi-hop factual questions, its effect on simple, single-hop factual questions remains unclear. Such questions do not require step-by-step logical decomposition, making the utility of reasoning highly counterintuitive. Nevertheless, we find that enabling reasoning substantially expands the capability boundary of the model's parametric knowledge recall, unlocking correct answers that are otherwise effectively unreachable. Why does reasoning aid parametric knowledge recall when there are no complex reasoning steps to be done? To answer this, we design a series of hypothesis-driven controlled experiments, and identify two key driving mechanisms: (1) a computational buffer effect, where the model uses the generated reasoning tokens to perform latent computation independent of their semantic content; and (2) factual priming, where generating topically related facts acts as a semantic bridge that facilitates correct answer retrieval. Importantly, this latter generative self-retrieval mechanism carries inherent risks: we demonstrate that hallucinating intermediate facts during reasoning increases the likelihood of hallucinations in the final answer. Finally, we show that our insights can be harnessed to directly improve model accuracy by prioritizing reasoning trajectories that contain hallucination-free factual statements.
Zorik Gekhman, Roee Aharoni, Eran Ofek +3
Google Research · Technion - Israel Institute of Technology · Tel Aviv University