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论文
共 773 篇,第 4 / 16 页
- ICML 2026Probabilistic Bisection Algorithm Provably Achieves Exponential Convergence
- ICML 2026Proximal-IMH: Proximal Posterior Proposals for Independent Metropolis–Hastings with Approximate Operators
- ICML 2026Recursive Monte-Carlo Tree Search
- ICML 2026RefChess: Training-Free Contextual Search for Zero-Shot Referring Image Segmentation
- ICML 2026Reflective Hamiltonian Monte Carlo: Mixing Analysis and Application to Sampling on Stiefel Manifold
- ICML 2026Reinforced Sequential Monte Carlo for Amortised Sampling
- ICML 2026RL4RLA: Teaching ML to Discover Randomized Linear Algebra Algorithms Through Curriculum Design and Graph-Based Search
- ICML 2026SCHUR-A*: Layer-wise Optimal Expert Pruning for MoEs via Schur-Complement Guided A* Search
- ICML 2026Score-Repellent Monte Carlo: Toward Efficient Non-Markovian Sampler with Constant Memory in General State Spaces
- ICML 2026Search or Accelerate: Confidence-Switched Position Beam Search for Diffusion Language Models
- ICML 2026Search Space Synthesis for Parametric Functions
- ICML 2026Self-Prophetic Decoding to Unlock Visual Search in LVLMs
- ICML 2026Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures
- ICML 2026Sonar-TS: Search-Then-Verify Natural Language Querying for Time Series Databases
- ICML 2026Stationary MMD Points
- ICML 2026Structure-Induced Information for Rerooting Levin Tree Search
- ICML 2026Structured Progressive Knowledge Activation for LLM-Driven Neural Architecture Search
- ICML 2026SURGE: Approximation and Training Free Particle Filter for Diffusion Surrogate
- ICML 2026SVL: Goal-Conditioned Reinforcement Learning as Survival Learning
- ICML 2026Test-Time Graph Search for Goal-Conditioned Reinforcement Learning
- ICML 2026TFTF: Training-Free Targeted Flow for Conditional Sampling
- ICML 2026The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
- ICML 2026The Surprising Difficulty of Search in Model-Based Reinforcement Learning
- ICML 2026The Trojan Knowledge: Bypassing Commercial LLM Guardrails via Harmless Prompt Weaving and Adaptive Tree Search
- ICML 2026Thinned Mean Field Langevin Dynamics
- ICML 2026Tree-Structured Orthonormal Decomposition of the Aitchison Simplex
- ICML 2026Twice Sequential Monte Carlo for Tree Search
- ICML 2026UnMaskFork: Test-Time Scaling for Masked Diffusion via Deterministic Action Branching
- ICML 2026Variance Driven Exploration: A Provable and Efficient Methodology for Pure Exploration in Highly Stochastic Environments
- NeurIPS 2026A Control-Theoretic Approximation to Predictive Coding Dynamics
- NeurIPS 2026A Regularization-Based Approach to Public Belief State Search for Adversarial Games
- NeurIPS 2026A Revisit of Hamiltonian Monte Carlo Efficiency on Bayesian Neural Networks
- NeurIPS 2026AdaTree: Serving-Aware Adaptive Tree Construction for Speculative Decoding
- NeurIPS 2026Agentic Neural Architecture Search
- NeurIPS 2026An Efficient Algorithm for Thresholding Monte Carlo Tree Search
- NeurIPS 2026Beyond Expected Values: Risk-Sensitive Planning with Distributional Monte-Carlo Tree Search
- NeurIPS 2026Beyond Imputation: Mask-Adaptive Conformal Prediction via Tree Embeddings on General Missing Data Mechanisms
- NeurIPS 2026Breadcrumbing Search Agents: Per-Turn Scheming Over Long-Horizon Trajectories
- NeurIPS 2026Breaking the $\sqrt{d}$ Communication Barrier in Federated Sampling with Adaptive Hamiltonian Monte Carlo
- NeurIPS 2026BridgeTwist: Twisting Schrödinger Bridges for Training-Free Conditional Sampling
- NeurIPS 2026Calibrated Safe Policy Improvement for Continuous Offline Reinforcement Learning
- NeurIPS 2026CARD: Internalizing Expert Critique into Reinforcement Learning for Deep Search
- NeurIPS 2026Cluster with Auctions for Vector Search
- NeurIPS 2026COCOTree: A Dataset and Benchmark for Open Tree-Structured Visual Decomposition
- NeurIPS 2026Conditioning Gaussian Processes on Almost Anything
- NeurIPS 2026Contour Monte Carlo: Sampling via Energy Level Sets
- NeurIPS 2026Corrected Integrated Laplace Approximation for Bayesian Inference in Latent Gaussian Models
- NeurIPS 2026DASS: A Solver-Agnostic Dynamic Auxiliary Search Strategy for Symbolic Regression
- NeurIPS 2026Decoupling Exploration and Policy Optimization: Uncertainty Guided Tree Search for Hard Exploration
- NeurIPS 2026Differentiable Systematic Resampling for Variational Sequential Monte Carlo
在 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 篇。