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

144 papers, page 3 of 3

101. NeurIPS 2024Efficient Centroid-Linkage Clustering
102. NeurIPS 2024einspace: Searching for Neural Architectures from Fundamental Operations
103. NeurIPS 2024Evidence of Learned Look-Ahead in a Chess-Playing Neural Network
104. NeurIPS 2024Fearless Stochasticity in Expectation Propagation
105. NeurIPS 2024Generalization Error Bounds for Two-stage Recommender Systems with Tree Structure
106. NeurIPS 2024Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search
107. NeurIPS 2024Global Rewards in Restless Multi-Armed Bandits
108. NeurIPS 2024Hamiltonian Monte Carlo Inference of Marginalized Linear Mixed-Effects Models
109. NeurIPS 2024Hamiltonian Monte Carlo on ReLU Neural Networks is Inefficient
110. NeurIPS 2024HW-GPT-Bench: Hardware-Aware Architecture Benchmark for Language Models
111. NeurIPS 2024Inferring stochastic low-rank recurrent neural networks from neural data
112. NeurIPS 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning
113. NeurIPS 2024Learning to be Smooth: An End-to-End Differentiable Particle Smoother
114. NeurIPS 2024Linear Time Approximation Algorithm for Column Subset Selection with Local Search
115. NeurIPS 2024Long-range Meta-path Search on Large-scale Heterogeneous Graphs
116. NeurIPS 2024MambaTree: Tree Topology is All You Need in State Space Model
117. NeurIPS 2024Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization
118. NeurIPS 2024Monte Carlo Tree Search based Space Transfer for Black Box Optimization
119. NeurIPS 2024Multi-times Monte Carlo Rendering for Inter-reflection Reconstruction
120. NeurIPS 2024Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
121. NeurIPS 2024Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations
122. NeurIPS 2024No-Regret Bandit Exploration based on Soft Tree Ensemble Model
123. NeurIPS 2024Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation
124. NeurIPS 2024Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
125. NeurIPS 2024On Neural Networks as Infinite Tree-Structured Probabilistic Graphical Models
126. NeurIPS 2024On the Expressive Power of Tree-Structured Probabilistic Circuits
127. NeurIPS 2024Particle Semi-Implicit Variational Inference
128. NeurIPS 2024Quadratic Quantum Variational Monte Carlo
129. NeurIPS 2024ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search
130. NeurIPS 2024RoPINN: Region Optimized Physics-Informed Neural Networks
131. NeurIPS 2024S-MolSearch: 3D Semi-supervised Contrastive Learning for Bioactive Molecule Search
132. NeurIPS 2024Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs
133. NeurIPS 2024Search for Efficient Large Language Models
134. NeurIPS 2024SeeA*: Efficient Exploration-Enhanced A* Search by Selective Sampling
135. NeurIPS 2024Speculative Monte-Carlo Tree Search
136. NeurIPS 2024SPO: Sequential Monte Carlo Policy Optimisation
137. NeurIPS 2024The Poisson Midpoint Method for Langevin Dynamics: Provably Efficient Discretization for Diffusion Models
138. NeurIPS 2024The tree autoencoder model, with application to hierarchical data visualization
139. NeurIPS 2024Thought of Search: Planning with Language Models Through The Lens of Efficiency
140. NeurIPS 2024Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing
141. NeurIPS 2024TreeVI: Reparameterizable Tree-structured Variational Inference for Instance-level Correlation Capturing
142. NeurIPS 2024Weak-to-Strong Search: Align Large Language Models via Searching over Small Language Models
143. NeurIPS 2024When LLM Meets DRL: Advancing Jailbreaking Efficiency via DRL-guided Search
144. NeurIPS 2024Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusion

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.