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
763 papers, page 5 of 16
- ICLR 2025Feature-Based Online Bilateral Trade
- ICLR 2025Hessian-Free Online Certified Unlearning
- ICLR 2025Longhorn: State Space Models are Amortized Online Learners
- ICLR 2025Minimalistic Predictions for Online Class Constraint Scheduling
- ICLR 2025On Bits and Bandits: Quantifying the Regret-Information Trade-off
- ICLR 2025Online Clustering with Nearly Optimal Consistency
- ICLR 2025ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS
- ICLR 2025Online Reinforcement Learning in Non-Stationary Context-Driven Environments
- ICLR 2025Optimal Protocols for Continual Learning via Statistical Physics and Control Theory
- ICLR 2025Policy Decorator: Model-Agnostic Online Refinement for Large Policy Model
- ICLR 2025Satisficing Regret Minimization in Bandits
- ICLR 2025Simplifying Deep Temporal Difference Learning
- ICML 2025A Classification View on Meta Learning Bandits
- ICML 2025A Online Statistical Framework for Out-of-Distribution Detection
- ICML 2025A Parametric Contextual Online Learning Theory of Brokerage
- ICML 2025A Trichotomy for List Transductive Online Learning
- ICML 2025AKORN: Adaptive Knots generated Online for RegressioN splines
- ICML 2025Algorithms with Calibrated Machine Learning Predictions
- ICML 2025Avoiding Catastrophe in Online Learning by Asking for Help
- ICML 2025Best of Both Worlds: Regret Minimization versus Minimax Play
- ICML 2025Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
- ICML 2025Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
- ICML 2025Competitively Consistent Clustering
- ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
- ICML 2025Constrained Pareto Set Identification with Bandit Feedback
- ICML 2025Contextual Bandits for Unbounded Context Distributions
- ICML 2025Contextual Linear Bandits with Delay as Payoff
- ICML 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regression
- ICML 2025DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models
- ICML 2025Dimension-Free Adaptive Subgradient Methods with Frequent Directions
- ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
- ICML 2025Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions
- ICML 2025Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
- ICML 2025Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
- ICML 2025Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems
- ICML 2025Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
- ICML 2025Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
- ICML 2025High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
- ICML 2025High-Dimensional Prediction for Sequential Decision Making
- ICML 2025Improved Online Confidence Bounds for Multinomial Logistic Bandits
- ICML 2025Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms
- ICML 2025Learning Adversarial MDPs with Stochastic Hard Constraints
- ICML 2025Learning With Multi-Group Guarantees For Clusterable Subpopulations
- ICML 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
- ICML 2025Leveraging Offline Data in Linear Latent Contextual Bandits
- ICML 2025Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration
- ICML 2025Linear Bandits with Partially Observable Features
- ICML 2025Logarithmic Regret for Online KL-Regularized Reinforcement Learning
- ICML 2025Maintaining Proportional Committees with Dynamic Candidate Sets
- ICML 2025Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback
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.