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

251 papers, page 5 of 6

201. ICML 2024Integrated Hardware Architecture and Device Placement Search
202. ICML 2024Iterative Search Attribution for Deep Neural Networks
203. ICML 2024Kernel Semi-Implicit Variational Inference
204. ICML 2024Language Agent Tree Search Unifies Reasoning, Acting, and Planning in Language Models
205. ICML 2024Listening to the noise: Blind Denoising with Gibbs Diffusion
206. ICML 2024MD tree: a model-diagnostic tree grown on loss landscape
207. ICML 2024Neural Tangent Kernels for Axis-Aligned Tree Ensembles
208. ICML 2024Online Variational Sequential Monte Carlo
209. ICML 2024Parallel Affine Transformation Tuning of Markov Chain Monte Carlo
210. ICML 2024Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
211. ICML 2024Practical Hamiltonian Monte Carlo on Riemannian Manifolds via Relativity Theory
212. ICML 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo
213. ICML 2024Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
214. ICML 2024Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization
215. ICML 2024Quasi-Monte Carlo Features for Kernel Approximation
216. ICML 2024Reinforcement Learning within Tree Search for Fast Macro Placement
217. ICML 2024Resisting Stochastic Risks in Diffusion Planners with the Trajectory Aggregation Tree
218. ICML 2024Sliced Wasserstein with Random-Path Projecting Directions
219. ICML 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates
220. ICML 2024Tilt your Head: Activating the Hidden Spatial-Invariance of Classifiers
221. ICML 2024tnGPS: Discovering Unknown Tensor Network Structure Search Algorithms via Large Language Models (LLMs)
222. ICML 2023A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
223. ICML 2023Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples
224. ICML 2023Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations
225. ICML 2023Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization
226. ICML 2023Are Random Decompositions all we need in High Dimensional Bayesian Optimisation?
227. ICML 2023Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences
228. ICML 2023Automatic Data Augmentation via Invariance-Constrained Learning
229. ICML 2023Beam Tree Recursive Cells
230. ICML 2023Beyond Exponentially Fast Mixing in Average-Reward Reinforcement Learning via Multi-Level Monte Carlo Actor-Critic
231. ICML 2023Deep Generative Symbolic Regression with Monte-Carlo-Tree-Search
232. ICML 2023Differentiable Tree Operations Promote Compositional Generalization
233. ICML 2023Do Not Train It: A Linear Neural Architecture Search of Graph Neural Networks
234. ICML 2023Extrapolated Random Tree for Regression
235. ICML 2023In Search of Insights, Not Magic Bullets: Towards Demystification of the Model Selection Dilemma in Heterogeneous Treatment Effect Estimation
236. ICML 2023Input uncertainty propagation through trained neural networks
237. ICML 2023Neural Markov Jump Processes
238. ICML 2023Off-Policy Average Reward Actor-Critic with Deterministic Policy Search
239. ICML 2023On Computing Optimal Tree Ensembles
240. ICML 2023On Sampling with Approximate Transport Maps
241. ICML 2023Opponent-Limited Online Search for Imperfect Information Games
242. ICML 2023Optimal randomized multilevel Monte Carlo for repeatedly nested expectations
243. ICML 2023QAS-Bench: Rethinking Quantum Architecture Search and A Benchmark
244. ICML 2023QuantumDARTS: Differentiable Quantum Architecture Search for Variational Quantum Algorithms
245. ICML 2023Rethink DARTS Search Space and Renovate a New Benchmark
246. ICML 2023Scalable Safe Policy Improvement via Monte Carlo Tree Search
247. ICML 2023Sequential Monte Carlo Learning for Time Series Structure Discovery
248. ICML 2023Shortest Edit Path Crossover: A Theory-driven Solution to the Permutation Problem in Evolutionary Neural Architecture Search
249. ICML 2023Structure Learning of Latent Factors via Clique Search on Correlation Thresholded Graphs
250. ICML 2023Truncating Trajectories in Monte Carlo Reinforcement Learning

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.