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

233 papers, page 2 of 5

51. ICML 2026Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Value Flow Mechanism
52. ICML 2026Non-Stationary Online Structured Prediction with Surrogate Losses
53. ICML 2026On Contraction of Sequential and Offset Rademacher Complexities
54. ICML 2026On the Coordination of Value-Maximizing Bidders
55. ICML 2026On the Role of Computation in Reinforcement Learning
56. ICML 2026Online Compatible Reward Identification from Preference Feedback
57. ICML 2026Online Conformal Prediction via Universal Portfolio Algorithms
58. ICML 2026Online Continual Learning with Dynamic Label Hierarchies
59. ICML 2026Online Contract Design With Unknown Technology
60. ICML 2026Online Fair Division with Additional Information
61. ICML 2026Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits
62. ICML 2026Online Packet Scheduling with Deadlines and Learning
63. ICML 2026Online Rubrics Elicitation from Pairwise Comparisons
64. ICML 2026Online Social Welfare Function-based Resource Allocation
65. ICML 2026Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
66. ICML 2026Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers
67. ICML 2026Parsimonious Learning-Augmented Online Metric Matching
68. ICML 2026Prediction-Powered Adaptive Inference with Pretrained AI Models for Contextual Bandits
69. ICML 2026Pushing the Limits of Block Rotations in Post-Training Quantization
70. ICML 2026Regret Minimization With a Crowd of Awakening Experts
71. ICML 2026Revenue Guarantees of No-Swap-Regret Dynamics in First Price Auctions
72. ICML 2026Robust and Consistent Ski Rental with Distributional Advice
73. ICML 2026SCORE: A Unified Framework for Overshoot Refund in Online FDR Control
74. ICML 2026Ski Rental with Distributional Predictions of Unknown Quality
75. ICML 2026SMAC: Score-Matched Actor-Critics for Robust Offline-to-Online Transfer
76. ICML 2026Stochastic Linear Bandits with Parameter Noise
77. ICML 2026Stronger Benchmarks for Prediction as a Service with Constraints
78. ICML 2026The Cost of Learning Under Multiple Change Points
79. ICML 2026Theory of Continual Learning Against Data Poisoning Attacks
80. ICML 2026Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
81. ICML 2026Universal Multiclass Transductive Online Learning
82. ICML 2026Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
83. ICML 2026What Does Flow-Matching Bring to TD-Learning?
84. ICML 2026What Does Thompson Sampling Optimize?
85. ICML 2026When Drafts Evolve: Speculative Decoding Meets Online Learning
86. ICML 2026When Softmax Fails at the Top: Extreme‑Value Corrections for InfoNCE
87. ICML 2025A Classification View on Meta Learning Bandits
88. ICML 2025A Online Statistical Framework for Out-of-Distribution Detection
89. ICML 2025A Parametric Contextual Online Learning Theory of Brokerage
90. ICML 2025A Trichotomy for List Transductive Online Learning
91. ICML 2025AKORN: Adaptive Knots generated Online for RegressioN splines
92. ICML 2025Algorithms with Calibrated Machine Learning Predictions
93. ICML 2025Avoiding Catastrophe in Online Learning by Asking for Help
94. ICML 2025Best of Both Worlds: Regret Minimization versus Minimax Play
95. ICML 2025Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
96. ICML 2025Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
97. ICML 2025Competitively Consistent Clustering
98. ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
99. ICML 2025Constrained Pareto Set Identification with Bandit Feedback
100. ICML 2025Contextual Bandits for Unbounded Context Distributions

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.