MCTS论文趋势 2023–2026

搜索与 MCTS

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

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

代表论文

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

全部MCTS论文

共 773 篇,第 10 / 16 页

  1. NeurIPS 2025Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs
  2. NeurIPS 2025MALinZero: Efficient Low-Dimensional Search for Mastering Complex Multi-Agent Planning
  3. NeurIPS 2025MDNS: Masked Diffusion Neural Sampler via Stochastic Optimal Control
  4. NeurIPS 2025Metropolis Adjusted Microcanonical Hamiltonian Monte Carlo
  5. NeurIPS 2025MigGPT: Harnessing Large Language Models for Automated Migration of Out-of-Tree Linux Kernel Patches Across Versions
  6. NeurIPS 2025Mind2Web 2: Evaluating Agentic Search with Agent-as-a-Judge
  7. NeurIPS 2025MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation
  8. NeurIPS 2025Mulberry: Empowering MLLM with o1-like Reasoning and Reflection via Collective Monte Carlo Tree Search
  9. NeurIPS 2025Multilevel neural simulation-based inference
  10. NeurIPS 2025Neural Attention Search
  11. NeurIPS 2025Offline Goal-conditioned Reinforcement Learning with Quasimetric Representations
  12. NeurIPS 2025Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
  13. NeurIPS 2025OptiTree: Hierarchical Thoughts Generation with Tree Search for LLM Optimization Modeling
  14. NeurIPS 2025Parallelizing MCMC Across the Sequence Length
  15. NeurIPS 2025Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems
  16. NeurIPS 2025Per-Architecture Training-Free Metric Optimization for Neural Architecture Search
  17. NeurIPS 2025Personalized Safety in LLMs: A Benchmark and A Planning-Based Agent Approach
  18. NeurIPS 2025PINNs with Learnable Quadrature
  19. NeurIPS 2025PlanU: Large Language Model Reasoning through Planning under Uncertainty
  20. NeurIPS 2025Progressive Inference-Time Annealing of Diffusion Models for Sampling from Boltzmann Densities
  21. NeurIPS 2025Prompted Policy Search: Reinforcement Learning through Linguistic and Numerical Reasoning in LLMs
  22. NeurIPS 2025ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search
  23. NeurIPS 2025Quantum speedup of non-linear Monte Carlo problems
  24. NeurIPS 2025Random Search Neural Networks for Efficient and Expressive Graph Learning
  25. NeurIPS 2025Regression-adjusted Monte Carlo Estimators for Shapley Values and Probabilistic Values
  26. NeurIPS 2025Results of the Big ANN: NeurIPS’23 competition
  27. NeurIPS 2025Retrosynthesis Planning via Worst-path Policy Optimisation in Tree-structured MDPs
  28. NeurIPS 2025Reverse Diffusion Sequential Monte Carlo Samplers
  29. NeurIPS 2025Reverse-Annealed Sequential Monte Carlo for Efficient Bayesian Optimal Experiment Design
  30. NeurIPS 2025RF-Agent: Automated Reward Function Design via Language Agent Tree Search
  31. NeurIPS 2025Robust Contextual Pricing
  32. NeurIPS 2025Rollout Roulette: A Probabilistic Inference Approach to Inference-Time Scaling of LLMs using Particle-Based Monte Carlo Methods
  33. NeurIPS 2025SCAN: Self-Denoising Monte Carlo Annotation for Robust Process Reward Learning
  34. NeurIPS 2025Schrödinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentres
  35. NeurIPS 2025SEEA-R1: Tree-Structured Reinforcement Fine-Tuning for Self-Evolving Embodied Agents
  36. NeurIPS 2025Sequential Monte Carlo for Policy Optimization in Continuous POMDPs
  37. NeurIPS 2025SIGMA: Refining Large Language Model Reasoning via Sibling-Guided Monte Carlo Augmentation
  38. NeurIPS 2025SolverLLM: Leveraging Test-Time Scaling for Optimization Problem via LLM-Guided Search
  39. NeurIPS 2025SoTA with Less: MCTS-Guided Sample Selection for Data-Efficient Visual Reasoning Self-Improvement
  40. NeurIPS 2025STree: Speculative Tree Decoding for Hybrid State Space Models
  41. NeurIPS 2025Structural Entropy Guided Agent for Detecting and Repairing Knowledge Deficiencies in LLMs
  42. NeurIPS 2025SYMPHONY: Synergistic Multi-agent Planning with Heterogeneous Language Model Assembly
  43. NeurIPS 2025T-REGS: Minimum Spanning Tree Regularization for Self-Supervised Learning
  44. NeurIPS 2025TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search
  45. NeurIPS 2025Test Time Scaling for Neural Processes
  46. NeurIPS 2025Test-Time Scaling of Diffusion Models via Noise Trajectory Search
  47. NeurIPS 2025TF-MAS: Training-free Mamba2 Architecture Search
  48. NeurIPS 2025The Complexity of Finding Local Optima in Contrastive Learning
  49. NeurIPS 2025Train on Pins and Test on Obstacles for Rectilinear Steiner Minimum Tree
  50. NeurIPS 2025Training-Free Guidance Beyond Differentiability: Scalable Path Steering with Tree Search in Diffusion and Flow Models

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

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