Paper Overview
Research Area: Machine Learning Authors: Peter Belcak, Greg Heinrich, Saurav Muralidharan, Shizhe Diao, Pavlo Molchanov Published: 2026-11-06 arXiv: 2611.09891
Summary
Large language models reinvent the wheel all the time: they conflate task-solving with the execution of the solutions, which forces them to solve every problem from scratch. This paper shows that once a task has been reasoned through, the application of its solution to a new problem instance can be done very efficiently and with little involvement from language models.
The authors introduce agentic reasoning caching (ARC), a method for constructing robust, CPU-executable agentic reasoning caches from LLM reasoning traces. Key properties:
- On-par performance with frontier LLMs across a range of difficult mathematical and scientific tasks
- Fully explainable
- Continually trainable
- Robust to input perturbations
- 16-291x cheaper to invoke than the source model
Abstract
> Large language models reinvent the wheel all the time. They conflate task-solving with the execution of the solutions, which forces them to solve every problem from scratch. We show that once a task has been reasoned through, the application of its solution to a new problem instance can be done very efficiently and with little involvement from language models. We introduce agentic reasoning caching, a method for constructing robust CPU-executable agentic reasoning caches (ARCs) from LLM reasoning traces. ARCs show on-par performance with frontier LLMs across a range of difficult mathematical and scientific tasks, are fully explainable, continually trainable, robust to input perturbations, and 16-291x cheaper to invoke than the source model.
Links: arXiv 2611.09891
*Auto-collected on 2026-11-10*