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论文
共 251 篇,第 5 / 6 页
- ICML 2024Integrated Hardware Architecture and Device Placement Search
- ICML 2024Iterative Search Attribution for Deep Neural Networks
- ICML 2024Kernel Semi-Implicit Variational Inference
- ICML 2024Language Agent Tree Search Unifies Reasoning, Acting, and Planning in Language Models
- ICML 2024Listening to the noise: Blind Denoising with Gibbs Diffusion
- ICML 2024MD tree: a model-diagnostic tree grown on loss landscape
- ICML 2024Neural Tangent Kernels for Axis-Aligned Tree Ensembles
- ICML 2024Online Variational Sequential Monte Carlo
- ICML 2024Parallel Affine Transformation Tuning of Markov Chain Monte Carlo
- ICML 2024Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
- ICML 2024Practical Hamiltonian Monte Carlo on Riemannian Manifolds via Relativity Theory
- ICML 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo
- ICML 2024Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
- ICML 2024Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization
- ICML 2024Quasi-Monte Carlo Features for Kernel Approximation
- ICML 2024Reinforcement Learning within Tree Search for Fast Macro Placement
- ICML 2024Resisting Stochastic Risks in Diffusion Planners with the Trajectory Aggregation Tree
- ICML 2024Sliced Wasserstein with Random-Path Projecting Directions
- ICML 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates
- ICML 2024Tilt your Head: Activating the Hidden Spatial-Invariance of Classifiers
- ICML 2024tnGPS: Discovering Unknown Tensor Network Structure Search Algorithms via Large Language Models (LLMs)
- ICML 2023A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
- ICML 2023Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples
- ICML 2023Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations
- ICML 2023Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization
- ICML 2023Are Random Decompositions all we need in High Dimensional Bayesian Optimisation?
- ICML 2023Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences
- ICML 2023Automatic Data Augmentation via Invariance-Constrained Learning
- ICML 2023Beam Tree Recursive Cells
- ICML 2023Beyond Exponentially Fast Mixing in Average-Reward Reinforcement Learning via Multi-Level Monte Carlo Actor-Critic
- ICML 2023Deep Generative Symbolic Regression with Monte-Carlo-Tree-Search
- ICML 2023Differentiable Tree Operations Promote Compositional Generalization
- ICML 2023Do Not Train It: A Linear Neural Architecture Search of Graph Neural Networks
- ICML 2023Extrapolated Random Tree for Regression
- ICML 2023In Search of Insights, Not Magic Bullets: Towards Demystification of the Model Selection Dilemma in Heterogeneous Treatment Effect Estimation
- ICML 2023Input uncertainty propagation through trained neural networks
- ICML 2023Neural Markov Jump Processes
- ICML 2023Off-Policy Average Reward Actor-Critic with Deterministic Policy Search
- ICML 2023On Computing Optimal Tree Ensembles
- ICML 2023On Sampling with Approximate Transport Maps
- ICML 2023Opponent-Limited Online Search for Imperfect Information Games
- ICML 2023Optimal randomized multilevel Monte Carlo for repeatedly nested expectations
- ICML 2023QAS-Bench: Rethinking Quantum Architecture Search and A Benchmark
- ICML 2023QuantumDARTS: Differentiable Quantum Architecture Search for Variational Quantum Algorithms
- ICML 2023Rethink DARTS Search Space and Renovate a New Benchmark
- ICML 2023Scalable Safe Policy Improvement via Monte Carlo Tree Search
- ICML 2023Sequential Monte Carlo Learning for Time Series Structure Discovery
- ICML 2023Shortest Edit Path Crossover: A Theory-driven Solution to the Permutation Problem in Evolutionary Neural Architecture Search
- ICML 2023Structure Learning of Latent Factors via Clique Search on Correlation Thresholded Graphs
- ICML 2023Truncating Trajectories in Monte Carlo Reinforcement Learning
在 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 篇。