Monte Carlo Tree Search papers, 2023–2026

Key findings

• Monte Carlo Tree Search went from 115 papers in 2023 to 278 in 2026, roughly 2.4x in three years.
• NeurIPS publishes the most Monte Carlo Tree Search work: 302 papers from 2023 to 2026, 39% of the four-venue total.
• The fastest-growing overlap is with AI Agents: papers tagged with both rose from 1 in 2023 to 26 in 2026.
• Among the 5 topics under Games and Planning, it ranks #3 by 2026 paper count; the fastest grower in the group, Classical Planning, is up 3.3x versus 2.4x here.

Representative papers

Spread across years and venues so every edition shows up

• NeurIPS 2026A Regularization-Based Approach to Public Belief State Search for Adversarial Games
• ICML 2026$\alpha$-PFN: Fast Entropy Search via In-Context Learning
• ICLR 2026Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
• CVPR 2026DRS-GUI Dynamic Region Search for Training-Free GUI Grounding
• NeurIPS 2025A Single-Swap Local Search Algorithm for k-Means of Lines
• ICML 2025Accelerating Large Language Model Reasoning via Speculative Search
• ICLR 2025Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methods
• CVPR 2025DyFo: A Training-Free Dynamic Focus Visual Search for Enhancing LMMs in Fine-Grained Visual Understanding
• NeurIPS 2024Speculative Monte-Carlo Tree Search
• ICML 2024Accelerated Speculative Sampling Based on Tree Monte Carlo
• ICLR 2024Chain of Log-Concave Markov Chains
• CVPR 2024Hierarchical Correlation Clustering and Tree Preserving Embedding
• NeurIPS 2023Accelerating Monte Carlo Tree Search with Probability Tree State Abstraction
• ICML 2023A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
• ICLR 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
• CVPR 2023Bridging Search Region Interaction With Template for RGB-T Tracking
• NeurIPS 2026A Revisit of Hamiltonian Monte Carlo Efficiency on Bayesian Neural Networks
• ICML 2026A Bi-metric Framework for Efficient Nearest Neighbor Search
• ICLR 2026Dr.LLM: Dynamic Layer Routing in LLMs
• CVPR 2026UAST Unified Active Search and Tracking for Arbitrary Targets with

All Monte Carlo Tree Search papers

251 papers, page 3 of 6

101. ICML 2026Thinned Mean Field Langevin Dynamics
102. ICML 2026Tree-Structured Orthonormal Decomposition of the Aitchison Simplex
103. ICML 2026Twice Sequential Monte Carlo for Tree Search
104. ICML 2026UnMaskFork: Test-Time Scaling for Masked Diffusion via Deterministic Action Branching
105. ICML 2026Variance Driven Exploration: A Provable and Efficient Methodology for Pure Exploration in Highly Stochastic Environments
106. ICML 2025A General Framework for Inference-time Scaling and Steering of Diffusion Models
107. ICML 2025A Mixture-Based Framework for Guiding Diffusion Models
108. ICML 2025A Physics-Augmented Deep Learning Framework for Classifying Single Molecule Force Spectroscopy Data
109. ICML 2025A Sharper Global Convergence Analysis for Average Reward Reinforcement Learning via an Actor-Critic Approach
110. ICML 2025A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization
111. ICML 2025Accelerating Large Language Model Reasoning via Speculative Search
112. ICML 2025Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching
113. ICML 2025Alpha-SQL: Zero-Shot Text-to-SQL using Monte Carlo Tree Search
114. ICML 2025Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
115. ICML 2025AutoAL: Automated Active Learning with Differentiable Query Strategy Search
116. ICML 2025AutoStep: Locally adaptive involutive MCMC
117. ICML 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
118. ICML 2025Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning
119. ICML 2025Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO*
120. ICML 2025Can We Predict Performance of Large Models across Vision-Language Tasks?
121. ICML 2025CombiMOTS: Combinatorial Multi-Objective Tree Search for Dual-Target Molecule Generation
122. ICML 2025Complete-Tree Space Favors Data-Efficient Link Prediction
123. ICML 2025Conditioning Diffusions Using Malliavin Calculus
124. ICML 2025Deep Electromagnetic Structure Design Under Limited Evaluation Budgets
125. ICML 2025Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger Equation
126. ICML 2025Differential Privacy Guarantees of Markov Chain Monte Carlo Algorithms
127. ICML 2025Efficient Noise Calculation in Deep Learning-based MRI Reconstructions
128. ICML 2025Efficiently Vectorized MCMC on Modern Accelerators
129. ICML 2025EGPlace: An Efficient Macro Placement Method via Evolutionary Search with Greedy Repositioning Guided Mutation
130. ICML 2025Ehrenfeucht-Haussler Rank and Chain of Thought
131. ICML 2025Erwin: A Tree-based Hierarchical Transformer for Large-scale Physical Systems
132. ICML 2025EvoPress: Accurate Dynamic Model Compression via Evolutionary Search
133. ICML 2025Feasible Action Search for Bandit Linear Programs via Thompson Sampling
134. ICML 2025Graph-Based Algorithms for Diverse Similarity Search
135. ICML 2025Importance Corrected Neural JKO Sampling
136. ICML 2025Improving Consistency Models with Generator-Augmented Flows
137. ICML 2025Inverse Problem Sampling in Latent Space Using Sequential Monte Carlo
138. ICML 2025KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search
139. ICML 2025Language Models as Implicit Tree Search
140. ICML 2025Large Language Model-driven Large Neighborhood Search for Large-Scale MILP Problems
141. ICML 2025Learning Extrapolative Sequence Transformations from Markov Chains
142. ICML 2025Linear Mode Connectivity between Multiple Models modulo Permutation Symmetries
143. ICML 2025Low-distortion and GPU-compatible Tree Embeddings in Hyperbolic Space
144. ICML 2025Mastering Board Games by External and Internal Planning with Language Models
145. ICML 2025Monte Carlo Tree Diffusion for System 2 Planning
146. ICML 2025Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design
147. ICML 2025Monte-Carlo Tree Search with Uncertainty Propagation via Optimal Transport
148. ICML 2025Near-Optimal Decision Trees in a SPLIT Second
149. ICML 2025Nested Expectations with Kernel Quadrature
150. ICML 2025NETS: A Non-equilibrium Transport Sampler

FAQ

How many Monte Carlo Tree Search papers were published at NeurIPS, ICLR, ICML and CVPR from 2023 to 2026?

773 in total: 115 in 2023, 144 in 2024, 236 in 2025, 278 in 2026.

How many Monte Carlo Tree Search papers are at NeurIPS 2026?

NeurIPS 2026 has 99 Monte Carlo Tree Search papers, versus 100 the year before.

How many Monte Carlo Tree Search papers are at ICLR 2026?

ICLR 2026 has 60 Monte Carlo Tree Search papers, versus 49 the year before.

How many Monte Carlo Tree Search papers are at ICML 2026?

ICML 2026 has 105 Monte Carlo Tree Search papers, versus 75 the year before.

How many Monte Carlo Tree Search papers are at CVPR 2026?

CVPR 2026 has 14 Monte Carlo Tree Search papers, versus 12 the year before.

Which conference publishes the most Monte Carlo Tree Search papers?

NeurIPS, with 302 papers from 2023 to 2026.