Key points
KnowRL (Knowledgeable Reinforcement Learning) rewrites the reward rules for slow-thinking, chain-of-thought (CoT) LLMs. Traditional RL/RLHF rewards only the final answer, so models learn that "if the guess is right, the middle can be fabricated" — hallucination becomes a rewarded behavior. KnowRL instead rewards factually grounded reasoning at every step.
The problem
- Slow-thinking models produce long reasoning in
<think>...</think>and answers in<answer>...</answer>, but intermediate steps are full of plausible, unsupported claims. - Outcome-only RL gives no fine-grained factual supervision on the reasoning chain.
r_format: binary reward for correct output structure (+1 / -1).r_correct: judged by an evaluator (GPT-4o-mini class) — correct answer +2, honest abstention +1, wrong answer -1.r_fact: the average verification score over atomic facts.- Total: \(R_{\text{total}} = \alpha r_{\text{format}} + \beta r_{\text{correct}} + \gamma r_{\text{fact}}\), with \(\alpha = \beta = \gamma = 1\). 3. Knowledge Verification (KV) module:
- Decomposition function \(\Phi\) splits the reasoning into \(M\) atomic facts: \(\Phi(o_{\text{think}}) = \{f_1, \dots, f_M\}\) (e.g., "France's capital is Paris, famous for the Eiffel Tower" → two facts).
- Each fact is checked against an external knowledge base \(K\) (Wikipedia, domain databases) — the model's parametric knowledge is *not* treated as ground truth.
- An NLI model (
MoritzLaurer/DeBERTa-v3-base-mnli-fever-anli) judges entailment, yielding a 0–1 score \(v(f_j, K_x)\). - \(r_{\text{fact}}(o) = \frac{1}{M}\sum_{j=1}^{M} v(f_j, K_x)\) when \(M > 0\), else 0. 4. GRPO optimization: group-relative policy optimization with entropy rewards (prevent mode collapse) and KL penalties against the SFT policy (prevent catastrophic forgetting).
- SimpleQA error rate down 20.3% for DeepSeek-R1-Distill-Qwen-7B and 21.4% for Skywork-OR1-7B-Preview.
- GPQA accuracy up from 29.2% to 32.0% (DeepSeek-R1-Distill-Qwen-7B); AIME 2025 slightly improved — reasoning is not sacrificed.
- Ablation: replacing the abstention reward (+1) with a penalty raises SimpleQA error from 28.6% to 44.4% — rewarding "saying I don't know" is a key anti-hallucination mechanism.
- On some reasoning benchmarks,
r_factalone gives the best results: factuality signal itself suppresses "coincidentally correct" answers. - KnowRL outperforms standard RLHF (which favors long, detailed-sounding answers that encourage fabrication) and compares favorably to FLAME-style fine-tuning alignment while preserving reasoning.
- The structured
<think>becomes an auditable trail: each atomic fact can be checked against the knowledge base, supporting debugging, bias research, and compliance. - Bridges the Validation View (accuracy suffices) and Explanation View (need reasons) in medical AI.
- Healthcare: penalize statements contradicting clinical guidelines; produce traceable second-opinion diagnostics with explicit "insufficient evidence" flags.
- Law: punish fabricated citations (the "ghost precedent" problem seen in real court filings); require source-linked references and tags for unverified claims.
- Strong dependence on knowledge-base quality: incomplete or biased sources can mis-teach the model.
- Per-fact retrieval + NLI checking is computationally expensive at scale.
- Compared to RLFact (separate fact-checker) and FLAME (fine-tuning alignment), KnowRL integrates verification directly into the RL loop.
- Future directions: logic-consistency and ethics rewards, dynamically updated knowledge bases, multimodal fact verification, red-teaming/adversarial training, and comprehensive factuality benchmarks.
Method
1. SFT cold start: teach the model the<think>/<answer> output format with structured CoT data.
2. Factuality-guided RL: each rollout is scored by three rewards: