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

773 papers, page 2 of 16

51. ICLR 2026Mixed-Curvature Tree-Sliced Wasserstein Distance
52. ICLR 2026Multilevel Control Functional
53. ICLR 2026Obscure but Effective: Classical Chinese Jailbreak Prompt Optimization via Bio-Inspired Search
54. ICLR 2026One step further with Monte-Carlo sampler to guide diffusion better
55. ICLR 2026OR-PRM: A Process Reward Model for Algorithmic Problem in Operations Research
56. ICLR 2026Quasi-Monte Carlo Methods Enable Extremely Low-Dimensional Deep Generative Models
57. ICLR 2026Randomized Antipodal Search Done Right for Data Pareto Improvement of LLM Unlearning
58. ICLR 2026Regret-Guided Search Control for Efficient Learning in AlphaZero
59. ICLR 2026Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat–Weber Problem
60. ICLR 2026RNE: plug-and-play diffusion inference-time control and energy-based training
61. ICLR 2026Score-based Greedy Search for Structure Identification of Partially Observed Linear Causal Models
62. ICLR 2026SealQA: Raising the Bar for Reasoning in Search-Augmented Language Models
63. ICLR 2026SelvaBox: A high‑resolution dataset for tropical tree crown detection
64. ICLR 2026Statistical Guarantees in the Search for Less Discriminatory Algorithms
65. ICLR 2026ToolTree: Efficient LLM Tool Planning via Dual-Feedback Monte Carlo Tree Search and Bidirectional Pruning
66. ICLR 2026Towards Better Branching Policies: Leveraging the Sequential Nature of Branch-and-Bound Tree
67. ICLR 2026Tree Search for LLM Agent Reinforcement Learning
68. ICLR 2026Tree-sliced Sobolev IPM
69. ICLR 2026TreeGRPO: Tree-Advantage GRPO for Online RL Post-Training of Diffusion Models
70. ICLR 2026Unlocking Long-Horizon Agentic Search with Large-Scale End-to-End RL
71. ICLR 2026VFScale: Intrinsic Reasoning through Verifier-Free Test-time Scalable Diffusion Model
72. ICLR 2026Weak-to-Strong Generalization with Failure Trajectories
73. ICLR 2026Welfarist Formulations for Diverse Similarity Search
74. ICLR 2026What Generative Search Engines Like and How to Optimize Web Content Cooperatively
75. ICML 2026$\alpha$-PFN: Fast Entropy Search via In-Context Learning
76. ICML 2026A Bi-metric Framework for Efficient Nearest Neighbor Search
77. ICML 2026Accelerating Langevin Monte Carlo via Efficient Stochastic Runge-Kutta Methods beyond Log-Concavity
78. ICML 2026Accurate Large-sample Uncertainty Quantification using Stochastic Gradient Markov Chain Monte Carlo
79. ICML 2026Active Continual Learning with Metaplastic Binary Bayesian Neural Networks
80. ICML 2026Advancing SVD-based LLM Compression via Layer-Wise Error Model Search
81. ICML 2026AdverMCTS: Combating Pseudo-Correctness in Code Generation via Adversarial Monte Carlo Tree Search
82. ICML 2026AI Engram: In Search of Memory Traces in Artificial Intelligence
83. ICML 2026Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
84. ICML 2026AlphaRouter: Token-level Routing Between SLM and LLM with Reinforcement Learning and Tree Search
85. ICML 2026Approximate Nearest Neighbor Search for Modern AI: A Projection-Augmented Graph Approach
86. ICML 2026AReaL-DTA: Dynamic Tree Attention for Efficient Reinforcement Learning of Large Language Models
87. ICML 2026BESPOKE: Benchmark for Search-Augmented Large Language Model Personalization via Diagnostic Feedback
88. ICML 2026Beyond Policy Training: Recursive Solution Search from Unannotated Videos
89. ICML 2026Beyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
90. ICML 2026Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matching
91. ICML 2026BVS: Bayesian Visual Search with Multimodal Large Language Model for Fine-grained Perception
92. ICML 2026Cache Coherent Resampling for Efficient Test Time Scaling in LLM Reasoning via Adaptive Sequential Monte Carlo
93. ICML 2026Can I Have Your Order? Monte-Carlo Tree Search for Slot Filling Ordering in Diffusion Language Models
94. ICML 2026Can Microcanonical Langevin Dynamics Leverage Mini-Batch Gradient Noise?
95. ICML 2026CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees
96. ICML 2026Complexity Bounds for Dirichlet Process Slice Samplers
97. ICML 2026Computationally-efficient Graph Modeling with Refined Graph Random Features
98. ICML 2026Conditional Diffusion Sampling
99. ICML 2026Constrained Adaptive Rejection Sampling
100. ICML 2026Control Consistency Losses for Diffusion Bridges

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.