理论 · 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论文

共 185 篇，第 1 / 4 页

1. CVPR 2025Ferret: An Efficient Online Continual Learning Framework under Varying Memory Constraints
2. CVPR 2025InteractionMap: Improving Online Vectorized HDMap Construction with Interaction
3. CVPR 2025Label Shift Meets Online Learning: Ensuring Consistent Adaptation with Universal Dynamic Regret
4. CVPR 2025Online Task-Free Continual Learning via Dynamic Expansionable Memory Distribution
5. ICLR 2025Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits
6. ICLR 2025An Online Learning Theory of Trading-Volume Maximization
7. ICLR 2025Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts
8. ICLR 2025DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
9. ICLR 2025Efficient Online Pruning and Abstraction for Imperfect Information Extensive-Form Games
10. ICLR 2025Event-Driven Online Vertical Federated Learning
11. ICLR 2025Feature-Based Online Bilateral Trade
12. ICLR 2025Hessian-Free Online Certified Unlearning
13. ICLR 2025Longhorn: State Space Models are Amortized Online Learners
14. ICLR 2025Minimalistic Predictions for Online Class Constraint Scheduling
15. ICLR 2025On Bits and Bandits: Quantifying the Regret-Information Trade-off
16. ICLR 2025Online Clustering with Nearly Optimal Consistency
17. ICLR 2025ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS
18. ICLR 2025Online Reinforcement Learning in Non-Stationary Context-Driven Environments
19. ICLR 2025Optimal Protocols for Continual Learning via Statistical Physics and Control Theory
20. ICLR 2025Policy Decorator: Model-Agnostic Online Refinement for Large Policy Model
21. ICLR 2025Satisficing Regret Minimization in Bandits
22. ICLR 2025Simplifying Deep Temporal Difference Learning
23. ICML 2025A Classification View on Meta Learning Bandits
24. ICML 2025A Online Statistical Framework for Out-of-Distribution Detection
25. ICML 2025A Parametric Contextual Online Learning Theory of Brokerage
26. ICML 2025A Trichotomy for List Transductive Online Learning
27. ICML 2025AKORN: Adaptive Knots generated Online for RegressioN splines
28. ICML 2025Algorithms with Calibrated Machine Learning Predictions
29. ICML 2025Avoiding Catastrophe in Online Learning by Asking for Help
30. ICML 2025Best of Both Worlds: Regret Minimization versus Minimax Play
31. ICML 2025Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
32. ICML 2025Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
33. ICML 2025Competitively Consistent Clustering
34. ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
35. ICML 2025Constrained Pareto Set Identification with Bandit Feedback
36. ICML 2025Contextual Bandits for Unbounded Context Distributions
37. ICML 2025Contextual Linear Bandits with Delay as Payoff
38. ICML 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regression
39. ICML 2025DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models
40. ICML 2025Dimension-Free Adaptive Subgradient Methods with Frequent Directions
41. ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
42. ICML 2025Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions
43. ICML 2025Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
44. ICML 2025Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
45. ICML 2025Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems
46. ICML 2025Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
47. ICML 2025Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
48. ICML 2025High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
49. ICML 2025High-Dimensional Prediction for Sequential Decision Making
50. ICML 2025Improved Online Confidence Bounds for Multinomial Logistic Bandits

常见问题

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