理论 · online learning论文趋势 2023–2026
学习理论及相关:online_learning
统计范围:NeurIPS、ICLR、ICML、CVPR 四个会议,2023–2026 年,共 763 篇被归入该主题的论文。
主要结论
- 理论 · 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 | ICLR | ICML | CVPR | 合计 |
|---|---|---|---|---|---|
| 2023 | 101 | 17 | 39 | 7 | 164 |
| 2024 | 169 | 13 | 34 | 8 | 224 |
| 2025 | 89 | 18 | 74 | 4 | 185 |
| 2026 | 68 | 27 | 86 | 9 | 190 |
代表论文
按年份和会议均匀挑选,方便快速看到每一届的样貌
- 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论文
共 101 篇,第 1 / 3 页
- NeurIPS 2023$\varepsilon$-fractional core stability in Hedonic Games.
- NeurIPS 2023A Batch-to-Online Transformation under Random-Order Model
- NeurIPS 2023A Theory of Multimodal Learning
- NeurIPS 2023A Trichotomy for Transductive Online Learning
- NeurIPS 2023Adapting to Continuous Covariate Shift via Online Density Ratio Estimation
- NeurIPS 2023Adaptive Selective Sampling for Online Prediction with Experts
- NeurIPS 2023Adjustable Robust Reinforcement Learning for Online 3D Bin Packing
- NeurIPS 2023Adversarial Attacks on Online Learning to Rank with Click Feedback
- NeurIPS 2023Advice Querying under Budget Constraint for Online Algorithms
- NeurIPS 2023Alternation makes the adversary weaker in two-player games
- NeurIPS 2023An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits
- NeurIPS 2023Anytime Model Selection in Linear Bandits
- NeurIPS 2023Attacks on Online Learners: a Teacher-Student Analysis
- NeurIPS 2023Bandit Social Learning under Myopic Behavior
- NeurIPS 2023Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints
- NeurIPS 2023Cal-QL: Calibrated Offline RL Pre-Training for Efficient Online Fine-Tuning
- NeurIPS 2023Characterization of Overfitting in Robust Multiclass Classification
- NeurIPS 2023Common Ground in Cooperative Communication
- NeurIPS 2023Contextual Bandits and Imitation Learning with Preference-Based Active Queries
- NeurIPS 2023Discrete-Smoothness in Online Algorithms with Predictions
- NeurIPS 2023Efficient Adversarial Attacks on Online Multi-agent Reinforcement Learning
- NeurIPS 2023Efficient Online Clustering with Moving Costs
- NeurIPS 2023Fast Online Changepoint Detection via Functional Pruning CUSUM Statistics
- NeurIPS 2023Faster Relative Entropy Coding with Greedy Rejection Coding
- NeurIPS 2023Feature Selection in the Contrastive Analysis Setting
- NeurIPS 2023Finding Safe Zones of Markov Decision Processes Policies
- NeurIPS 2023Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts
- NeurIPS 2023Generalized Belief Transport
- NeurIPS 2023Information Theoretic Lower Bounds for Information Theoretic Upper Bounds
- NeurIPS 2023Learning in the Presence of Low-dimensional Structure: A Spiked Random Matrix Perspective
- NeurIPS 2023Learning via Wasserstein-Based High Probability Generalisation Bounds
- NeurIPS 2023Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games
- NeurIPS 2023Model-Free Reinforcement Learning with the Decision-Estimation Coefficient
- NeurIPS 2023Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning
- NeurIPS 2023Nash Regret Guarantees for Linear Bandits
- NeurIPS 2023New Bounds for Hyperparameter Tuning of Regression Problems Across Instances
- NeurIPS 2023No-regret Algorithms for Fair Resource Allocation
- NeurIPS 2023No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand
- NeurIPS 2023No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling
- NeurIPS 2023No-Regret Online Prediction with Strategic Experts
- NeurIPS 2023No-Regret Online Reinforcement Learning with Adversarial Losses and Transitions
- NeurIPS 2023Non-stationary Experimental Design under Linear Trends
- NeurIPS 2023On kernel-based statistical learning theory in the mean field limit
- NeurIPS 2023On the Learnability of Multilabel Ranking
- NeurIPS 2023On the Minimax Regret for Online Learning with Feedback Graphs
- NeurIPS 2023On the Sublinear Regret of GP-UCB
- NeurIPS 2023Online Ad Allocation with Predictions
- NeurIPS 2023Online Ad Procurement in Non-stationary Autobidding Worlds
- NeurIPS 2023Online Adaptive Policy Selection in Time-Varying Systems: No-Regret via Contractive Perturbations
- NeurIPS 2023Online Constrained Meta-Learning: Provable Guarantees for Generalization
在 Claude、Cursor 里直接问这个趋势
接上 Paperlist MCP 后,写综述、挑方向或准备投稿时,不用离开对话框就能拿到这页的数字:每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文,AI 会按你的问题整理。
可以直接复制这句话问 AI
用 paperlist 查理论 · online learning在 NeurIPS 2023–2026 的论文趋势,哪一年涨得最快?
AI 会调用的工具:get_topic_stats {"topic": "theory-online-learning"}
常见问题
- 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 篇。