强化学习论文趋势 2023–2026

策略优化、离线 RL 与基于环境的决策学习

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

强化学习论文数,按年份和会议
年份NeurIPSICLRICMLCVPR合计
2023484233297561,070
2024466304356641,190
2025784379405721,640
20267609111,0212932,985

代表论文

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

全部强化学习论文

共 405 篇,第 6 / 9 页

  1. ICML 2025Online Robust Reinforcement Learning Through Monte-Carlo Planning
  2. ICML 2025Optimizing Language Models for Inference Time Objectives using Reinforcement Learning
  3. ICML 2025Optimizing Test-Time Compute via Meta Reinforcement Finetuning
  4. ICML 2025Outsourced Diffusion Sampling: Efficient Posterior Inference in Latent Spaces of Generative Models
  5. ICML 2025Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization
  6. ICML 2025Partially Observable Reinforcement Learning with Memory Traces
  7. ICML 2025Penalizing Infeasible Actions and Reward Scaling in Reinforcement Learning with Offline Data
  8. ICML 2025Pessimism Principle Can Be Effective: Towards a Framework for Zero-Shot Transfer Reinforcement Learning
  9. ICML 2025PIGDreamer: Privileged Information Guided World Models for Safe Partially Observable Reinforcement Learning
  10. ICML 2025PILAF: Optimal Human Preference Sampling for Reward Modeling
  11. ICML 2025PIPA: Preference Alignment as Prior-Informed Statistical Estimation
  12. ICML 2025Policy Filtration for RLHF to Mitigate Noise in Reward Models
  13. ICML 2025Policy Gradient with Tree Expansion
  14. ICML 2025Policy Guided Tree Search for Enhanced LLM Reasoning
  15. ICML 2025Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints
  16. ICML 2025Policy Regularization on Globally Accessible States in Cross-Dynamics Reinforcement Learning
  17. ICML 2025Policy-labeled Preference Learning: Is Preference Enough for RLHF?
  18. ICML 2025Policy-Regret Minimization in Markov Games with Function Approximation
  19. ICML 2025Polynomial-Time Approximability of Constrained Reinforcement Learning
  20. ICML 2025Position: Constants are Critical in Regret Bounds for Reinforcement Learning
  21. ICML 2025Position: General Intelligence Requires Reward-based Pretraining
  22. ICML 2025Position: Iterative Online-Offline Joint Optimization is Needed to Manage Complex LLM Copyright Risks
  23. ICML 2025Position: Lifetime tuning is incompatible with continual reinforcement learning
  24. ICML 2025Position: LLMs Need a Bayesian Meta-Reasoning Framework for More Robust and Generalizable Reasoning
  25. ICML 2025Position: We Need An Algorithmic Understanding of Generative AI
  26. ICML 2025Power Mean Estimation in Stochastic Continuous Monte-Carlo Tree Search
  27. ICML 2025Preference Adaptive and Sequential Text-to-Image Generation
  28. ICML 2025Preference Controllable Reinforcement Learning with Advanced Multi-Objective Optimization
  29. ICML 2025Preference Optimization for Combinatorial Optimization Problems
  30. ICML 2025Private Federated Learning using Preference-Optimized Synthetic Data
  31. ICML 2025Progressively Label Enhancement for Large Language Model Alignment
  32. ICML 2025Projection Optimization: A General Framework for Multi-Objective and Multi-Group RLHF
  33. ICML 2025Proto Successor Measure: Representing the Behavior Space of an RL Agent
  34. ICML 2025Provable Maximum Entropy Manifold Exploration via Diffusion Models
  35. ICML 2025Provable Policy Gradient for Robust Average-Reward MDPs Beyond Rectangularity
  36. ICML 2025Provable Zero-Shot Generalization in Offline Reinforcement Learning
  37. ICML 2025Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
  38. ICML 2025Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces
  39. ICML 2025Q-Supervised Contrastive Representation: A State Decoupling Framework for Safe Offline Reinforcement Learning
  40. ICML 2025QPRL : Learning Optimal Policies with Quasi-Potential Functions for Asymmetric Traversal
  41. ICML 2025Quantum Algorithms for Finite-horizon Markov Decision Processes
  42. ICML 2025Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
  43. ICML 2025R*: Efficient Reward Design via Reward Structure Evolution and Parameter Alignment Optimization with Large Language Models
  44. ICML 2025R3DM: Enabling Role Discovery and Diversity Through Dynamics Models in Multi-agent Reinforcement Learning
  45. ICML 2025Random Policy Evaluation Uncovers Policies of Generative Flow Networks
  46. ICML 2025Rank-One Modified Value Iteration
  47. ICML 2025Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens
  48. ICML 2025Regret-Free Reinforcement Learning for Temporal Logic Specifications
  49. ICML 2025Reidentify: Context-Aware Identity Generation for Contextual Multi-Agent Reinforcement Learning
  50. ICML 2025ReinboT: Amplifying Robot Visual-Language Manipulation with Reinforcement Learning

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

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

可以直接复制这句话问 AI

用 paperlist 查强化学习在 NeurIPS 2023–2026 的论文趋势,哪一年涨得最快?

AI 会调用的工具:get_topic_stats {"topic": "reinforcement-learning"}

两分钟接入 Paperlist MCP(Claude Code、Cursor、Codex、ChatGPT)

常见问题

2023–2026 年四大会议一共有多少篇强化学习论文?
共 6,885 篇,按年份分别是 2023 年 1,070 篇、2024 年 1,190 篇、2025 年 1,640 篇、2026 年 2,985 篇。
NeurIPS 2026 有多少篇强化学习论文?
NeurIPS 2026 有 760 篇强化学习论文,上一届是 784 篇。
ICLR 2026 有多少篇强化学习论文?
ICLR 2026 有 911 篇强化学习论文,上一届是 379 篇。
ICML 2026 有多少篇强化学习论文?
ICML 2026 有 1,021 篇强化学习论文,上一届是 405 篇。
CVPR 2026 有多少篇强化学习论文?
CVPR 2026 有 293 篇强化学习论文,上一届是 72 篇。
哪个会议的强化学习论文最多?
NeurIPS,2023–2026 年共 2,494 篇。