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

773 papers, page 8 of 16

351. ICML 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
352. ICML 2025Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning
353. ICML 2025Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO*
354. ICML 2025Can We Predict Performance of Large Models across Vision-Language Tasks?
355. ICML 2025CombiMOTS: Combinatorial Multi-Objective Tree Search for Dual-Target Molecule Generation
356. ICML 2025Complete-Tree Space Favors Data-Efficient Link Prediction
357. ICML 2025Conditioning Diffusions Using Malliavin Calculus
358. ICML 2025Deep Electromagnetic Structure Design Under Limited Evaluation Budgets
359. ICML 2025Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger Equation
360. ICML 2025Differential Privacy Guarantees of Markov Chain Monte Carlo Algorithms
361. ICML 2025Efficient Noise Calculation in Deep Learning-based MRI Reconstructions
362. ICML 2025Efficiently Vectorized MCMC on Modern Accelerators
363. ICML 2025EGPlace: An Efficient Macro Placement Method via Evolutionary Search with Greedy Repositioning Guided Mutation
364. ICML 2025Ehrenfeucht-Haussler Rank and Chain of Thought
365. ICML 2025Erwin: A Tree-based Hierarchical Transformer for Large-scale Physical Systems
366. ICML 2025EvoPress: Accurate Dynamic Model Compression via Evolutionary Search
367. ICML 2025Feasible Action Search for Bandit Linear Programs via Thompson Sampling
368. ICML 2025Graph-Based Algorithms for Diverse Similarity Search
369. ICML 2025Importance Corrected Neural JKO Sampling
370. ICML 2025Improving Consistency Models with Generator-Augmented Flows
371. ICML 2025Inverse Problem Sampling in Latent Space Using Sequential Monte Carlo
372. ICML 2025KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search
373. ICML 2025Language Models as Implicit Tree Search
374. ICML 2025Large Language Model-driven Large Neighborhood Search for Large-Scale MILP Problems
375. ICML 2025Learning Extrapolative Sequence Transformations from Markov Chains
376. ICML 2025Linear Mode Connectivity between Multiple Models modulo Permutation Symmetries
377. ICML 2025Low-distortion and GPU-compatible Tree Embeddings in Hyperbolic Space
378. ICML 2025Mastering Board Games by External and Internal Planning with Language Models
379. ICML 2025Monte Carlo Tree Diffusion for System 2 Planning
380. ICML 2025Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design
381. ICML 2025Monte-Carlo Tree Search with Uncertainty Propagation via Optimal Transport
382. ICML 2025Near-Optimal Decision Trees in a SPLIT Second
383. ICML 2025Nested Expectations with Kernel Quadrature
384. ICML 2025NETS: A Non-equilibrium Transport Sampler
385. ICML 2025Neural Event-Triggered Control with Optimal Scheduling
386. ICML 2025Neural Genetic Search in Discrete Spaces
387. ICML 2025Neural Guided Diffusion Bridges
388. ICML 2025Non-asymptotic Error Bounds in $\mathcal{W}_2$-Distance with Sqrt(d) Dimension Dependence and First Order Convergence for Langevin Monte Carlo beyond Log-Concavity
389. ICML 2025On the Power of Learning-Augmented Search Trees
390. ICML 2025Online Robust Reinforcement Learning Through Monte-Carlo Planning
391. ICML 2025Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
392. ICML 2025Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
393. ICML 2025Policy Gradient with Tree Expansion
394. ICML 2025Power Mean Estimation in Stochastic Continuous Monte-Carlo Tree Search
395. ICML 2025Progressive Tempering Sampler with Diffusion
396. ICML 2025Protriever: End-to-End Differentiable Protein Homology Search for Fitness Prediction
397. ICML 2025QLASS: Boosting Language Agent Inference via Q-Guided Stepwise Search
398. ICML 2025Re-ranking Reasoning Context with Tree Search Makes Large Vision-Language Models Stronger
399. ICML 2025Revisiting Non-Acyclic GFlowNets in Discrete Environments
400. ICML 2025Runtime Analysis of Evolutionary NAS for Multiclass Classification

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.