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论文
共 100 篇,第 1 / 2 页
- NeurIPS 2025A Single-Swap Local Search Algorithm for k-Means of Lines
- NeurIPS 2025A Smooth Sea Never Made a Skilled SAILOR: Robust Imitation via Learning to Search
- NeurIPS 2025Adaptive Distraction: Probing LLM Contextual Robustness with Automated Tree Search
- NeurIPS 2025AI Research Agents for Machine Learning: Search, Exploration, and Generalization in MLE-bench
- NeurIPS 2025AutoDiscovery: Open-ended Scientific Discovery via Bayesian Surprise
- NeurIPS 2025Better Estimation of the Kullback--Leibler Divergence Between Language Models
- NeurIPS 2025Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity
- NeurIPS 2025Bringing SAM to new heights: leveraging elevation data for tree crown segmentation from drone imagery
- NeurIPS 2025ComfyMind: Toward General-Purpose Generation via Tree-Based Planning and Reactive Feedback
- NeurIPS 2025Compositional Monte Carlo Tree Diffusion for Extendable Planning
- NeurIPS 2025Constrained Sampling for Language Models Should Be Easy: An MCMC Perspective
- NeurIPS 2025Deep Tree Tensor Networks
- NeurIPS 2025Differentiable Decision Tree via "ReLU+Argmin" Reformulation
- NeurIPS 2025Diffusion Tree Sampling: Scalable inference‑time alignment of diffusion models
- NeurIPS 2025Discovering Data Structures: Nearest Neighbor Search and Beyond
- NeurIPS 2025Discretization-free Multicalibration through Loss Minimization over Tree Ensembles
- NeurIPS 2025Diversifying Parallel Ergodic Search: A Signature Kernel Evolution Strategy
- NeurIPS 2025Dynamic Algorithm for Explainable $k$-medians Clustering under $\ell_p$ Norm
- NeurIPS 2025Empowering Decision Trees via Shape Function Branching
- NeurIPS 2025EvoLM: In Search of Lost Language Model Training Dynamics
- NeurIPS 2025Explainably Safe Reinforcement Learning
- NeurIPS 2025Fast attention mechanisms: a tale of parallelism
- NeurIPS 2025Fast Monte Carlo Tree Diffusion: 100× Speedup via Parallel and Sparse Planning
- NeurIPS 2025Faster Generic Identification in Tree-Shaped Structural Causal Models
- NeurIPS 2025FEAT: Free energy Estimators with Adaptive Transport
- NeurIPS 2025Feedback-Aware MCTS for Goal-Oriented Information Seeking
- NeurIPS 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
- NeurIPS 2025Graph-based Symbolic Regression with Invariance and Constraint Encoding
- NeurIPS 2025Improving Decision Trees through the Lens of Parameterized Local Search
- NeurIPS 2025Improving Monte Carlo Tree Search for Symbolic Regression
- NeurIPS 2025In Search of Adam’s Secret Sauce
- NeurIPS 2025Jet-Nemotron: Efficient Language Model with Post Neural Architecture Search
- NeurIPS 2025KeeA*: Epistemic Exploratory A* Search via Knowledge Calibration
- NeurIPS 2025LaRes: Evolutionary Reinforcement Learning with LLM-based Adaptive Reward Search
- NeurIPS 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm
- NeurIPS 2025Learning to Better Search with Language Models via Guided Reinforced Self-Training
- NeurIPS 2025Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs
- NeurIPS 2025MALinZero: Efficient Low-Dimensional Search for Mastering Complex Multi-Agent Planning
- NeurIPS 2025MDNS: Masked Diffusion Neural Sampler via Stochastic Optimal Control
- NeurIPS 2025Metropolis Adjusted Microcanonical Hamiltonian Monte Carlo
- NeurIPS 2025MigGPT: Harnessing Large Language Models for Automated Migration of Out-of-Tree Linux Kernel Patches Across Versions
- NeurIPS 2025Mind2Web 2: Evaluating Agentic Search with Agent-as-a-Judge
- NeurIPS 2025MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation
- NeurIPS 2025Mulberry: Empowering MLLM with o1-like Reasoning and Reflection via Collective Monte Carlo Tree Search
- NeurIPS 2025Multilevel neural simulation-based inference
- NeurIPS 2025Neural Attention Search
- NeurIPS 2025Offline Goal-conditioned Reinforcement Learning with Quasimetric Representations
- NeurIPS 2025Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
- NeurIPS 2025OptiTree: Hierarchical Thoughts Generation with Tree Search for LLM Optimization Modeling
- NeurIPS 2025Parallelizing MCMC Across the Sequence Length
在 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 篇。