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

27 papers, page 1 of 1

1. ICLR 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
2. ICLR 2023A Self-Attention Ansatz for Ab-initio Quantum Chemistry
3. ICLR 2023A Simple Approach for Visual Room Rearrangement: 3D Mapping and Semantic Search
4. ICLR 2023A Simple Yet Powerful Deep Active Learning With Snapshots Ensembles
5. ICLR 2023Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time
6. ICLR 2023Analyzing Tree Architectures in Ensembles via Neural Tangent Kernel
7. ICLR 2023Approximate Nearest Neighbor Search through Modern Error-Correcting Codes
8. ICLR 2023AutoGT: Automated Graph Transformer Architecture Search
9. ICLR 2023Automating Nearest Neighbor Search Configuration with Constrained Optimization
10. ICLR 2023Average Sensitivity of Decision Tree Learning
11. ICLR 2023Characterizing intrinsic compositionality in transformers with Tree Projections
12. ICLR 2023Critic Sequential Monte Carlo
13. ICLR 2023DamoFD: Digging into Backbone Design on Face Detection
14. ICLR 2023Denoising Diffusion Samplers
15. ICLR 2023Diffusion Probabilistic Modeling of Protein Backbones in 3D for the motif-scaffolding problem
16. ICLR 2023EA-HAS-Bench: Energy-aware Hyperparameter and Architecture Search Benchmark
17. ICLR 2023Efficient Offline Policy Optimization with a Learned Model
18. ICLR 2023Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search
19. ICLR 2023Improving Deep Policy Gradients with Value Function Search
20. ICLR 2023Improving Differentiable Neural Architecture Search by Encouraging Transferability
21. ICLR 2023Learning Structured Representations by Embedding Class Hierarchy
22. ICLR 2023PowerQuant: Automorphism Search for Non-Uniform Quantization
23. ICLR 2023Sparse tree-based Initialization for Neural Networks
24. ICLR 2023Summarization Programs: Interpretable Abstractive Summarization with Neural Modular Trees
25. ICLR 2023Symbolic Physics Learner: Discovering governing equations via Monte Carlo tree search
26. ICLR 2023The Dark Side of AutoML: Towards Architectural Backdoor Search
27. ICLR 2023ZiCo: Zero-shot NAS via inverse Coefficient of Variation on Gradients

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.