MCTS论文趋势 2023–2026

主要结论

• MCTS论文从 2023 年的 115 篇增长到 2026 年的 278 篇，三年间扩大到约 2.4 倍。
• NeurIPS 是发MCTS论文最多的会议，2023–2026 年共 302 篇，占四个会议总量的 39%。
• 交叉方向里涨得最快的是AI 智能体：同时属于两个主题的论文从 2023 年的 1 篇增至 2026 年的 26 篇。
• 在「博弈与规划」的 5 个主题里，它的 2026 年论文数排第 3；同组增长最快的经典规划是 3.3 倍，MCTS是 2.4 倍。

代表论文

按年份和会议均匀挑选，方便快速看到每一届的样貌

• 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

全部MCTS论文

共 49 篇，第 1 / 1 页

1. ICLR 2025Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methods
2. ICLR 2025BTBS-LNS: Binarized-Tightening, Branch and Search on Learning LNS Policies for MIP
3. ICLR 2025CARTS: Advancing Neural Theorem Proving with Diversified Tactic Calibration and Bias-Resistant Tree Search
4. ICLR 2025Decision Tree Induction Through LLMs via Semantically-Aware Evolution
5. ICLR 2025DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search
6. ICLR 2025DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference
7. ICLR 2025Distance-Based Tree-Sliced Wasserstein Distance
8. ICLR 2025DPaI: Differentiable Pruning at Initialization with Node-Path Balance Principle
9. ICLR 2025Epistemic Monte Carlo Tree Search
10. ICLR 2025ExACT: Teaching AI Agents to Explore with Reflective-MCTS and Exploratory Learning
11. ICLR 2025Fast Summation of Radial Kernels via QMC Slicing
12. ICLR 2025Fast unsupervised ground metric learning with tree-Wasserstein distance
13. ICLR 2025From Isolated Conversations to Hierarchical Schemas: Dynamic Tree Memory Representation for LLMs
14. ICLR 2025Human-Aligned Chess With a Bit of Search
15. ICLR 2025Implicit Search via Discrete Diffusion: A Study on Chess
16. ICLR 2025In Search of Forgotten Domain Generalization
17. ICLR 2025KinFormer: Generalizable Dynamical Symbolic Regression for Catalytic Organic Reaction Kinetics
18. ICLR 2025Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning
19. ICLR 2025Learning Evolving Tools for Large Language Models
20. ICLR 2025Learning to Select Nodes in Branch and Bound with Sufficient Tree Representation
21. ICLR 2025Learning-Augmented Search Data Structures
22. ICLR 2025Linear Mode Connectivity in Differentiable Tree Ensembles
23. ICLR 2025Linear Transformer Topological Masking with Graph Random Features
24. ICLR 2025Monte Carlo Planning with Large Language Model for Text-Based Game Agents
25. ICLR 2025Outlier Synthesis via Hamiltonian Monte Carlo for Out-of-Distribution Detection
26. ICLR 2025Pacmann: Efficient Private Approximate Nearest Neighbor Search
27. ICLR 2025Parameter Expanded Stochastic Gradient Markov Chain Monte Carlo
28. ICLR 2025Procedural Synthesis of Synthesizable Molecules
29. ICLR 2025Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling
30. ICLR 2025Qinco2: Vector Compression and Search with Improved Implicit Neural Codebooks
31. ICLR 2025Rethinking Reward Model Evaluation: Are We Barking up the Wrong Tree?
32. ICLR 2025RuAG: Learned-rule-augmented Generation for Large Language Models
33. ICLR 2025Scalable Decision-Making in Stochastic Environments through Learned Temporal Abstraction
34. ICLR 2025Sequential Controlled Langevin Diffusions
35. ICLR 2025SFS: Smarter Code Space Search improves LLM Inference Scaling
36. ICLR 2025SPaR: Self-Play with Tree-Search Refinement to Improve Instruction-Following in Large Language Models
37. ICLR 2025Spherical Tree-Sliced Wasserstein Distance
38. ICLR 2025Step-by-Step Reasoning for Math Problems via Twisted Sequential Monte Carlo
39. ICLR 2025Strategist: Self-improvement of LLM Decision Making via Bi-Level Tree Search
40. ICLR 2025Strength Estimation and Human-Like Strength Adjustment in Games
41. ICLR 2025SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement
42. ICLR 2025Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo
43. ICLR 2025Synthesizing Programmatic Reinforcement Learning Policies with Large Language Model Guided Search
44. ICLR 2025Test-time Alignment of Diffusion Models without Reward Over-optimization
45. ICLR 2025Tree of Attributes Prompt Learning for Vision-Language Models
46. ICLR 2025Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search
47. ICLR 2025Unsupervised Model Tree Heritage Recovery
48. ICLR 2025Variance-Reducing Couplings for Random Features
49. ICLR 2025Variational Search Distributions

常见问题

2023–2026 年四大会议一共有多少篇MCTS论文？

共 773 篇，按年份分别是 2023 年 115 篇、2024 年 144 篇、2025 年 236 篇、2026 年 278 篇。

NeurIPS 2026 有多少篇MCTS论文？

NeurIPS 2026 有 99 篇MCTS论文，上一届是 100 篇。

ICLR 2026 有多少篇MCTS论文？

ICLR 2026 有 60 篇MCTS论文，上一届是 49 篇。

ICML 2026 有多少篇MCTS论文？

ICML 2026 有 105 篇MCTS论文，上一届是 75 篇。

CVPR 2026 有多少篇MCTS论文？

CVPR 2026 有 14 篇MCTS论文，上一届是 12 篇。

哪个会议的MCTS论文最多？

NeurIPS，2023–2026 年共 302 篇。