Theory · online learning papers, 2023–2026

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.

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 10 of 16

451. NeurIPS 2024Bandits with Ranking Feedback
452. NeurIPS 2024Barely Random Algorithms and Collective Metrical Task Systems
453. NeurIPS 2024Bayesian Online Natural Gradient (BONG)
454. NeurIPS 2024Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
455. NeurIPS 2024Beyond task diversity: provable representation transfer for sequential multitask linear bandits
456. NeurIPS 2024Can large language models explore in-context?
457. NeurIPS 2024Communication Bounds for the Distributed Experts Problem
458. NeurIPS 2024Contextual Active Model Selection
459. NeurIPS 2024Contextual Decision-Making with Knapsacks Beyond the Worst Case
460. NeurIPS 2024Contextual Multinomial Logit Bandits with General Value Functions
461. NeurIPS 2024Continual Learning with Global Alignment
462. NeurIPS 2024Continual learning with the neural tangent ensemble
463. NeurIPS 2024CONTRAST: Continual Multi-source Adaptation to Dynamic Distributions
464. NeurIPS 2024Convergence of No-Swap-Regret Dynamics in Self-Play
465. NeurIPS 2024Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
466. NeurIPS 2024Dealing with Synthetic Data Contamination in Online Continual Learning
467. NeurIPS 2024Disentangling and mitigating the impact of task similarity for continual learning
468. NeurIPS 2024Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms
469. NeurIPS 2024Dueling over Dessert, Mastering the Art of Repeated Cake Cutting
470. NeurIPS 2024Dynamic Service Fee Pricing under Strategic Behavior: Actions as Instruments and Phase Transition
471. NeurIPS 2024Efficient Prompt Optimization Through the Lens of Best Arm Identification
472. NeurIPS 2024Enhancing Preference-based Linear Bandits via Human Response Time
473. NeurIPS 2024Ensemble sampling for linear bandits: small ensembles suffice
474. NeurIPS 2024Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
475. NeurIPS 2024F-OAL: Forward-only Online Analytic Learning with Fast Training and Low Memory Footprint in Class Incremental Learning
476. NeurIPS 2024Fair Online Bilateral Trade
477. NeurIPS 2024Fairness and Efficiency in Online Class Matching
478. NeurIPS 2024Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
479. NeurIPS 2024Fast Rates for Bandit PAC Multiclass Classification
480. NeurIPS 2024Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
481. NeurIPS 2024Fixed Confidence Best Arm Identification in the Bayesian Setting
482. NeurIPS 2024Forgetting, Ignorance or Myopia: Revisiting Key Challenges in Online Continual Learning
483. NeurIPS 2024Fully Unconstrained Online Learning
484. NeurIPS 2024Generalized Linear Bandits with Limited Adaptivity
485. NeurIPS 2024Global Rewards in Restless Multi-Armed Bandits
486. NeurIPS 2024Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints
487. NeurIPS 2024Gradient-Variation Online Learning under Generalized Smoothness
488. NeurIPS 2024GREATS: Online Selection of High-Quality Data for LLM Training in Every Iteration
489. NeurIPS 2024Group-wise oracle-efficient algorithms for online multi-group learning
490. NeurIPS 2024HiCoM: Hierarchical Coherent Motion for Dynamic Streamable Scenes with 3D Gaussian Splatting
491. NeurIPS 2024Honor Among Bandits: No-Regret Learning for Online Fair Division
492. NeurIPS 2024How Does Variance Shape the Regret in Contextual Bandits?
493. NeurIPS 2024Identifying Equivalent Training Dynamics
494. NeurIPS 2024Improved Algorithms for Contextual Dynamic Pricing
495. NeurIPS 2024Improved Analysis for Bandit Learning in Matching Markets
496. NeurIPS 2024Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms
497. NeurIPS 2024Improved learning rates in multi-unit uniform price auctions
498. NeurIPS 2024Improved Regret for Bandit Convex Optimization with Delayed Feedback
499. NeurIPS 2024Improved Regret of Linear Ensemble Sampling
500. NeurIPS 2024Information-theoretic Limits of Online Classification with Noisy Labels

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.