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 2 of 3

51. ICML 2024Approximate Nearest Neighbor Search with Window Filters
52. ICML 2024Automated Loss function Search for Class-imbalanced Node Classification
53. ICML 2024CHEMREASONER: Heuristic Search over a Large Language Model’s Knowledge Space using Quantum-Chemical Feedback
54. ICML 2024Contrastive Predict-and-Search for Mixed Integer Linear Programs
55. ICML 2024Debiased Distribution Compression
56. ICML 2024Demystifying SGD with Doubly Stochastic Gradients
57. ICML 2024DetKDS: Knowledge Distillation Search for Object Detectors
58. ICML 2024Diffusive Gibbs Sampling
59. ICML 2024Disentangled Continual Graph Neural Architecture Search with Invariant Modular Supernet
60. ICML 2024Dynamic Byzantine-Robust Learning: Adapting to Switching Byzantine Workers
61. ICML 2024EiG-Search: Generating Edge-Induced Subgraphs for GNN Explanation in Linear Time
62. ICML 2024Encodings for Prediction-based Neural Architecture Search
63. ICML 2024EvoRainbow: Combining Improvements in Evolutionary Reinforcement Learning for Policy Search
64. ICML 2024Faster Maximum Inner Product Search in High Dimensions
65. ICML 2024Integrated Hardware Architecture and Device Placement Search
66. ICML 2024Iterative Search Attribution for Deep Neural Networks
67. ICML 2024Kernel Semi-Implicit Variational Inference
68. ICML 2024Language Agent Tree Search Unifies Reasoning, Acting, and Planning in Language Models
69. ICML 2024Listening to the noise: Blind Denoising with Gibbs Diffusion
70. ICML 2024MD tree: a model-diagnostic tree grown on loss landscape
71. ICML 2024Neural Tangent Kernels for Axis-Aligned Tree Ensembles
72. ICML 2024Online Variational Sequential Monte Carlo
73. ICML 2024Parallel Affine Transformation Tuning of Markov Chain Monte Carlo
74. ICML 2024Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
75. ICML 2024Practical Hamiltonian Monte Carlo on Riemannian Manifolds via Relativity Theory
76. ICML 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo
77. ICML 2024Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
78. ICML 2024Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization
79. ICML 2024Quasi-Monte Carlo Features for Kernel Approximation
80. ICML 2024Reinforcement Learning within Tree Search for Fast Macro Placement
81. ICML 2024Resisting Stochastic Risks in Diffusion Planners with the Trajectory Aggregation Tree
82. ICML 2024Sliced Wasserstein with Random-Path Projecting Directions
83. ICML 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates
84. ICML 2024Tilt your Head: Activating the Hidden Spatial-Invariance of Classifiers
85. ICML 2024tnGPS: Discovering Unknown Tensor Network Structure Search Algorithms via Large Language Models (LLMs)
86. NeurIPS 20243D Gaussian Splatting as Markov Chain Monte Carlo
87. NeurIPS 2024Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
88. NeurIPS 2024Advancing Tool-Augmented Large Language Models: Integrating Insights from Errors in Inference Trees
89. NeurIPS 2024AlphaMath Almost Zero: Process Supervision without Process
90. NeurIPS 2024An engine not a camera: Measuring performative power of online search
91. NeurIPS 2024Automated Efficient Estimation using Monte Carlo Efficient Influence Functions
92. NeurIPS 2024Beyond Accuracy: Tracking more like Human via Visual Search
93. NeurIPS 2024Binary Search with Distributional Predictions
94. NeurIPS 2024CE-NAS: An End-to-End Carbon-Efficient Neural Architecture Search Framework
95. NeurIPS 2024Compositional Generalization Across Distributional Shifts with Sparse Tree Operations
96. NeurIPS 2024Conditional Density Estimation with Histogram Trees
97. NeurIPS 2024Constrained Sampling with Primal-Dual Langevin Monte Carlo
98. NeurIPS 2024CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search
99. NeurIPS 2024Customized Subgraph Selection and Encoding for Drug-drug Interaction Prediction
100. NeurIPS 2024Divide-and-Conquer Posterior Sampling for Denoising Diffusion priors

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.