强化学习论文趋势 2023–2026

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

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

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

代表论文

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

全部强化学习论文

共 297 篇,第 4 / 6 页

  1. ICML 2023Meta Optimal Transport
  2. ICML 2023Meta-learning Parameterized Skills
  3. ICML 2023Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization
  4. ICML 2023MetaDiffuser: Diffusion Model as Conditional Planner for Offline Meta-RL
  5. ICML 2023Model Transferability with Responsive Decision Subjects
  6. ICML 2023Model-agnostic Measure of Generalization Difficulty
  7. ICML 2023Model-based Offline Reinforcement Learning with Count-based Conservatism
  8. ICML 2023Model-based Reinforcement Learning with Scalable Composite Policy Gradient Estimators
  9. ICML 2023Model-Bellman Inconsistency for Model-based Offline Reinforcement Learning
  10. ICML 2023Model-Free Robust Average-Reward Reinforcement Learning
  11. ICML 2023Multi-Agent Learning from Learners
  12. ICML 2023Multi-Environment Pretraining Enables Transfer to Action Limited Datasets
  13. ICML 2023Multi-task Hierarchical Adversarial Inverse Reinforcement Learning
  14. ICML 2023Multi-Task Off-Policy Learning from Bandit Feedback
  15. ICML 2023Multi-User Reinforcement Learning with Low Rank Rewards
  16. ICML 2023Multiply Robust Off-policy Evaluation and Learning under Truncation by Death
  17. ICML 2023N$\text{A}^\text{2}$Q: Neural Attention Additive Model for Interpretable Multi-Agent Q-Learning
  18. ICML 2023Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR
  19. ICML 2023Near-Optimal $\Phi$-Regret Learning in Extensive-Form Games
  20. ICML 2023Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints
  21. ICML 2023Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes
  22. ICML 2023Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback
  23. ICML 2023Neural Collapse in Deep Linear Networks: From Balanced to Imbalanced Data
  24. ICML 2023Non-stationary Reinforcement Learning under General Function Approximation
  25. ICML 2023Off-Policy Average Reward Actor-Critic with Deterministic Policy Search
  26. ICML 2023Offline Learning in Markov Games with General Function Approximation
  27. ICML 2023Offline Meta Reinforcement Learning with In-Distribution Online Adaptation
  28. ICML 2023Offline Reinforcement Learning with Closed-Form Policy Improvement Operators
  29. ICML 2023On Penalty-based Bilevel Gradient Descent Method
  30. ICML 2023On the Convergence of SARSA with Linear Function Approximation
  31. ICML 2023On the Effectiveness of Offline RL for Dialogue Response Generation
  32. ICML 2023On the Global Convergence of Risk-Averse Policy Gradient Methods with Expected Conditional Risk Measures
  33. ICML 2023On the Importance of Feature Decorrelation for Unsupervised Representation Learning in Reinforcement Learning
  34. ICML 2023On the Power of Pre-training for Generalization in RL: Provable Benefits and Hardness
  35. ICML 2023One-sided Matrix Completion from Two Observations Per Row
  36. ICML 2023Optimal Goal-Reaching Reinforcement Learning via Quasimetric Learning
  37. ICML 2023Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs
  38. ICML 2023Optimizing DDPM Sampling with Shortcut Fine-Tuning
  39. ICML 2023Oracles & Followers: Stackelberg Equilibria in Deep Multi-Agent Reinforcement Learning
  40. ICML 2023PAC-Bayesian Offline Contextual Bandits With Guarantees
  41. ICML 2023Parallel $Q$-Learning: Scaling Off-policy Reinforcement Learning under Massively Parallel Simulation
  42. ICML 2023Partially Observable Multi-agent RL with (Quasi-)Efficiency: The Blessing of Information Sharing
  43. ICML 2023Performative Reinforcement Learning
  44. ICML 2023PFNs4BO: In-Context Learning for Bayesian Optimization
  45. ICML 2023Policy Contrastive Imitation Learning
  46. ICML 2023Policy Evaluation and Temporal-Difference Learning in Continuous Time and Space: A Martingale Approach
  47. ICML 2023Policy Gradient in Robust MDPs with Global Convergence Guarantee
  48. ICML 2023Policy Regularization with Dataset Constraint for Offline Reinforcement Learning
  49. ICML 2023Posterior Sampling for Deep Reinforcement Learning
  50. ICML 2023PPG Reloaded: An Empirical Study on What Matters in Phasic Policy Gradient

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