Skip to content
Preprint

ThinkRetrieve: Retrieval-Augmented Reasoning Traces for Test-Time Scaling

Aug 2026 · 0 citations · 48 references
Computer Science

TL;DR

ThinkRetrieve is proposed, a test-time scaling framework that augments the reasoning traces of LRMs with dynamically retrieved solved examples at each reasoning step, providing the model with guidance on how to reason rather than merely what facts are relevant.

Abstract

Large Reasoning Models (LRMs) improve performance by allocating additional inference-time compute to generate extended chain-of-thought reasoning. However, recent studies reveal that sequential test-time scaling often yields diminishing or even negative returns, as longer traces exhibit increased uncertainty, error compounding, and drift from the original problem. We propose ThinkRetrieve, a test-time scaling framework that augments the reasoning traces of LRMs with dynamically retrieved solved examples at each reasoning step. Given an external corpus of problems paired with step-by-step solutions, ThinkRetrieve retrieves relevant exemplars at each intermediate step and injects them directly into the thinking trace, providing the model with guidance on how to reason rather than merely what facts are relevant. Experiments across five reasoning models (1.5B--8B parameters) on GSM-8K, MATH-500, AIME 2025, and SciQ demonstrate that ThinkRetrieve consistently improves accuracy over standard test-time scaling, with relative gains of up to $60\%$ on AIME 2025.

View source

Similar papers

Preprint Aug 2026

Memory Augmentation Unlocks Efficient Chain-of-Thought Reasoning

Memory-Augmented Compression is proposed, a training-free framework that constructs reusable reasoning memories from historical traces and retrieves them as prefill-side scaffolds to compensate for information lost during compression.

Si-Meng Zhang, Yi-Long Chen, Wenyuan Zhang et al. · 0 citations
Preprint Aug 2026

Shorter Reasoning, Earlier Answers? An Evaluation of Reasoning Interfaces

Paired runs of the same question at matched reasoning horizons across 198 GPQA Diamond and 500 MMLU-Pro questions are evaluated, finding that a tight deadline can favor lower effort or a concise instruction, whereas allowing high effort to finish can recover higher final accuracy.

Francesca Carlon, Vincent Ginis, A. Algaba · 0 citations
2025

Evaluating the Inductive Abilities of Large Language Models: Why Chain-of-Thought Reasoning Sometimes Hurts More Than Helps

This work presents a theoretical framework that reveals how reasoning steps can amplify error through three failure modes: incorrect sub-task decomposition, incorrect sub-task solving, and incorrect final answer summarization, and introduces structured interventions that adapt CoT generation according to the identified...

Haibo Jin, Peiyan Zhang, Man Luo et al. · 1 citation
Jul 2026

OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping

OS-Pruner is a lightweight plug-in framework that formulates chain-of-thought pruning as an optimal stopping problem that achieves 20-60\% reduction in generation length with minimal accuracy sacrifice on diverse reasoning benchmarks and base models.

Mohammed Ehab, Aymane El Gadarri, Vivek F. Farias et al. · 0 citations

Reasoning Error from Known Fact: Step-Level Self-Consistency Group Relative Policy Optimization for LLM

This work conducts a fine-grained analysis of hallucinations arising in LLM reasoning and finds that the reasoning traces are particularly prone to Context-Sensitive Factual Hallucinations: cases where the model actually has the relevant knowledge, yet makes factual errors due to contextual interference during reasonin...

Xiaomeng Hu, Jiaqi Hu, Hao Chen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.