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

501. NeurIPS 2024Label Delay in Online Continual Learning
502. NeurIPS 2024Learning from Snapshots of Discrete and Continuous Data Streams
503. NeurIPS 2024Learning to Mitigate Externalities: the Coase Theorem with Hindsight Rationality
504. NeurIPS 2024Learning to Price Homogeneous Data
505. NeurIPS 2024Learning-Augmented Algorithms with Explicit Predictors
506. NeurIPS 2024Linear Causal Bandits: Unknown Graph and Soft Interventions
507. NeurIPS 2024Local and Adaptive Mirror Descents in Extensive-Form Games
508. NeurIPS 2024Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
509. NeurIPS 2024Localized Adaptive Risk Control
510. NeurIPS 2024Locally Private and Robust Multi-Armed Bandits
511. NeurIPS 2024Lookback Prophet Inequalities
512. NeurIPS 2024Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning
513. NeurIPS 2024Maximizing utility in multi-agent environments by anticipating the behavior of other learners
514. NeurIPS 2024MetaCURL: Non-stationary Concave Utility Reinforcement Learning
515. NeurIPS 2024Mixture of Experts Meets Prompt-Based Continual Learning
516. NeurIPS 2024Multi-model Ensemble Conformal Prediction in Dynamic Environments
517. NeurIPS 2024Multiclass Transductive Online Learning
518. NeurIPS 2024Mutli-Armed Bandits with Network Interference
519. NeurIPS 2024Near-Optimality of Contrastive Divergence Algorithms
520. NeurIPS 2024Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
521. NeurIPS 2024Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
522. NeurIPS 2024No-Regret Bandit Exploration based on Soft Tree Ensemble Model
523. NeurIPS 2024No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
524. NeurIPS 2024No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
525. NeurIPS 2024Non-Stationary Learning of Neural Networks with Automatic Soft Parameter Reset
526. NeurIPS 2024Off-policy estimation with adaptively collected data: the power of online learning
527. NeurIPS 2024On the Computational Landscape of Replicable Learning
528. NeurIPS 2024On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice
529. NeurIPS 2024On the Necessity of Collaboration for Online Model Selection with Decentralized Data
530. NeurIPS 2024On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
531. NeurIPS 2024On Weak Regret Analysis for Dueling Bandits
532. NeurIPS 2024Online Adaptation of Language Models with a Memory of Amortized Contexts
533. NeurIPS 2024Online Bayesian Persuasion Without a Clue
534. NeurIPS 2024Online Budgeted Matching with General Bids
535. NeurIPS 2024Online Classification with Predictions
536. NeurIPS 2024Online Composite Optimization Between Stochastic and Adversarial Environments
537. NeurIPS 2024Online Consistency of the Nearest Neighbor Rule
538. NeurIPS 2024Online Control in Population Dynamics
539. NeurIPS 2024Online Control with Adversarial Disturbance for Continuous-time Linear Systems
540. NeurIPS 2024Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
541. NeurIPS 2024Online Estimation via Offline Estimation: An Information-Theoretic Framework
542. NeurIPS 2024Online Learning of Delayed Choices
543. NeurIPS 2024Online Learning with Sublinear Best-Action Queries
544. NeurIPS 2024Online Non-convex Learning in Dynamic Environments
545. NeurIPS 2024Online Posterior Sampling with a Diffusion Prior
546. NeurIPS 2024Online Weighted Paging with Unknown Weights
547. NeurIPS 2024Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
548. NeurIPS 2024Optimal Batched Best Arm Identification
549. NeurIPS 2024Optimal Multi-Fidelity Best-Arm Identification
550. NeurIPS 2024Optimal Multiclass U-Calibration Error and Beyond

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.