理论 · online learning论文趋势 2023–2026

学习理论及相关：online_learning

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

理论 · online learning论文数，按年份和会议
年份NeurIPSICLRICMLCVPR合计
202310117397164
202416913348224
20258918744185
20266827869190

代表论文

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

全部理论 · online learning论文

年份全部2023202420252026
会议全部NeurIPSICLRICMLCVPR

共 101 篇，第 2 / 3 页

  1. NeurIPS 2023Online Control for Meta-optimization
  2. NeurIPS 2023Online Convex Optimization with Unbounded Memory
  3. NeurIPS 2023Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
  4. NeurIPS 2023Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms
  5. NeurIPS 2023Online learning of long-range dependencies
  6. NeurIPS 2023Online Learning under Adversarial Nonlinear Constraints
  7. NeurIPS 2023Online List Labeling with Predictions
  8. NeurIPS 2023Online Nonstochastic Model-Free Reinforcement Learning
  9. NeurIPS 2023Online PCA in Converging Self-consistent Field Equations
  10. NeurIPS 2023Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games
  11. NeurIPS 2023Online Pricing for Multi-User Multi-Item Markets
  12. NeurIPS 2023Online RL in Linearly $q^\pi$-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore
  13. NeurIPS 2023Online robust non-stationary estimation
  14. NeurIPS 2023Optimal Learners for Realizable Regression: PAC Learning and Online Learning
  15. NeurIPS 2023Optimal Rates for Bandit Nonstochastic Control
  16. NeurIPS 2023Optimistic Meta-Gradients
  17. NeurIPS 2023Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL
  18. NeurIPS 2023Partial Matrix Completion
  19. NeurIPS 2023Perceptual Kalman Filters: Online State Estimation under a Perfect Perceptual-Quality Constraint
  20. NeurIPS 2023Physion++: Evaluating Physical Scene Understanding that Requires Online Inference of Different Physical Properties
  21. NeurIPS 2023Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data
  22. NeurIPS 2023Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games
  23. NeurIPS 2023Practical Contextual Bandits with Feedback Graphs
  24. NeurIPS 2023Projection-Free Online Convex Optimization via Efficient Newton Iterations
  25. NeurIPS 2023Quantifying & Modeling Multimodal Interactions: An Information Decomposition Framework
  26. NeurIPS 2023Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time
  27. NeurIPS 2023Reliable learning in challenging environments
  28. NeurIPS 2023Replicable Clustering
  29. NeurIPS 2023Residual Q-Learning: Offline and Online Policy Customization without Value
  30. NeurIPS 2023Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning
  31. NeurIPS 2023Riemannian Projection-free Online Learning
  32. NeurIPS 2023Robust Knowledge Transfer in Tiered Reinforcement Learning
  33. NeurIPS 2023Selective Sampling and Imitation Learning via Online Regression
  34. NeurIPS 2023Sharp Spectral Rates for Koopman Operator Learning
  35. NeurIPS 2023Smoothed Analysis of Sequential Probability Assignment
  36. NeurIPS 2023Smoothed Online Learning for Prediction in Piecewise Affine Systems
  37. NeurIPS 2023Strategic Apple Tasting
  38. NeurIPS 2023Strategic Classification under Unknown Personalized Manipulation
  39. NeurIPS 2023Strategic Data Sharing between Competitors
  40. NeurIPS 2023Structured Prediction with Stronger Consistency Guarantees
  41. NeurIPS 2023Supervised Pretraining Can Learn In-Context Reinforcement Learning
  42. NeurIPS 2023The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning
  43. NeurIPS 2023The Gain from Ordering in Online Learning
  44. NeurIPS 2023Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
  45. NeurIPS 2023Train Once, Get a Family: State-Adaptive Balances for Offline-to-Online Reinforcement Learning
  46. NeurIPS 2023Two-Stage Learning to Defer with Multiple Experts
  47. NeurIPS 2023Unconstrained Dynamic Regret via Sparse Coding
  48. NeurIPS 2023Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
  49. NeurIPS 2023Variance-Reduced Gradient Estimation via Noise-Reuse in Online Evolution Strategies
  50. NeurIPS 2023When Do Transformers Shine in RL? Decoupling Memory from Credit Assignment

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

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

可以直接复制这句话问 AI

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

AI 会调用的工具：get_topic_stats {"topic": "theory-online-learning"}

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

常见问题

2023–2026 年四大会议一共有多少篇理论 · online learning论文？
共 763 篇，按年份分别是 2023 年 164 篇、2024 年 224 篇、2025 年 185 篇、2026 年 190 篇。
NeurIPS 2026 有多少篇理论 · online learning论文？
NeurIPS 2026 有 68 篇理论 · online learning论文，上一届是 89 篇。
ICLR 2026 有多少篇理论 · online learning论文？
ICLR 2026 有 27 篇理论 · online learning论文，上一届是 18 篇。
ICML 2026 有多少篇理论 · online learning论文？
ICML 2026 有 86 篇理论 · online learning论文，上一届是 74 篇。
CVPR 2026 有多少篇理论 · online learning论文？
CVPR 2026 有 9 篇理论 · online learning论文，上一届是 4 篇。
哪个会议的理论 · online learning论文最多？
NeurIPS，2023–2026 年共 427 篇。

「理论与统计」下的其他主题