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

  1. NeurIPS 2025Efficient Training-Free Online Routing for High-Volume Multi-LLM Serving
  2. NeurIPS 2025Explaining the Law of Supply and Demand via Online Learning
  3. NeurIPS 2025Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL
  4. NeurIPS 2025Exploring the Noise Robustness of Online Conformal Prediction
  5. NeurIPS 2025Fair Matroid Selection
  6. NeurIPS 2025Finite Sample Analyses for Continuous-time Linear Systems: System Identification and Online Control
  7. NeurIPS 2025From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
  8. NeurIPS 2025Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
  9. NeurIPS 2025Gradient Descent as Loss Landscape Navigation: a Normative Framework for Deriving Learning Rules
  10. NeurIPS 2025Gradient-Guided Epsilon Constraint Method for Online Continual Learning
  11. NeurIPS 2025High-Dimensional Calibration from Swap Regret
  12. NeurIPS 2025HyGen: Efficient LLM Serving via Elastic Online-Offline Request Co-location
  13. NeurIPS 2025Imagine Beyond ! Distributionally Robust Autoencoding for State Space Coverage in Online Reinforcement Learning
  14. NeurIPS 2025Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
  15. NeurIPS 2025Incentive-Aware Dynamic Resource Allocation under Long-Term Cost Constraints
  16. NeurIPS 2025Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
  17. NeurIPS 2025Kernel conditional tests from learning-theoretic bounds
  18. NeurIPS 2025Last-Iterate Convergence of Smooth Regret Matching$^+$ Variants in Learning Nash Equilibria
  19. NeurIPS 2025Learning Across the Gap: Hybrid Multi-armed Bandits with Heterogeneous Offline and Online Data
  20. NeurIPS 2025Learning Orthogonal Multi-Index Models: A Fine-Grained Information Exponent Analysis
  21. NeurIPS 2025Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed Rewards
  22. NeurIPS 2025Learning Preferences without Interaction for Cooperative AI: A Hybrid Offline-Online Approach
  23. NeurIPS 2025Learning-Augmented Algorithms for $k$-median via Online Learning
  24. NeurIPS 2025Learning-Augmented Online Bidding in Stochastic Settings
  25. NeurIPS 2025Learning-Augmented Online Bipartite Fractional Matching
  26. NeurIPS 2025Lyapunov-Stable Adaptive Control for Multimodal Concept Drift
  27. NeurIPS 2025Maximizing the Value of Predictions in Control: Accuracy Is Not Enough
  28. NeurIPS 2025Minimax Adaptive Online Nonparametric Regression over Besov spaces
  29. NeurIPS 2025Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
  30. NeurIPS 2025Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
  31. NeurIPS 2025Near-Optimal Sample Complexity for Online Constrained MDPs
  32. NeurIPS 2025No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
  33. NeurIPS 2025No-Regret Online Autobidding Algorithms in First-price Auctions
  34. NeurIPS 2025Non-Clairvoyant Scheduling with Progress Bars
  35. NeurIPS 2025Non-stationary Bandit Convex Optimization: A Comprehensive Study
  36. NeurIPS 2025Non-Uniform Multiclass Learning with Bandit Feedback
  37. NeurIPS 2025On the necessity of adaptive regularisation: Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
  38. NeurIPS 2025On the Universal Near Optimality of Hedge in Combinatorial Settings
  39. NeurIPS 2025On Union-Closedness of Language Generation
  40. NeurIPS 2025Online Bilateral Trade With Minimal Feedback: Don’t Waste Seller’s Time
  41. NeurIPS 2025Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
  42. NeurIPS 2025Online Learning in the Repeated Mediated Newsvendor Problem
  43. NeurIPS 2025Online Learning of Neural Networks
  44. NeurIPS 2025Online Learning of Pure States is as Hard as Mixed States
  45. NeurIPS 2025Online Locally Differentially Private Conformal Prediction via Binary Inquiries
  46. NeurIPS 2025Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making
  47. NeurIPS 2025Online Portfolio Selection with ML Predictions
  48. NeurIPS 2025Online Prediction with Limited Selectivity
  49. NeurIPS 2025Online robust locally differentially private learning for nonparametric regression
  50. NeurIPS 2025Online Segment Any 3D Thing as Instance Tracking

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

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