MCTS论文趋势 2023–2026

搜索与 MCTS

统计范围：NeurIPS、ICLR、ICML、CVPR 四个会议，2023–2026 年，共 773 篇被归入该主题的论文。

主要结论

每年论文数

各会议论文数

按年份和会议统计

MCTS论文数，按年份和会议
年份NeurIPSICLRICMLCVPR合计
202344273014115
202459344110144
2025100497512236
2026996010514278

代表论文

按年份和会议均匀挑选，方便快速看到每一届的样貌

全部MCTS论文

年份全部2023202420252026
会议全部NeurIPSICLRICMLCVPR

共 773 篇，第 5 / 16 页

  1. NeurIPS 2026Diffusion Path Samplers via Sequential Monte Carlo
  2. NeurIPS 2026Diffusion Tree Search for Inference Time Adaptation of Material Foundation Models
  3. NeurIPS 2026Discovering Mechanistic Models of Neural Activity: System Identification in an in Silico Zebrafish
  4. NeurIPS 2026Distributionally Robust Algorithmic Recourse for Tree Ensembles
  5. NeurIPS 2026Ensembling Language Models with Sequential Monte Carlo
  6. NeurIPS 2026Escaping Reasoning Basins: Basin-Aware Search for Inference-Time LLM Reasoning
  7. NeurIPS 2026ESS-Flow: training-free guidance as Bayesian inference in source space
  8. NeurIPS 2026Estimating the expected output of wide random MLPs more efficiently than sampling
  9. NeurIPS 2026Exploring Starts Are Not Enough: Counterexamples and a Fix for Monte Carlo Exploring Starts
  10. NeurIPS 2026Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning
  11. NeurIPS 2026Fast Accurate Quantum Monte Carlo without Metropolis Adjustment
  12. NeurIPS 2026Ferrogen: Generative Pipeline for Guided Search of Novel Ferroelectric Material for Logic and Memory
  13. NeurIPS 2026Finetuning with Sampling: Make SFT Generalize, Not Forget
  14. NeurIPS 2026FML-bench: A Controlled Study of AI Research Agent Strategies from the Perspective of Search Dynamics
  15. NeurIPS 2026From Ideas to Code: Tree-structured Policy Optimization for Automated Algorithm Design with LLMs
  16. NeurIPS 2026Geometry-Aware Score-Repellent Monte Carlo
  17. NeurIPS 2026Graph-Based Stochastic-Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation
  18. NeurIPS 2026Heuresis: Evaluating Search Strategies for Autonomous Machine Learning Research Agents
  19. NeurIPS 2026Hierarchical Semantic Tree Anchoring for CLIP-Based Class-Incremental Learning
  20. NeurIPS 2026HierFlow: Hierarchical Coupled Dual-Space Search for Automatic Agentic Workflow Generation
  21. NeurIPS 2026InterLV-Search: Benchmarking Interleaved Multimodal Agentic Search
  22. NeurIPS 2026KNN Implementation Details Can Dramatically Change Performance: An Example from Cover Trees
  23. NeurIPS 2026Learning to Search, Searching to Learn: A Closed-Loop Framework for Large-Scale Vehicle Routing
  24. NeurIPS 2026Likelihood-free inference of phylogenetic tree posterior distributions
  25. NeurIPS 2026LogT: Logically Think with Images for Visual Search
  26. NeurIPS 2026MC^2: Monte Carlo Correction for Fast Elliptic PDE Solving
  27. NeurIPS 2026MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search
  28. NeurIPS 2026Minimax Rates and Spectral Distillation for Tree Ensembles
  29. NeurIPS 2026Multilevel and Sequential Monte Carlo for Training-Free Diffusion Guidance
  30. NeurIPS 2026Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again
  31. NeurIPS 2026On Worst-Case Guarantees for Graph-Based Nearest-Neighbor Search
  32. NeurIPS 2026OneSearch-V2: The Latent Reasoning Enhanced Self-distillation Generative Search Framework
  33. NeurIPS 2026OpenSearch-VL: An Open Recipe for Frontier Multimodal Search Agents
  34. NeurIPS 2026Order-Marginalized Scoring for Masked Diffusion Models
  35. NeurIPS 2026Ordinary Least Squares as an Attention Mechanism
  36. NeurIPS 2026PACEvolve++: Improving Test-time Learning for Evolutionary Search Agents
  37. NeurIPS 2026PE-SHAP: Causally Interpretable Path-Wise Shapley Explanations
  38. NeurIPS 2026PiCA: Pivot-Based Credit Assignment For Search Agentic Reinforcement Learning
  39. NeurIPS 2026QUEST: Q-Learning for Uncertainty-Guided Efficient Search Teams
  40. NeurIPS 2026Random-Projection Tree Stein Variational Gradient Descent
  41. NeurIPS 2026Recovering the Apresjan Hierarchy Using Linkage-Based Clustering
  42. NeurIPS 2026Regularized Large Neighborhood Search
  43. NeurIPS 2026Resolving Time-Frequency Ridge Crossings via Frequency-Rate Lifting
  44. NeurIPS 2026Retriever-Free Retrieval-Augmented Reasoning via Corpus-Traversing MCTS
  45. NeurIPS 2026Robust Approximate Nearest Neighbor Search for Any Dataset
  46. NeurIPS 2026Runtime Analysis of Cartesian Genetic Programming on MAX: A Proven Exponential Speedup
  47. NeurIPS 2026ScaleBITS: Scalable Bitwidth Search for Hardware-Aligned Mixed-Precision LLMs
  48. NeurIPS 2026SCOUT: Planning under Occlusion via Object-Centric World Model Rollouts
  49. NeurIPS 2026SD-Search: Hindsight Self-Distillation for Search-Augmented Reasoning
  50. NeurIPS 2026Search at the Cost of Sampling: Nearly-Instant Latent Space Bayesian Optimization

在 Claude、Cursor 里直接问这个趋势

接上 Paperlist MCP 后，写综述、挑方向或准备投稿时，不用离开对话框就能拿到这页的数字：每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文，AI 会按你的问题整理。

可以直接复制这句话问 AI

用 paperlist 查MCTS在 NeurIPS 2023–2026 的论文趋势，哪一年涨得最快？

AI 会调用的工具：get_topic_stats {"topic": "monte-carlo-tree-search"}

两分钟接入 Paperlist MCP（Claude Code、Cursor、Codex、ChatGPT）

常见问题

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

「博弈与规划」下的其他主题