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论文

共 44 篇，第 1 / 1 页

1. NeurIPS 2023A Heavy-Tailed Algebra for Probabilistic Programming
2. NeurIPS 2023Accelerating Monte Carlo Tree Search with Probability Tree State Abstraction
3. NeurIPS 2023Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction
4. NeurIPS 2023An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint
5. NeurIPS 2023ANTN: Bridging Autoregressive Neural Networks and Tensor Networks for Quantum Many-Body Simulation
6. NeurIPS 2023Contextual Stochastic Bilevel Optimization
7. NeurIPS 2023DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries
8. NeurIPS 2023Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models
9. NeurIPS 2023EMBERSim: A Large-Scale Databank for Boosting Similarity Search in Malware Analysis
10. NeurIPS 2023Empowering Convolutional Neural Nets with MetaSin Activation
11. NeurIPS 2023Energy-Based Sliced Wasserstein Distance
12. NeurIPS 2023FAST: a Fused and Accurate Shrinkage Tree for Heterogeneous Treatment Effects Estimation
13. NeurIPS 2023Fitting trees to $\ell_1$-hyperbolic distances
14. NeurIPS 2023Game Solving with Online Fine-Tuning
15. NeurIPS 2023Generalized Weighted Path Consistency for Mastering Atari Games
16. NeurIPS 2023Hierarchical clustering with dot products recovers hidden tree structure
17. NeurIPS 2023History Filtering in Imperfect Information Games: Algorithms and Complexity
18. NeurIPS 2023Inferring the Future by Imagining the Past
19. NeurIPS 2023Kernel Stein Discrepancy thinning: a theoretical perspective of pathologies and a practical fix with regularization
20. NeurIPS 2023Knowledge Distillation for High Dimensional Search Index
21. NeurIPS 2023LambdaBeam: Neural Program Search with Higher-Order Functions and Lambdas
22. NeurIPS 2023Langevin Quasi-Monte Carlo
23. NeurIPS 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt
24. NeurIPS 2023LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios
25. NeurIPS 2023Linear Time Algorithms for k-means with Multi-Swap Local Search
26. NeurIPS 2023Locality Sensitive Hashing in Fourier Frequency Domain For Soft Set Containment Search
27. NeurIPS 2023Monte Carlo Tree Search with Boltzmann Exploration
28. NeurIPS 2023NAS-X: Neural Adaptive Smoothing via Twisting
29. NeurIPS 2023NuTrea: Neural Tree Search for Context-guided Multi-hop KGQA
30. NeurIPS 2023POMDP Planning for Object Search in Partially Unknown Environment
31. NeurIPS 2023Prefix-Tree Decoding for Predicting Mass Spectra from Molecules
32. NeurIPS 2023Quasi-Monte Carlo Graph Random Features
33. NeurIPS 2023Random Cuts are Optimal for Explainable k-Medians
34. NeurIPS 2023SAME: Uncovering GNN Black Box with Structure-aware Shapley-based Multipiece Explanations
35. NeurIPS 2023Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk
36. NeurIPS 2023SOAR: Improved Indexing for Approximate Nearest Neighbor Search
37. NeurIPS 2023Thinker: Learning to Plan and Act
38. NeurIPS 2023Towards Data-Agnostic Pruning At Initialization: What Makes a Good Sparse Mask?
39. NeurIPS 2023Tree-Rings Watermarks: Invisible Fingerprints for Diffusion Images
40. NeurIPS 2023Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach
41. NeurIPS 2023Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo
42. NeurIPS 2023Variational Monte Carlo on a Budget — Fine-tuning pre-trained Neural Wavefunctions
43. NeurIPS 2023Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation
44. NeurIPS 2023Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations

常见问题

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 篇。