mlsanityData to 7 Oct 2026

Boosting MCTS with Free Energy Minimization

arXiv 2501.13083 ↗First posted 22 Jan 2025cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Active Inference, grounded in the Free Energy Principle, provides a powerful lens for understanding how agents balance exploration and goal-directed behavior in uncertain environments. Here, we propose a new planning framework, that integrates Monte Carlo Tree Search (MCTS) with active inference objectives to systematically reduce epistemic uncertainty while pursuing extrinsic rewards. Our key insight is that MCTS already renowned for its search efficiency can be naturally extended to incorporate free energy minimization by blending expected rewards with information gain. Concretely, the Cross-Entropy Method (CEM) is used to optimize action proposals at the root node, while tree expansions leverage reward modeling alongside intrinsic exploration bonuses. This synergy allows our planner to maintain coherent estimates of value and uncertainty throughout planning, without sacrificing computational tractability. Empirically, we benchmark our planner on a diverse set of continuous control tasks, where it demonstrates performance gains over both standalone CEM and MCTS with random rollouts.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 33 references that are in the map. First posted on arXiv 22 Jan 2025.

Builds on

10 of 33 references.

References · 10

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  2. 2018Learning Latent Dynamics for Planning from Pixelscited by 1,221
  3. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  4. 2017Deep Bayesian Active Learning with Image Datacited by 812
  5. 2018Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Modelscited by 748
  6. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  7. 2020Deep active inference agents using Monte-Carlo methodscited by 72
  8. 2019Deep Active Inference as Variational Policy Gradientscited by 52
  9. 2020Reinforcement Learning through Active Inferencecited by 47
  10. 2021Branching Time Active Inference: the theory and its generalitycited by 15

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Active Inference as a Convex Markov Decision Process
  2. 2019Bayesian policy selection using active inference
  3. 2026SGA-MCTS: Decoupling Planning from Execution via Training-Free Atomic Experience Retrieval
  4. 2024Demonstrating the Continual Learning Capabilities and Practical Application of Discrete-Time Active Inference
  5. 2024Enhancing Reinforcement Learning Through Guided Search
  6. 2025Deep Active Inference with Diffusion Policy and Multiple Timescale World Model for Real-World Exploration and Navigation
  7. 2026ProAct: Agentic Lookahead in Interactive Environments
  8. 2021Online reinforcement learning with sparse rewards through an active inference capsule