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

59 papers, page 1 of 2

1. NeurIPS 20243D Gaussian Splatting as Markov Chain Monte Carlo
2. NeurIPS 2024Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
3. NeurIPS 2024Advancing Tool-Augmented Large Language Models: Integrating Insights from Errors in Inference Trees
4. NeurIPS 2024AlphaMath Almost Zero: Process Supervision without Process
5. NeurIPS 2024An engine not a camera: Measuring performative power of online search
6. NeurIPS 2024Automated Efficient Estimation using Monte Carlo Efficient Influence Functions
7. NeurIPS 2024Beyond Accuracy: Tracking more like Human via Visual Search
8. NeurIPS 2024Binary Search with Distributional Predictions
9. NeurIPS 2024CE-NAS: An End-to-End Carbon-Efficient Neural Architecture Search Framework
10. NeurIPS 2024Compositional Generalization Across Distributional Shifts with Sparse Tree Operations
11. NeurIPS 2024Conditional Density Estimation with Histogram Trees
12. NeurIPS 2024Constrained Sampling with Primal-Dual Langevin Monte Carlo
13. NeurIPS 2024CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search
14. NeurIPS 2024Customized Subgraph Selection and Encoding for Drug-drug Interaction Prediction
15. NeurIPS 2024Divide-and-Conquer Posterior Sampling for Denoising Diffusion priors
16. NeurIPS 2024Efficient Centroid-Linkage Clustering
17. NeurIPS 2024einspace: Searching for Neural Architectures from Fundamental Operations
18. NeurIPS 2024Evidence of Learned Look-Ahead in a Chess-Playing Neural Network
19. NeurIPS 2024Fearless Stochasticity in Expectation Propagation
20. NeurIPS 2024Generalization Error Bounds for Two-stage Recommender Systems with Tree Structure
21. NeurIPS 2024Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search
22. NeurIPS 2024Global Rewards in Restless Multi-Armed Bandits
23. NeurIPS 2024Hamiltonian Monte Carlo Inference of Marginalized Linear Mixed-Effects Models
24. NeurIPS 2024Hamiltonian Monte Carlo on ReLU Neural Networks is Inefficient
25. NeurIPS 2024HW-GPT-Bench: Hardware-Aware Architecture Benchmark for Language Models
26. NeurIPS 2024Inferring stochastic low-rank recurrent neural networks from neural data
27. NeurIPS 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning
28. NeurIPS 2024Learning to be Smooth: An End-to-End Differentiable Particle Smoother
29. NeurIPS 2024Linear Time Approximation Algorithm for Column Subset Selection with Local Search
30. NeurIPS 2024Long-range Meta-path Search on Large-scale Heterogeneous Graphs
31. NeurIPS 2024MambaTree: Tree Topology is All You Need in State Space Model
32. NeurIPS 2024Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization
33. NeurIPS 2024Monte Carlo Tree Search based Space Transfer for Black Box Optimization
34. NeurIPS 2024Multi-times Monte Carlo Rendering for Inter-reflection Reconstruction
35. NeurIPS 2024Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
36. NeurIPS 2024Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations
37. NeurIPS 2024No-Regret Bandit Exploration based on Soft Tree Ensemble Model
38. NeurIPS 2024Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation
39. NeurIPS 2024Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
40. NeurIPS 2024On Neural Networks as Infinite Tree-Structured Probabilistic Graphical Models
41. NeurIPS 2024On the Expressive Power of Tree-Structured Probabilistic Circuits
42. NeurIPS 2024Particle Semi-Implicit Variational Inference
43. NeurIPS 2024Quadratic Quantum Variational Monte Carlo
44. NeurIPS 2024ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search
45. NeurIPS 2024RoPINN: Region Optimized Physics-Informed Neural Networks
46. NeurIPS 2024S-MolSearch: 3D Semi-supervised Contrastive Learning for Bioactive Molecule Search
47. NeurIPS 2024Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs
48. NeurIPS 2024Search for Efficient Large Language Models
49. NeurIPS 2024SeeA*: Efficient Exploration-Enhanced A* Search by Selective Sampling
50. NeurIPS 2024Speculative Monte-Carlo Tree Search

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.