Theory · online learning papers, 2023–2026
Theory area: online_learning
Scope: NeurIPS, ICLR, ICML and CVPR, 2023–2026. 763 papers are tagged with this topic.
Key findings
- Theory · online learning went from 164 papers in 2023 to 190 in 2026, roughly 1.2x in three years.
- NeurIPS publishes the most Theory · online learning work: 427 papers from 2023 to 2026, 56% of the four-venue total.
- The fastest-growing overlap is with Simulation for Driving: papers tagged with both rose from 1 in 2023 to 12 in 2026.
- Among the 5 topics under Theory and Statistics, it ranks #3 by 2026 paper count; the fastest grower in the group, Theory · learning theory, is up 5.6x versus 1.2x here.
Papers per venue
Counts by year and venue
| Year | NeurIPS | ICLR | ICML | CVPR | Total |
|---|---|---|---|---|---|
| 2023 | 101 | 17 | 39 | 7 | 164 |
| 2024 | 169 | 13 | 34 | 8 | 224 |
| 2025 | 89 | 18 | 74 | 4 | 185 |
| 2026 | 68 | 27 | 86 | 9 | 190 |
Representative papers
Spread across years and venues so every edition shows up
- 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
All Theory · online learning papers
164 papers, page 2 of 4
- ICML 2023Offline Meta Reinforcement Learning with In-Distribution Online Adaptation
- ICML 2023Online Learning in Stackelberg Games with an Omniscient Follower
- ICML 2023Online Learning with Feedback Graphs: The True Shape of Regret
- ICML 2023Online Platt Scaling with Calibeating
- ICML 2023Online Restless Bandits with Unobserved States
- ICML 2023Opponent-Limited Online Search for Imperfect Information Games
- ICML 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
- ICML 2023Parallel Online Clustering of Bandits via Hedonic Game
- ICML 2023Solving Linear Programs with Fast Online Learning Algorithms
- ICML 2023Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
- ICML 2023Stochastic Gradient Descent-Induced Drift of Representation in a Two-Layer Neural Network
- ICML 2023Unconstrained Online Learning with Unbounded Losses
- ICML 2023Understanding the Role of Feedback in Online Learning with Switching Costs
- 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
Ask about this trend from Claude or Cursor
Connect the Paperlist MCP and your assistant can pull the numbers on this page while you draft a survey, pick a direction or plan a submission: papers per year and venue, growth, the fastest-rising sub-themes and representative papers, shaped around your question.
Copy this prompt into your assistant
Use paperlist to show how Theory · online learning papers grew at NeurIPS from 2023 to 2026, and which year jumped the most.
Tool the assistant calls: get_topic_stats {"topic": "theory-online-learning"}
Set up Paperlist MCP in two minutes (Claude Code, Cursor, Codex, ChatGPT)
FAQ
- How many Theory · online learning papers were published at NeurIPS, ICLR, ICML and CVPR from 2023 to 2026?
- 763 in total: 164 in 2023, 224 in 2024, 185 in 2025, 190 in 2026.
- How many Theory · online learning papers are at NeurIPS 2026?
- NeurIPS 2026 has 68 Theory · online learning papers, versus 89 the year before.
- How many Theory · online learning papers are at ICLR 2026?
- ICLR 2026 has 27 Theory · online learning papers, versus 18 the year before.
- How many Theory · online learning papers are at ICML 2026?
- ICML 2026 has 86 Theory · online learning papers, versus 74 the year before.
- How many Theory · online learning papers are at CVPR 2026?
- CVPR 2026 has 9 Theory · online learning papers, versus 4 the year before.
- Which conference publishes the most Theory · online learning papers?
- NeurIPS, with 427 papers from 2023 to 2026.