MCTS论文趋势 2023–2026
搜索与 MCTS
统计范围：NeurIPS、ICLR、ICML、CVPR 四个会议，2023–2026 年，共 773 篇被归入该主题的论文。
主要结论
- 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 | ICLR | ICML | CVPR | 合计 |
|---|---|---|---|---|---|
| 2023 | 44 | 27 | 30 | 14 | 115 |
| 2024 | 59 | 34 | 41 | 10 | 144 |
| 2025 | 100 | 49 | 75 | 12 | 236 |
| 2026 | 99 | 60 | 105 | 14 | 278 |
代表论文
按年份和会议均匀挑选，方便快速看到每一届的样貌
- 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论文
共 236 篇，第 5 / 5 页
- NeurIPS 2025Reverse-Annealed Sequential Monte Carlo for Efficient Bayesian Optimal Experiment Design
- NeurIPS 2025RF-Agent: Automated Reward Function Design via Language Agent Tree Search
- NeurIPS 2025Robust Contextual Pricing
- NeurIPS 2025Rollout Roulette: A Probabilistic Inference Approach to Inference-Time Scaling of LLMs using Particle-Based Monte Carlo Methods
- NeurIPS 2025SCAN: Self-Denoising Monte Carlo Annotation for Robust Process Reward Learning
- NeurIPS 2025Schrödinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentres
- NeurIPS 2025SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents
- NeurIPS 2025Sequential Monte Carlo for Policy Optimization in Continuous POMDPs
- NeurIPS 2025SIGMA: Refining Large Language Model Reasoning via Sibling-Guided Monte Carlo Augmentation
- NeurIPS 2025SolverLLM: Leveraging Test-Time Scaling for Optimization Problem via LLM-Guided Search
- NeurIPS 2025SoTA with Less: MCTS-Guided Sample Selection for Data-Efficient Visual Reasoning Self-Improvement
- NeurIPS 2025STree: Speculative Tree Decoding for Hybrid State Space Models
- NeurIPS 2025Structural Entropy Guided Agent for Detecting and Repairing Knowledge Deficiencies in LLMs
- NeurIPS 2025SYMPHONY: Synergistic Multi-agent Planning with Heterogeneous Language Model Assembly
- NeurIPS 2025T-REGS: Minimum Spanning Tree Regularization for Self-Supervised Learning
- NeurIPS 2025TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search
- NeurIPS 2025Test Time Scaling for Neural Processes
- NeurIPS 2025Test-Time Scaling of Diffusion Models via Noise Trajectory Search
- NeurIPS 2025TF-MAS: Training-free Mamba2 Architecture Search
- NeurIPS 2025The Complexity of Finding Local Optima in Contrastive Learning
- NeurIPS 2025Train on Pins and Test on Obstacles for Rectilinear Steiner Minimum Tree
- NeurIPS 2025Training-Free Guidance Beyond Differentiability: Scalable Path Steering with Tree Search in Diffusion and Flow Models
- NeurIPS 2025Traversal Verification for Speculative Tree Decoding
- NeurIPS 2025Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithm
- NeurIPS 2025Tree of Preferences for Diversified Recommendation
- NeurIPS 2025Tree-Based Premise Selection for Lean4
- NeurIPS 2025Tree-Sliced Entropy Partial Transport
- NeurIPS 2025TreeFinder: A US-Scale Benchmark Dataset for Individual Tree Mortality Monitoring Using High-Resolution Aerial Imagery
- NeurIPS 2025TreeSplat: Mergeable Tree for Deformable Gaussian Splatting
- NeurIPS 2025TreeSynth: Synthesizing Diverse Data from Scratch via Tree-Guided Subspace Partitioning
- NeurIPS 2025Tru-POMDP: Task Planning Under Uncertainty via Tree of Hypotheses and Open-Ended POMDPs
- NeurIPS 2025Uncertainty-Guided Exploration for Efficient AlphaZero Training
- NeurIPS 2025Variational Polya Tree
- NeurIPS 2025We Should Chart an Atlas of All the World's Models
- NeurIPS 2025Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search
- NeurIPS 2025Yggdrasil: Bridging Dynamic Speculation and Static Runtime for Latency-Optimal Tree-Based LLM Decoding
在 Claude、Cursor 里直接问这个趋势
接上 Paperlist MCP 后，写综述、挑方向或准备投稿时，不用离开对话框就能拿到这页的数字：每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文，AI 会按你的问题整理。
可以直接复制这句话问 AI
用 paperlist 查MCTS在 NeurIPS 2023–2026 的论文趋势，哪一年涨得最快？
AI 会调用的工具：get_topic_stats {"topic": "monte-carlo-tree-search"}
常见问题
- 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 篇。