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

302 papers, page 3 of 7

101. NeurIPS 2025A Smooth Sea Never Made a Skilled SAILOR: Robust Imitation via Learning to Search
102. NeurIPS 2025Adaptive Distraction: Probing LLM Contextual Robustness with Automated Tree Search
103. NeurIPS 2025AI Research Agents for Machine Learning: Search, Exploration, and Generalization in MLE-bench
104. NeurIPS 2025AutoDiscovery: Open-ended Scientific Discovery via Bayesian Surprise
105. NeurIPS 2025Better Estimation of the Kullback--Leibler Divergence Between Language Models
106. NeurIPS 2025Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity
107. NeurIPS 2025Bringing SAM to new heights: leveraging elevation data for tree crown segmentation from drone imagery
108. NeurIPS 2025ComfyMind: Toward General-Purpose Generation via Tree-Based Planning and Reactive Feedback
109. NeurIPS 2025Compositional Monte Carlo Tree Diffusion for Extendable Planning
110. NeurIPS 2025Constrained Sampling for Language Models Should Be Easy: An MCMC Perspective
111. NeurIPS 2025Deep Tree Tensor Networks
112. NeurIPS 2025Differentiable Decision Tree via "ReLU+Argmin" Reformulation
113. NeurIPS 2025Diffusion Tree Sampling: Scalable inference‑time alignment of diffusion models
114. NeurIPS 2025Discovering Data Structures: Nearest Neighbor Search and Beyond
115. NeurIPS 2025Discretization-free Multicalibration through Loss Minimization over Tree Ensembles
116. NeurIPS 2025Diversifying Parallel Ergodic Search: A Signature Kernel Evolution Strategy
117. NeurIPS 2025Dynamic Algorithm for Explainable $k$-medians Clustering under $\ell_p$ Norm
118. NeurIPS 2025Empowering Decision Trees via Shape Function Branching
119. NeurIPS 2025EvoLM: In Search of Lost Language Model Training Dynamics
120. NeurIPS 2025Explainably Safe Reinforcement Learning
121. NeurIPS 2025Fast attention mechanisms: a tale of parallelism
122. NeurIPS 2025Fast Monte Carlo Tree Diffusion: 100× Speedup via Parallel and Sparse Planning
123. NeurIPS 2025Faster Generic Identification in Tree-Shaped Structural Causal Models
124. NeurIPS 2025FEAT: Free energy Estimators with Adaptive Transport
125. NeurIPS 2025Feedback-Aware MCTS for Goal-Oriented Information Seeking
126. NeurIPS 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
127. NeurIPS 2025Graph-based Symbolic Regression with Invariance and Constraint Encoding
128. NeurIPS 2025Improving Decision Trees through the Lens of Parameterized Local Search
129. NeurIPS 2025Improving Monte Carlo Tree Search for Symbolic Regression
130. NeurIPS 2025In Search of Adam’s Secret Sauce
131. NeurIPS 2025Jet-Nemotron: Efficient Language Model with Post Neural Architecture Search
132. NeurIPS 2025KeeA*: Epistemic Exploratory A* Search via Knowledge Calibration
133. NeurIPS 2025LaRes: Evolutionary Reinforcement Learning with LLM-based Adaptive Reward Search
134. NeurIPS 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm
135. NeurIPS 2025Learning to Better Search with Language Models via Guided Reinforced Self-Training
136. NeurIPS 2025Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs
137. NeurIPS 2025MALinZero: Efficient Low-Dimensional Search for Mastering Complex Multi-Agent Planning
138. NeurIPS 2025MDNS: Masked Diffusion Neural Sampler via Stochastic Optimal Control
139. NeurIPS 2025Metropolis Adjusted Microcanonical Hamiltonian Monte Carlo
140. NeurIPS 2025MigGPT: Harnessing Large Language Models for Automated Migration of Out-of-Tree Linux Kernel Patches Across Versions
141. NeurIPS 2025Mind2Web 2: Evaluating Agentic Search with Agent-as-a-Judge
142. NeurIPS 2025MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation
143. NeurIPS 2025Mulberry: Empowering MLLM with o1-like Reasoning and Reflection via Collective Monte Carlo Tree Search
144. NeurIPS 2025Multilevel neural simulation-based inference
145. NeurIPS 2025Neural Attention Search
146. NeurIPS 2025Offline Goal-conditioned Reinforcement Learning with Quasimetric Representations
147. NeurIPS 2025Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
148. NeurIPS 2025OptiTree: Hierarchical Thoughts Generation with Tree Search for LLM Optimization Modeling
149. NeurIPS 2025Parallelizing MCMC Across the Sequence Length
150. NeurIPS 2025Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems

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.