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

170 papers, page 3 of 4

101. ICLR 2025SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement
102. ICLR 2025Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo
103. ICLR 2025Synthesizing Programmatic Reinforcement Learning Policies with Large Language Model Guided Search
104. ICLR 2025Test-time Alignment of Diffusion Models without Reward Over-optimization
105. ICLR 2025Tree of Attributes Prompt Learning for Vision-Language Models
106. ICLR 2025Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search
107. ICLR 2025Unsupervised Model Tree Heritage Recovery
108. ICLR 2025Variance-Reducing Couplings for Random Features
109. ICLR 2025Variational Search Distributions
110. ICLR 2024ArchLock: Locking DNN Transferability at the Architecture Level with a Zero-Cost Binary Predictor
111. ICLR 2024ARGS: Alignment as Reward-Guided Search
112. ICLR 2024Chain of Log-Concave Markov Chains
113. ICLR 2024Data Debugging with Shapley Importance over Machine Learning Pipelines
114. ICLR 2024Effective and Efficient Federated Tree Learning on Hybrid Data
115. ICLR 2024Fast Hyperboloid Decision Tree Algorithms
116. ICLR 2024Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
117. ICLR 2024Fiber Monte Carlo
118. ICLR 2024GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data
119. ICLR 2024GraphChef: Decision-Tree Recipes to Explain Graph Neural Networks
120. ICLR 2024Improving protein optimization with smoothed fitness landscapes
121. ICLR 2024Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited
122. ICLR 2024Local Search GFlowNets
123. ICLR 2024Masked Distillation Advances Self-Supervised Transformer Architecture Search
124. ICLR 2024Monte Carlo guided Denoising Diffusion models for Bayesian linear inverse problems.
125. ICLR 2024Neural Fine-Tuning Search for Few-Shot Learning
126. ICLR 2024PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization
127. ICLR 2024Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
128. ICLR 2024Quasi-Monte Carlo for 3D Sliced Wasserstein
129. ICLR 2024Reinforcement Symbolic Regression Machine
130. ICLR 2024Repelling Random Walks
131. ICLR 2024Reverse Diffusion Monte Carlo
132. ICLR 2024Robust NAS under adversarial training: benchmark, theory, and beyond
133. ICLR 2024Robustifying and Boosting Training-Free Neural Architecture Search
134. ICLR 2024SEABO: A Simple Search-Based Method for Offline Imitation Learning
135. ICLR 2024Sliced Wasserstein Estimation with Control Variates
136. ICLR 2024Sum-Product-Set Networks: Deep Tractable Models for Tree-Structured Graphs
137. ICLR 2024ToolChain*: Efficient Action Space Navigation in Large Language Models with A* Search
138. ICLR 2024Tractable MCMC for Private Learning with Pure and Gaussian Differential Privacy
139. ICLR 2024Transport meets Variational Inference: Controlled Monte Carlo Diffusions
140. ICLR 2024Tree Cross Attention
141. ICLR 2024Tree Search-Based Policy Optimization under Stochastic Execution Delay
142. ICLR 2024Tree-Planner: Efficient Close-loop Task Planning with Large Language Models
143. ICLR 2024UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models
144. ICLR 2023A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
145. ICLR 2023A Self-Attention Ansatz for Ab-initio Quantum Chemistry
146. ICLR 2023A Simple Approach for Visual Room Rearrangement: 3D Mapping and Semantic Search
147. ICLR 2023A Simple Yet Powerful Deep Active Learning With Snapshots Ensembles
148. ICLR 2023Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time
149. ICLR 2023Analyzing Tree Architectures in Ensembles via Neural Tangent Kernel
150. ICLR 2023Approximate Nearest Neighbor Search through Modern Error-Correcting Codes

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.