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

236 papers, page 1 of 5

1. CVPR 2025Cheb-GR: Rethinking K-nearest Neighbor Search in Re-ranking for Person Re-identification
2. CVPR 2025Collaborative Tree Search for Enhancing Embodied Multi-Agent Collaboration
3. CVPR 2025Deep Change Monitoring: A Hyperbolic Representative Learning Framework and a Dataset for Long-term Fine-grained Tree Change Detection
4. CVPR 2025DyFo: A Training-Free Dynamic Focus Visual Search for Enhancing LMMs in Fine-Grained Visual Understanding
5. CVPR 2025GENIUS: A Generative Framework for Universal Multimodal Search
6. CVPR 2025Global-Local Tree Search in VLMs for 3D Indoor Scene Generation
7. CVPR 2025Improving Personalized Search with Regularized Low-Rank Parameter Updates
8. CVPR 2025Learning on Model Weights using Tree Experts
9. CVPR 2025LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table
10. CVPR 2025Subnet-Aware Dynamic Supernet Training for Neural Architecture Search
11. CVPR 2025Training-free Neural Architecture Search through Variance of Knowledge of Deep Network Weights
12. CVPR 2025VasTSD: Learning 3D Vascular Tree-state Space Diffusion Model for Angiography Synthesis
13. ICLR 2025Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methods
14. ICLR 2025BTBS-LNS: Binarized-Tightening, Branch and Search on Learning LNS Policies for MIP
15. ICLR 2025CARTS: Advancing Neural Theorem Proving with Diversified Tactic Calibration and Bias-Resistant Tree Search
16. ICLR 2025Decision Tree Induction Through LLMs via Semantically-Aware Evolution
17. ICLR 2025DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search
18. ICLR 2025DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference
19. ICLR 2025Distance-Based Tree-Sliced Wasserstein Distance
20. ICLR 2025DPaI: Differentiable Pruning at Initialization with Node-Path Balance Principle
21. ICLR 2025Epistemic Monte Carlo Tree Search
22. ICLR 2025ExACT: Teaching AI Agents to Explore with Reflective-MCTS and Exploratory Learning
23. ICLR 2025Fast Summation of Radial Kernels via QMC Slicing
24. ICLR 2025Fast unsupervised ground metric learning with tree-Wasserstein distance
25. ICLR 2025From Isolated Conversations to Hierarchical Schemas: Dynamic Tree Memory Representation for LLMs
26. ICLR 2025Human-Aligned Chess With a Bit of Search
27. ICLR 2025Implicit Search via Discrete Diffusion: A Study on Chess
28. ICLR 2025In Search of Forgotten Domain Generalization
29. ICLR 2025KinFormer: Generalizable Dynamical Symbolic Regression for Catalytic Organic Reaction Kinetics
30. ICLR 2025Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning
31. ICLR 2025Learning Evolving Tools for Large Language Models
32. ICLR 2025Learning to Select Nodes in Branch and Bound with Sufficient Tree Representation
33. ICLR 2025Learning-Augmented Search Data Structures
34. ICLR 2025Linear Mode Connectivity in Differentiable Tree Ensembles
35. ICLR 2025Linear Transformer Topological Masking with Graph Random Features
36. ICLR 2025Monte Carlo Planning with Large Language Model for Text-Based Game Agents
37. ICLR 2025Outlier Synthesis via Hamiltonian Monte Carlo for Out-of-Distribution Detection
38. ICLR 2025Pacmann: Efficient Private Approximate Nearest Neighbor Search
39. ICLR 2025Parameter Expanded Stochastic Gradient Markov Chain Monte Carlo
40. ICLR 2025Procedural Synthesis of Synthesizable Molecules
41. ICLR 2025Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling
42. ICLR 2025Qinco2: Vector Compression and Search with Improved Implicit Neural Codebooks
43. ICLR 2025Rethinking Reward Model Evaluation: Are We Barking up the Wrong Tree?
44. ICLR 2025RuAG: Learned-rule-augmented Generation for Large Language Models
45. ICLR 2025Scalable Decision-Making in Stochastic Environments through Learned Temporal Abstraction
46. ICLR 2025Sequential Controlled Langevin Diffusions
47. ICLR 2025SFS: Smarter Code Space Search improves LLM Inference Scaling
48. ICLR 2025SPaR: Self-Play with Tree-Search Refinement to Improve Instruction-Following in Large Language Models
49. ICLR 2025Spherical Tree-Sliced Wasserstein Distance
50. ICLR 2025Step-by-Step Reasoning for Math Problems via Twisted Sequential Monte Carlo

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.