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 3 of 5

101. ICML 2025Contextual Linear Bandits with Delay as Payoff
102. ICML 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regression
103. ICML 2025DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models
104. ICML 2025Dimension-Free Adaptive Subgradient Methods with Frequent Directions
105. ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
106. ICML 2025Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions
107. ICML 2025Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
108. ICML 2025Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
109. ICML 2025Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems
110. ICML 2025Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
111. ICML 2025Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
112. ICML 2025High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
113. ICML 2025High-Dimensional Prediction for Sequential Decision Making
114. ICML 2025Improved Online Confidence Bounds for Multinomial Logistic Bandits
115. ICML 2025Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms
116. ICML 2025Learning Adversarial MDPs with Stochastic Hard Constraints
117. ICML 2025Learning With Multi-Group Guarantees For Clusterable Subpopulations
118. ICML 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
119. ICML 2025Leveraging Offline Data in Linear Latent Contextual Bandits
120. ICML 2025Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration
121. ICML 2025Linear Bandits with Partially Observable Features
122. ICML 2025Logarithmic Regret for Online KL-Regularized Reinforcement Learning
123. ICML 2025Maintaining Proportional Committees with Dynamic Candidate Sets
124. ICML 2025Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback
125. ICML 2025Near Optimal Non-asymptotic Sample Complexity of 1-Identification
126. ICML 2025Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
127. ICML 2025Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
128. ICML 2025Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
129. ICML 2025Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
130. ICML 2025Offline Learning for Combinatorial Multi-armed Bandits
131. ICML 2025On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback
132. ICML 2025Online Clustering of Dueling Bandits
133. ICML 2025Online Conformal Prediction via Online Optimization
134. ICML 2025Online Detection of LLM-Generated Texts via Sequential Hypothesis Testing by Betting
135. ICML 2025Online Episodic Convex Reinforcement Learning
136. ICML 2025Online Laplacian-Based Representation Learning in Reinforcement Learning
137. ICML 2025Online Learning in Risk Sensitive constrained MDP
138. ICML 2025Online Learning in the Random-Order Model
139. ICML 2025Online Learning with Unknown Constraints
140. ICML 2025Online Linear Classification with Massart Noise
141. ICML 2025Online Pre-Training for Offline-to-Online Reinforcement Learning
142. ICML 2025Online Sparsification of Bipartite-Like Clusters in Graphs
143. ICML 2025Optimal Algorithm for Max-Min Fair Bandit
144. ICML 2025Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
145. ICML 2025Partially Observable Reinforcement Learning with Memory Traces
146. ICML 2025Ranking with Multiple Oracles: From Weak to Strong Stochastic Transitivity
147. ICML 2025Revisiting Differentially Private Algorithms for Decentralized Online Learning
148. ICML 2025Revisiting the Predictability of Performative, Social Events
149. ICML 2025Reward-free World Models for Online Imitation Learning
150. ICML 2025Sample Complexity of Distributionally Robust Off-Dynamics Reinforcement Learning with Online Interaction

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.