理论 · 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 篇，第 12 / 16 页

  1. NeurIPS 2024Optimal Top-Two Method for Best Arm Identification and Fluid Analysis
  2. NeurIPS 2024Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits
  3. NeurIPS 2024Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms
  4. NeurIPS 2024Partial Structure Discovery is Sufficient for No-regret Learning in Causal Bandits
  5. NeurIPS 2024Piecewise-Stationary Bandits with Knapsacks
  6. NeurIPS 2024Preference-based Pure Exploration
  7. NeurIPS 2024Private Online Learning via Lazy Algorithms
  8. NeurIPS 2024PRODuctive bandits: Importance Weighting No More
  9. NeurIPS 2024Provably Efficient Interactive-Grounded Learning with Personalized Reward
  10. NeurIPS 2024Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning
  11. NeurIPS 2024Queueing Matching Bandits with Preference Feedback
  12. NeurIPS 2024RanDumb: Random Representations Outperform Online Continually Learned Representations
  13. NeurIPS 2024Reawakening knowledge: Anticipatory recovery from catastrophic interference via structured training
  14. NeurIPS 2024Reciprocal Learning
  15. NeurIPS 2024REDUCR: Robust Data Downsampling using Class Priority Reweighting
  16. NeurIPS 2024Regret Minimization in Stackelberg Games with Side Information
  17. NeurIPS 2024Reinforcement Learning Gradients as Vitamin for Online Finetuning Decision Transformers
  18. NeurIPS 2024RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation
  19. NeurIPS 2024Robust Neural Contextual Bandit against Adversarial Corruptions
  20. NeurIPS 2024Saliency-driven Experience Replay for Continual Learning
  21. NeurIPS 2024Sample Complexity of Posted Pricing for a Single Item
  22. NeurIPS 2024Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning
  23. NeurIPS 2024Sample-efficient Bayesian Optimisation Using Known Invariances
  24. NeurIPS 2024Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood
  25. NeurIPS 2024Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
  26. NeurIPS 2024Smoothed Online Classification can be Harder than Batch Classification
  27. NeurIPS 2024Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
  28. NeurIPS 2024Stabilizing Linear Passive-Aggressive Online Learning with Weighted Reservoir Sampling
  29. NeurIPS 2024Stabilizing Zero-Shot Prediction: A Novel Antidote to Forgetting in Continual Vision-Language Tasks
  30. NeurIPS 2024State-free Reinforcement Learning
  31. NeurIPS 2024Stochastic contextual bandits with graph feedback: from independence number to MAS number
  32. NeurIPS 2024Strategic Linear Contextual Bandits
  33. NeurIPS 2024Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
  34. NeurIPS 2024Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
  35. NeurIPS 2024Symmetric Linear Bandits with Hidden Symmetry
  36. NeurIPS 2024Taming Heavy-Tailed Losses in Adversarial Bandits and the Best-of-Both-Worlds Setting
  37. NeurIPS 2024Task Confusion and Catastrophic Forgetting in Class-Incremental Learning: A Mathematical Framework for Discriminative and Generative Modelings
  38. NeurIPS 2024Task-recency bias strikes back: Adapting covariances in Exemplar-Free Class Incremental Learning
  39. NeurIPS 2024Test-time Adaptation in Non-stationary Environments via Adaptive Representation Alignment
  40. NeurIPS 2024The Power of Resets in Online Reinforcement Learning
  41. NeurIPS 2024The Secretary Problem with Predicted Additive Gap
  42. NeurIPS 2024Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
  43. NeurIPS 2024Tight Rates for Bandit Control Beyond Quadratics
  44. NeurIPS 2024Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
  45. NeurIPS 2024Truthfulness of Calibration Measures
  46. NeurIPS 2024UDON: Universal Dynamic Online distillatioN for generic image representations
  47. NeurIPS 2024Universal Online Convex Optimization with $1$ Projection per Round
  48. NeurIPS 2024WATT: Weight Average Test Time Adaptation of CLIP
  49. NeurIPS 2024When Is Inductive Inference Possible?
  50. CVPR 2023Dealing With Cross-Task Class Discrimination in Online Continual 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 篇。

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