通用机器学习 · online learning论文趋势 2023–2026
通用机器学习：online_learning
统计范围：NeurIPS、ICLR、ICML、CVPR 四个会议，2023–2026 年，共 416 篇被归入该主题的论文。
主要结论
- 通用机器学习 · online learning论文从 2023 年的 107 篇降到 2026 年的 105 篇，热度在回落。
- NeurIPS 是发通用机器学习 · online learning论文最多的会议，2023–2026 年共 199 篇，占四个会议总量的 48%。
- 交叉方向里涨得最快的是理论 · optimization：同时属于两个主题的论文从 2023 年的 0 篇增至 2026 年的 6 篇。
- 在「通用机器学习」的 6 个主题里，它的 2026 年论文数排第 6；同组增长最快的通用机器学习 · evaluation是 4.3 倍，通用机器学习 · online learning是 1.0 倍。
各会议论文数
按年份和会议统计
| 年份 | NeurIPS | ICLR | ICML | CVPR | 合计 |
|---|---|---|---|---|---|
| 2023 | 58 | 9 | 36 | 4 | 107 |
| 2024 | 48 | 9 | 33 | 6 | 96 |
| 2025 | 59 | 9 | 37 | 3 | 108 |
| 2026 | 34 | 13 | 49 | 9 | 105 |
代表论文
按年份和会议均匀挑选，方便快速看到每一届的样貌
- NeurIPS 2026$\delta$-Mem: : Efficient Online Memory For Large Language Models
- ICML 2026Beyond Point-wise Neural Collapse: A Topology-Aware Hierarchical Classifier for Class-Incremental Learning
- ICLR 2026Rethinking Data Curation in LLM Training: Online Reweighting Offers Better Generalization than Offline Methods
- CVPR 2026Dynamic Momentum Recalibration in Online Gradient Learning
- NeurIPS 2025$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
- ICML 2025A Online Statistical Framework for Out-of-Distribution Detection
- ICLR 2025Event-Driven Online Vertical Federated Learning
- CVPR 2025InteractionMap: Improving Online Vectorized HDMap Construction with Interaction
- NeurIPS 2024A Theory of Optimistically Universal Online Learnability for General Concept Classes
- ICML 2024A General Online Algorithm for Optimizing Complex Performance Metrics
- ICLR 2024Learning No-Regret Sparse Generalized Linear Models with Varying Observation(s)
- CVPR 2024Dual-Enhanced Coreset Selection with Class-wise Collaboration for Online Blurry Class Incremental Learning
- NeurIPS 2023A Batch-to-Online Transformation under Random-Order Model
- ICML 2023Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning
- ICLR 2023Online Bias Correction for Task-Free Continual Learning
- CVPR 2023VisFusion: Visibility-Aware Online 3D Scene Reconstruction From Videos
- NeurIPS 2026A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
- ICML 2026CARE: Adaptive Calibration for Reliable Recommendations
- ICLR 2026Semi-Parametric Contextual Pricing with General Smoothness
- CVPR 2026Online3R Online Learning for Consistent Sequential Reconstruction Based on Geometry
全部通用机器学习 · online learning论文
共 155 篇，第 2 / 4 页
- ICML 2025A Trichotomy for List Transductive Online Learning
- ICML 2025Adaptive Data Collection for Robust Learning Across Multiple Distributions
- ICML 2025AKORN: Adaptive Knots generated Online for RegressioN splines
- ICML 2025An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
- ICML 2025Avoiding Catastrophe in Online Learning by Asking for Help
- ICML 2025Competing Bandits in Matching Markets via Super Stability
- ICML 2025Competitively Consistent Clustering
- ICML 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regression
- ICML 2025Cut out and Replay: A Simple yet Versatile Strategy for Multi-Label Online Continual Learning
- ICML 2025e-GAI: e-value-based Generalized $\alpha$-Investing for Online False Discovery Rate Control
- ICML 2025General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
- ICML 2025Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
- ICML 2025Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
- ICML 2025Improved Online Confidence Bounds for Multinomial Logistic Bandits
- ICML 2025Learning Adversarial MDPs with Stochastic Hard Constraints
- ICML 2025Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
- ICML 2025No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
- ICML 2025Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
- ICML 2025On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning
- ICML 2025One-Pass Feature Evolvable Learning with Theoretical Guarantees
- ICML 2025Online Clustering of Dueling Bandits
- ICML 2025Online Detection of LLM-Generated Texts via Sequential Hypothesis Testing by Betting
- ICML 2025Online Differentially Private Conformal Prediction for Uncertainty Quantification
- ICML 2025Online Episodic Convex Reinforcement Learning
- ICML 2025Online Learning in Risk Sensitive constrained MDP
- ICML 2025Online Learning in the Random-Order Model
- ICML 2025Online Learning with Unknown Constraints
- ICML 2025Online Linear Classification with Massart Noise
- ICML 2025Online Pre-Training for Offline-to-Online Reinforcement Learning
- ICML 2025Online Sparsification of Bipartite-Like Clusters in Graphs
- ICML 2025Revisiting Differentially Private Algorithms for Decentralized Online Learning
- ICML 2025Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
- ICML 2025Stochastic Online Conformal Prediction with Semi-Bandit Feedback
- ICML 2025The Relationship Between No-Regret Learning and Online Conformal Prediction
- ICML 2025Unconstrained Robust Online Convex Optimization
- ICML 2025Wait-Less Offline Tuning and Re-solving for Online Decision Making
- ICML 2024A General Online Algorithm for Optimizing Complex Performance Metrics
- ICML 2024Adaptively Learning to Select-Rank in Online Platforms
- ICML 2024Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
- ICML 2024Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning
- ICML 2024Convergence of Online Learning Algorithm for a Mixture of Multiple Linear Regressions
- ICML 2024Discounted Adaptive Online Learning: Towards Better Regularization
- ICML 2024Efficient Online Set-valued Classification with Bandit Feedback
- ICML 2024Graph2Tac: Online Representation Learning of Formal Math Concepts
- ICML 2024Human Alignment of Large Language Models through Online Preference Optimisation
- ICML 2024Layerwise Proximal Replay: A Proximal Point Method for Online Continual Learning
- ICML 2024Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces
- ICML 2024MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
- ICML 2024Model-Free Robust $\phi$-Divergence Reinforcement Learning Using Both Offline and Online Data
- ICML 2024Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
在 Claude、Cursor 里直接问这个趋势
接上 Paperlist MCP 后，写综述、挑方向或准备投稿时，不用离开对话框就能拿到这页的数字：每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文，AI 会按你的问题整理。
可以直接复制这句话问 AI
用 paperlist 查通用机器学习 · online learning在 NeurIPS 2023–2026 的论文趋势，哪一年涨得最快？
AI 会调用的工具：get_topic_stats {"topic": "gml-online-learning"}
常见问题
- 2023–2026 年四大会议一共有多少篇通用机器学习 · online learning论文？
- 共 416 篇，按年份分别是 2023 年 107 篇、2024 年 96 篇、2025 年 108 篇、2026 年 105 篇。
- NeurIPS 2026 有多少篇通用机器学习 · online learning论文？
- NeurIPS 2026 有 34 篇通用机器学习 · online learning论文，上一届是 59 篇。
- ICLR 2026 有多少篇通用机器学习 · online learning论文？
- ICLR 2026 有 13 篇通用机器学习 · online learning论文，上一届是 9 篇。
- ICML 2026 有多少篇通用机器学习 · online learning论文？
- ICML 2026 有 49 篇通用机器学习 · online learning论文，上一届是 37 篇。
- CVPR 2026 有多少篇通用机器学习 · online learning论文？
- CVPR 2026 有 9 篇通用机器学习 · online learning论文，上一届是 3 篇。
- 哪个会议的通用机器学习 · online learning论文最多？
- NeurIPS，2023–2026 年共 199 篇。