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

主要结论

• 理论 · online learning论文从 2023 年的 164 篇增长到 2026 年的 190 篇，三年间扩大到约 1.2 倍。
• NeurIPS 是发理论 · online learning论文最多的会议，2023–2026 年共 427 篇，占四个会议总量的 56%。
• 交叉方向里涨得最快的是驾驶仿真：同时属于两个主题的论文从 2023 年的 1 篇增至 2026 年的 12 篇。
• 在「理论与统计」的 5 个主题里，它的 2026 年论文数排第 3；同组增长最快的理论 · learning theory是 5.6 倍，理论 · online learning是 1.2 倍。

代表论文

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

• NeurIPS 2026A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
• ICML 2026A Perturbation Approach to Unconstrained Linear Bandits
• ICLR 2026Rethinking Data Curation in LLM Training: Online Reweighting Offers Better Generalization than Offline Methods
• CVPR 2026An Optimal Transport-driven Approach for Cultivating Latent Space in Online
• NeurIPS 2025A Learning-Augmented Approach to Online Allocation Problems
• ICML 2025A Classification View on Meta Learning Bandits
• ICLR 2025Efficient Online Pruning and Abstraction for Imperfect Information Extensive-Form Games
• CVPR 2025InteractionMap: Improving Online Vectorized HDMap Construction with Interaction
• NeurIPS 2024A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
• ICML 2024On Online Experimentation without Device Identifiers
• ICLR 2024Improved Regret Bounds for Non-Convex Online-Within-Online Meta Learning
• CVPR 2024Dual-Enhanced Coreset Selection with Class-wise Collaboration for Online Blurry Class Incremental Learning
• NeurIPS 2023$\varepsilon$-fractional core stability in Hedonic Games.
• ICML 2023Applied Online Algorithms with Heterogeneous Predictors
• ICLR 2023Hebbian Deep Learning Without Feedback
• CVPR 2023VisFusion: Visibility-Aware Online 3D Scene Reconstruction From Videos
• NeurIPS 2026A Theory of Adversary-Directed Online Learning
• ICML 2026A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
• ICLR 2026A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solvers
• CVPR 2026Dynamic Momentum Recalibration in Online Gradient Learning

全部理论 · online learning论文

共 86 篇，第 1 / 2 页

1. ICML 2026A Direct Approach for Handling Contextual Bandits with Latent State Dynamics
2. ICML 2026A Fine-Grained Understanding of Uniform Convergence for Halfspaces
3. ICML 2026A Perturbation Approach to Unconstrained Linear Bandits
4. ICML 2026A Stronger Benchmark for Online Bilateral Trade: From Fixed Prices to Distributions
5. ICML 2026A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
6. ICML 2026Adaptive Bandit Algorithms for Contextual Matching Markets
7. ICML 2026Adversarially Robust Control of Conditional Value-at-Risk via Rockafellar-Uryasev Conformal Inference
8. ICML 2026Anytime-Valid Inference for Online Ranking of Large Language Models
9. ICML 2026Approximate Proportionality in Online Fair Division
10. ICML 2026Asymptotically Optimal Sequential Testing with Markovian Data
11. ICML 2026Beyond Binary: Continuous State Optimization with Graph-Structured Objectives
12. ICML 2026Beyond Euclidean Summaries: Online Change Point Detection for Distribution-Valued Data
13. ICML 2026Beyond First-order Asymptotics in Sequential Mean Testing
14. ICML 2026Beyond Point-wise Neural Collapse: A Topology-Aware Hierarchical Classifier for Class-Incremental Learning
15. ICML 2026Bilinear Bandits with Partially Observable Features
16. ICML 2026CLASP: Online learning algorithms for Convex Losses And Squared Penalties
17. ICML 2026Clipped Q-Learning: Your Value Clipping Is Secretly A Robust Operator
18. ICML 2026Contextual Slate GLM Bandits with Limited Adaptivity
19. ICML 2026Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference
20. ICML 2026CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM
21. ICML 2026Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
22. ICML 2026Data-Source Adaptive Online Learning under Heteroscedastic Noise
23. ICML 2026Decentralized Bandits without Global Clock for Dynamic Matching Market
24. ICML 2026Decentralized Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower Bounds
25. ICML 2026Doubly Outlier-Robust Online Infinite Hidden Markov Model
26. ICML 2026Efficient Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback
27. ICML 2026Efficiently Learning Drifting Halfspaces with Massart Noise
28. ICML 2026Exact Unlearning in Reinforcement Learning
29. ICML 2026Fast Non-Episodic Finite-Horizon RL with K-Step Lookahead Thresholding
30. ICML 2026Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
31. ICML 2026Generalized Linear Bandits with Memory
32. ICML 2026Hybrid Reinforcement Learning in Adversarial Markov Decision Processes
33. ICML 2026Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variation
34. ICML 2026Inference of Online Newton Methods with Nesterov's Accelerated Sketching
35. ICML 2026Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
36. ICML 2026Knowing Who, Not How Much: Learning-Augmented Mechanisms for Consumer Utility Maximization
37. ICML 2026Learning in Bayesian Stackelberg Games With Unknown Follower's Types
38. ICML 2026Learning in Structured Stackelberg Games
39. ICML 2026Learning-Augmented Online Covering Problems
40. ICML 2026Learning-Augmented Online Minimization with Dual Predictions
41. ICML 2026Learning-augmented Rent-or-Buy with a Sample
42. ICML 2026Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport
43. ICML 2026Logarithmic Switching Regret for Online Convex Optimization
44. ICML 2026MindZero: Learning Online Mental Reasoning With Zero Annotations
45. ICML 2026Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning
46. ICML 2026Minimax-Optimal Policy Regret in Partially Observable Markov Games
47. ICML 2026Modality-Decoupled Online Recursive Editing
48. ICML 2026Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
49. ICML 2026Neural Logistic Bandits
50. ICML 2026Next-Token Prediction and Regret Minimization

常见问题

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