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

75 papers, page 2 of 2

51. ICML 2025Online Robust Reinforcement Learning Through Monte-Carlo Planning
52. ICML 2025Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
53. ICML 2025Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
54. ICML 2025Policy Gradient with Tree Expansion
55. ICML 2025Power Mean Estimation in Stochastic Continuous Monte-Carlo Tree Search
56. ICML 2025Progressive Tempering Sampler with Diffusion
57. ICML 2025Protriever: End-to-End Differentiable Protein Homology Search for Fitness Prediction
58. ICML 2025QLASS: Boosting Language Agent Inference via Q-Guided Stepwise Search
59. ICML 2025Re-ranking Reasoning Context with Tree Search Makes Large Vision-Language Models Stronger
60. ICML 2025Revisiting Non-Acyclic GFlowNets in Discrete Environments
61. ICML 2025Runtime Analysis of Evolutionary NAS for Multiclass Classification
62. ICML 2025RZ-NAS: Enhancing LLM-guided Neural Architecture Search via Reflective Zero-Cost Strategy
63. ICML 2025Sampling Binary Data by Denoising through Score Functions
64. ICML 2025Sampling from Binary Quadratic Distributions via Stochastic Localization
65. ICML 2025Secant Line Search for Frank-Wolfe Algorithms
66. ICML 2025Solving Linear-Gaussian Bayesian Inverse Problems with Decoupled Diffusion Sequential Monte Carlo
67. ICML 2025Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs
68. ICML 2025Subgoal-Guided Policy Heuristic Search with Learned Subgoals
69. ICML 2025The Polynomial Stein Discrepancy for Assessing Moment Convergence
70. ICML 2025Tree-Sliced Wasserstein Distance with Nonlinear Projection
71. ICML 2025Tree-Sliced Wasserstein Distance: A Geometric Perspective
72. ICML 2025Trust-Region Twisted Policy Improvement
73. ICML 2025Tuning Sequential Monte Carlo Samplers via Greedy Incremental Divergence Minimization
74. ICML 2025UltraTWD: Optimizing Ultrametric Trees for Tree-Wasserstein Distance
75. ICML 2025Variational Phylogenetic Inference with Products over Bipartitions

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.