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

学习理论及相关：online_learning

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

主要结论

每年论文数

各会议论文数

按年份和会议统计

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

代表论文

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

全部理论 · online learning论文

年份全部2023202420252026
会议全部NeurIPSICLRICMLCVPR

共 224 篇，第 2 / 5 页

  1. ICML 2024Position: Machine Learning-powered Assessments of the EU Digital Services Act Aid Quantify Policy Impacts on Online Harms
  2. ICML 2024Predictive Linear Online Tracking for Unknown Targets
  3. ICML 2024Rethinking Momentum Knowledge Distillation in Online Continual Learning
  4. ICML 2024Scalable Online Exploration via Coverability
  5. ICML 2024Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
  6. NeurIPS 2024A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
  7. NeurIPS 2024A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
  8. NeurIPS 2024A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds
  9. NeurIPS 2024A Simple and Optimal Approach for Universal Online Learning with Gradient Variations
  10. NeurIPS 2024A Theory of Optimistically Universal Online Learnability for General Concept Classes
  11. NeurIPS 2024A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
  12. NeurIPS 2024Accelerated Regularized Learning in Finite N-Person Games
  13. NeurIPS 2024Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process
  14. NeurIPS 2024Adaptive Experimentation When You Can't Experiment
  15. NeurIPS 2024Adaptive Passive-Aggressive Framework for Online Regression with Side Information
  16. NeurIPS 2024Adaptive Sampling for Efficient Softmax Approximation
  17. NeurIPS 2024Addressing Bias in Online Selection with Limited Budget of Comparisons
  18. NeurIPS 2024Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
  19. NeurIPS 2024Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
  20. NeurIPS 2024An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints
  21. NeurIPS 2024An engine not a camera: Measuring performative power of online search
  22. NeurIPS 2024An Equivalence Between Static and Dynamic Regret Minimization
  23. NeurIPS 2024Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
  24. NeurIPS 2024Bandits with Abstention under Expert Advice
  25. NeurIPS 2024Bandits with Preference Feedback: A Stackelberg Game Perspective
  26. NeurIPS 2024Bandits with Ranking Feedback
  27. NeurIPS 2024Barely Random Algorithms and Collective Metrical Task Systems
  28. NeurIPS 2024Bayesian Online Natural Gradient (BONG)
  29. NeurIPS 2024Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
  30. NeurIPS 2024Beyond task diversity: provable representation transfer for sequential multitask linear bandits
  31. NeurIPS 2024Can large language models explore in-context?
  32. NeurIPS 2024Communication Bounds for the Distributed Experts Problem
  33. NeurIPS 2024Contextual Active Model Selection
  34. NeurIPS 2024Contextual Decision-Making with Knapsacks Beyond the Worst Case
  35. NeurIPS 2024Contextual Multinomial Logit Bandits with General Value Functions
  36. NeurIPS 2024Continual Learning with Global Alignment
  37. NeurIPS 2024Continual learning with the neural tangent ensemble
  38. NeurIPS 2024CONTRAST: Continual Multi-source Adaptation to Dynamic Distributions
  39. NeurIPS 2024Convergence of No-Swap-Regret Dynamics in Self-Play
  40. NeurIPS 2024Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
  41. NeurIPS 2024Dealing with Synthetic Data Contamination in Online Continual Learning
  42. NeurIPS 2024Disentangling and mitigating the impact of task similarity for continual learning
  43. NeurIPS 2024Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms
  44. NeurIPS 2024Dueling over Dessert, Mastering the Art of Repeated Cake Cutting
  45. NeurIPS 2024Dynamic Service Fee Pricing under Strategic Behavior: Actions as Instruments and Phase Transition
  46. NeurIPS 2024Efficient Prompt Optimization Through the Lens of Best Arm Identification
  47. NeurIPS 2024Enhancing Preference-based Linear Bandits via Human Response Time
  48. NeurIPS 2024Ensemble sampling for linear bandits: small ensembles suffice
  49. NeurIPS 2024Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
  50. NeurIPS 2024F-OAL: Forward-only Online Analytic Learning with Fast Training and Low Memory Footprint in Class Incremental Learning

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

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