理论 · 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论文
共 190 篇，第 3 / 4 页
- ICML 2026Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
- ICML 2026Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers
- ICML 2026Parsimonious Learning-Augmented Online Metric Matching
- ICML 2026Prediction-Powered Adaptive Inference with Pretrained AI Models for Contextual Bandits
- ICML 2026Pushing the Limits of Block Rotations in Post-Training Quantization
- ICML 2026Regret Minimization With a Crowd of Awakening Experts
- ICML 2026Revenue Guarantees of No-Swap-Regret Dynamics in First Price Auctions
- ICML 2026Robust and Consistent Ski Rental with Distributional Advice
- ICML 2026SCORE: A Unified Framework for Overshoot Refund in Online FDR Control
- ICML 2026Ski Rental with Distributional Predictions of Unknown Quality
- ICML 2026SMAC: Score-Matched Actor-Critics for Robust Offline-to-Online Transfer
- ICML 2026Stochastic Linear Bandits with Parameter Noise
- ICML 2026Stronger Benchmarks for Prediction as a Service with Constraints
- ICML 2026The Cost of Learning Under Multiple Change Points
- ICML 2026Theory of Continual Learning Against Data Poisoning Attacks
- ICML 2026Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
- ICML 2026Universal Multiclass Transductive Online Learning
- ICML 2026Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
- ICML 2026What Does Flow-Matching Bring to TD-Learning?
- ICML 2026What Does Thompson Sampling Optimize?
- ICML 2026When Drafts Evolve: Speculative Decoding Meets Online Learning
- ICML 2026When Softmax Fails at the Top: Extreme‑Value Corrections for InfoNCE
- NeurIPS 2026A Compass for Useful Data: Online Data Selection via Alignment-Gated Fisher Geometry
- NeurIPS 2026A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
- NeurIPS 2026A Theory of Adversary-Directed Online Learning
- NeurIPS 2026A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
- NeurIPS 2026Adaptive Calibration in Non-Stationary Environments
- NeurIPS 2026Agnostic Online Learning with Reliable Abstention
- NeurIPS 2026BAT3R: Robust Online 3D Reconstruction with Bayesian Adaptive State Updates
- NeurIPS 2026Beyond Row Alignment: Virtual-Camera-Aware Online Stereo Rectification
- NeurIPS 2026Bian Que: An Agentic Framework with Flexible Skill Arrangement for Online System Operations
- NeurIPS 2026Bilinear Matching Bandits
- NeurIPS 2026Curvature-Dependent Lower Bounds for Riemannian Online Convex Optimization
- NeurIPS 2026Deployment-Time Online Imitation Learning from Corrective Demonstrations
- NeurIPS 2026Direction-Aware Offline-to-Online Learning in Linear Contextual Bandits
- NeurIPS 2026Evidence Guided Dual Expert Memory with Joint Routing for VLLMs Online Correction
- NeurIPS 2026Filtered-Trace Online Variational Training for Probabilistic Spiking Neural Networks
- NeurIPS 2026First-Order Regret for Online Convex Optimization with Memory and Online Nonstochastic Control
- NeurIPS 2026Flux: Online, Fine-Grained Data Scheduling for Training Machine Learning Interatomic Potentials
- NeurIPS 2026From Generic to Dedicated: A Novel Optimizer for Online Continual Learning
- NeurIPS 2026From POMDP Theory to Deep RL with Particle Filters
- NeurIPS 2026Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice
- NeurIPS 2026GHOST: Geometry-Hierarchical Online Streaming Token Eviction for Efficient 3D Reconstruction
- NeurIPS 2026HALO-VGGT: Heterogeneity-Aware Lightweight Online Compression Allocator for Efficient VGGT
- NeurIPS 2026High Probability Risk Control for Online Policy Learning
- NeurIPS 2026Improved Algorithms for Online Classification with Surrogate Losses
- NeurIPS 2026Instance-Adaptive Online Multicalibration
- NeurIPS 2026Learning to Price with Persuasion
- NeurIPS 2026Learning-Augmented Online Portfolio Selection: Optimal Robustness-Consistency Tradeoffs
- NeurIPS 2026Learning-Augmented Online Scheduling with Parsimonious Preemption
在 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 篇。