MCTS论文趋势 2023–2026

搜索与 MCTS

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

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

代表论文

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

全部MCTS论文

年份全部2023202420252026
会议全部NeurIPSICLRICMLCVPR

共 773 篇，第 2 / 16 页

  1. ICLR 2026Mixed-Curvature Tree-Sliced Wasserstein Distance
  2. ICLR 2026Multilevel Control Functional
  3. ICLR 2026Obscure but Effective: Classical Chinese Jailbreak Prompt Optimization via Bio-Inspired Search
  4. ICLR 2026One step further with Monte-Carlo sampler to guide diffusion better
  5. ICLR 2026OR-PRM: A Process Reward Model for Algorithmic Problem in Operations Research
  6. ICLR 2026Quasi-Monte Carlo Methods Enable Extremely Low-Dimensional Deep Generative Models
  7. ICLR 2026Randomized Antipodal Search Done Right for Data Pareto Improvement of LLM Unlearning
  8. ICLR 2026Regret-Guided Search Control for Efficient Learning in AlphaZero
  9. ICLR 2026Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat–Weber Problem
  10. ICLR 2026RNE: plug-and-play diffusion inference-time control and energy-based training
  11. ICLR 2026Score-based Greedy Search for Structure Identification of Partially Observed Linear Causal Models
  12. ICLR 2026SealQA: Raising the Bar for Reasoning in Search-Augmented Language Models
  13. ICLR 2026SelvaBox: A high‑resolution dataset for tropical tree crown detection
  14. ICLR 2026Statistical Guarantees in the Search for Less Discriminatory Algorithms
  15. ICLR 2026ToolTree: Efficient LLM Tool Planning via Dual-Feedback Monte Carlo Tree Search and Bidirectional Pruning
  16. ICLR 2026Towards Better Branching Policies: Leveraging the Sequential Nature of Branch-and-Bound Tree
  17. ICLR 2026Tree Search for LLM Agent Reinforcement Learning
  18. ICLR 2026Tree-sliced Sobolev IPM
  19. ICLR 2026TreeGRPO: Tree-Advantage GRPO for Online RL Post-Training of Diffusion Models
  20. ICLR 2026Unlocking Long-Horizon Agentic Search with Large-Scale End-to-End RL
  21. ICLR 2026VFScale: Intrinsic Reasoning through Verifier-Free Test-time Scalable Diffusion Model
  22. ICLR 2026Weak-to-Strong Generalization with Failure Trajectories
  23. ICLR 2026Welfarist Formulations for Diverse Similarity Search
  24. ICLR 2026What Generative Search Engines Like and How to Optimize Web Content Cooperatively
  25. ICML 2026$\alpha$-PFN: Fast Entropy Search via In-Context Learning
  26. ICML 2026A Bi-metric Framework for Efficient Nearest Neighbor Search
  27. ICML 2026Accelerating Langevin Monte Carlo via Efficient Stochastic Runge-Kutta Methods beyond Log-Concavity
  28. ICML 2026Accurate Large-sample Uncertainty Quantification using Stochastic Gradient Markov Chain Monte Carlo
  29. ICML 2026Active Continual Learning with Metaplastic Binary Bayesian Neural Networks
  30. ICML 2026Advancing SVD-based LLM Compression via Layer-Wise Error Model Search
  31. ICML 2026AdverMCTS: Combating Pseudo-Correctness in Code Generation via Adversarial Monte Carlo Tree Search
  32. ICML 2026AI Engram: In Search of Memory Traces in Artificial Intelligence
  33. ICML 2026Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs
  34. ICML 2026AlphaRouter: Token-level Routing Between SLM and LLM with Reinforcement Learning and Tree Search
  35. ICML 2026Approximate Nearest Neighbor Search for Modern AI: A Projection-Augmented Graph Approach
  36. ICML 2026AReaL-DTA: Dynamic Tree Attention for Efficient Reinforcement Learning of Large Language Models
  37. ICML 2026BESPOKE: Benchmark for Search-Augmented Large Language Model Personalization via Diagnostic Feedback
  38. ICML 2026Beyond Policy Training: Recursive Solution Search from Unannotated Videos
  39. ICML 2026Beyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
  40. ICML 2026Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matching
  41. ICML 2026BVS: Bayesian Visual Search with Multimodal Large Language Model for Fine-grained Perception
  42. ICML 2026Cache Coherent Resampling for Efficient Test Time Scaling in LLM Reasoning via Adaptive Sequential Monte Carlo
  43. ICML 2026Can I Have Your Order? Monte-Carlo Tree Search for Slot Filling Ordering in Diffusion Language Models
  44. ICML 2026Can Microcanonical Langevin Dynamics Leverage Mini-Batch Gradient Noise?
  45. ICML 2026CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees
  46. ICML 2026Complexity Bounds for Dirichlet Process Slice Samplers
  47. ICML 2026Computationally-efficient Graph Modeling with Refined Graph Random Features
  48. ICML 2026Conditional Diffusion Sampling
  49. ICML 2026Constrained Adaptive Rejection Sampling
  50. ICML 2026Control Consistency Losses for Diffusion Bridges

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

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