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

学习理论及相关：online_learning

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

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

代表论文

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

全部理论 · online learning论文

年份全部2023202420252026
会议全部NeurIPSICLRICMLCVPR

共 763 篇，第 11 / 16 页

  1. NeurIPS 2024Label Delay in Online Continual Learning
  2. NeurIPS 2024Learning from Snapshots of Discrete and Continuous Data Streams
  3. NeurIPS 2024Learning to Mitigate Externalities: the Coase Theorem with Hindsight Rationality
  4. NeurIPS 2024Learning to Price Homogeneous Data
  5. NeurIPS 2024Learning-Augmented Algorithms with Explicit Predictors
  6. NeurIPS 2024Linear Causal Bandits: Unknown Graph and Soft Interventions
  7. NeurIPS 2024Local and Adaptive Mirror Descents in Extensive-Form Games
  8. NeurIPS 2024Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
  9. NeurIPS 2024Localized Adaptive Risk Control
  10. NeurIPS 2024Locally Private and Robust Multi-Armed Bandits
  11. NeurIPS 2024Lookback Prophet Inequalities
  12. NeurIPS 2024Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning
  13. NeurIPS 2024Maximizing utility in multi-agent environments by anticipating the behavior of other learners
  14. NeurIPS 2024MetaCURL: Non-stationary Concave Utility Reinforcement Learning
  15. NeurIPS 2024Mixture of Experts Meets Prompt-Based Continual Learning
  16. NeurIPS 2024Multi-model Ensemble Conformal Prediction in Dynamic Environments
  17. NeurIPS 2024Multiclass Transductive Online Learning
  18. NeurIPS 2024Mutli-Armed Bandits with Network Interference
  19. NeurIPS 2024Near-Optimality of Contrastive Divergence Algorithms
  20. NeurIPS 2024Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
  21. NeurIPS 2024Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
  22. NeurIPS 2024No-Regret Bandit Exploration based on Soft Tree Ensemble Model
  23. NeurIPS 2024No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
  24. NeurIPS 2024No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
  25. NeurIPS 2024Non-Stationary Learning of Neural Networks with Automatic Soft Parameter Reset
  26. NeurIPS 2024Off-policy estimation with adaptively collected data: the power of online learning
  27. NeurIPS 2024On the Computational Landscape of Replicable Learning
  28. NeurIPS 2024On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice
  29. NeurIPS 2024On the Necessity of Collaboration for Online Model Selection with Decentralized Data
  30. NeurIPS 2024On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
  31. NeurIPS 2024On Weak Regret Analysis for Dueling Bandits
  32. NeurIPS 2024Online Adaptation of Language Models with a Memory of Amortized Contexts
  33. NeurIPS 2024Online Bayesian Persuasion Without a Clue
  34. NeurIPS 2024Online Budgeted Matching with General Bids
  35. NeurIPS 2024Online Classification with Predictions
  36. NeurIPS 2024Online Composite Optimization Between Stochastic and Adversarial Environments
  37. NeurIPS 2024Online Consistency of the Nearest Neighbor Rule
  38. NeurIPS 2024Online Control in Population Dynamics
  39. NeurIPS 2024Online Control with Adversarial Disturbance for Continuous-time Linear Systems
  40. NeurIPS 2024Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
  41. NeurIPS 2024Online Estimation via Offline Estimation: An Information-Theoretic Framework
  42. NeurIPS 2024Online Learning of Delayed Choices
  43. NeurIPS 2024Online Learning with Sublinear Best-Action Queries
  44. NeurIPS 2024Online Non-convex Learning in Dynamic Environments
  45. NeurIPS 2024Online Posterior Sampling with a Diffusion Prior
  46. NeurIPS 2024Online Weighted Paging with Unknown Weights
  47. NeurIPS 2024Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
  48. NeurIPS 2024Optimal Batched Best Arm Identification
  49. NeurIPS 2024Optimal Multi-Fidelity Best-Arm Identification
  50. NeurIPS 2024Optimal Multiclass U-Calibration Error and Beyond

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

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