mlsanityData to 7 Oct 2026

Combining Q-Learning and Search with Amortized Value Estimates

arXiv 1912.02807 ↗First posted 5 Dec 2019cs.LG stat.MLcited by 19

Not on the map. Why?

Abstract (arXiv)

We introduce "Search with Amortized Value Estimates" (SAVE), an approach for combining model-free Q-learning with model-based Monte-Carlo Tree Search (MCTS). In SAVE, a learned prior over state-action values is used to guide MCTS, which estimates an improved set of state-action values. The new Q-estimates are then used in combination with real experience to update the prior. This effectively amortizes the value computation performed by MCTS, resulting in a cooperative relationship between model-free learning and model-based search. SAVE can be implemented on top of any Q-learning agent with access to a model, which we demonstrate by incorporating it into agents that perform challenging physical reasoning tasks and Atari. SAVE consistently achieves higher rewards with fewer training steps, and---in contrast to typical model-based search approaches---yields strong performance with very small search budgets. By combining real experience with information computed during search, SAVE demonstrates that it is possible to improve on both the performance of model-free learning and the computational cost of planning.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Dec 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 4; 2023: 2; 2024: 5; 2025: 0; 2026: 3.

19 papers.

Sort:

By area:

  1. 2023Cognitive Architectures for Language Agentscited by 422
  2. 2021Muesli: Combining Improvements in Policy Optimizationcited by 53
  3. 2021Scalable Online Planning via Reinforcement Learning Fine-Tuningcited by 18
  4. 2021Evaluating model-based planning and planner amortization for continuous controlcited by 15
  5. 2023Imitating Graph-Based Planning with Goal-Conditioned Policiescited by 13
  6. 2022Personalized Algorithmic Recourse with Preference Elicitationcited by 9
  7. 2022Efficient Offline Policy Optimization with a Learned Modelcited by 8
  8. 2024A Survey Analyzing Generalization in Deep Reinforcement Learningcited by 8
  9. 2022Graph-based Reinforcement Learning meets Mixed Integer Programs: An application to 3D robot assembly discoverycited by 5
  10. 2024Physics-Aware Combinatorial Assembly Sequence Planning using Data-free Action Maskingcited by 5
  11. 2024Decision Making in Non-Stationary Environments with Policy-Augmented Searchcited by 4
  12. 2021Planning and Learning Using Adaptive Entropy Tree Searchcited by 3
7 more
  1. 2021First-Order Problem Solving through Neural MCTS based Reinforcement Learningcited by 2
  2. 2026Finding the Time to Think: Learning Planning Budgets in Real-Time RLcited by 2
  3. 2026Counteractive RL: Rethinking Core Principles for Efficient and Scalable Deep Reinforcement Learningcited by 1
  4. 2022Assessing Policy, Loss and Planning Combinations in Reinforcement Learning using a New Modular Architecturecited by 0
  5. 2024Online design of dynamic networkscited by 0
  6. 2024Improve Value Estimation of Q Function and Reshape Reward with Monte Carlo Tree Searchcited by 0
  7. 2026TabQL: In-Context Q-Learning with Tabular Foundation Modelscited by 0