Online Algorithms
1,013 papers
Papers per year
1
1
2
4
6
6
10
10
24
27
41
45
35
43
36
35
60
104
108
93
117
124
54
27
'10
'15
'20
'25
Papers
Nonstochastic Bandits with Composite Anonymous Feedback
JMLR 2022
On Efficient Online Imitation Learning via Classification
NeurIPS 2022
One Gradient Frank-Wolfe for Decentralized Online
Convex and Submodular Optimization
ACML 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification
NeurIPS 2022
One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes
ICML 2022
Online Facility Location with Predictions
ICLR 2022
Online Influence Maximization with Node-Level Feedback Using Standard Offline Oracles
AAAI 2022
Online Learning and Pricing for Network Revenue Management with Reusable Resources
NeurIPS 2022
Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards
ICML 2022
Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case
JMLR 2022
Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs
COLT 2022
Open Problem: Optimal Best Arm Identification with Fixed-Budget
COLT 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
AISTATS 2022
(Optimal) Online Bipartite Matching with Degree Information
NeurIPS 2022
Parameter-free Mirror Descent
COLT 2022
Parameter-free Regret in High Probability with Heavy Tails
NeurIPS 2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
NeurIPS 2022
Projection-free Distributed Online Learning with Sublinear Communication Complexity
JMLR 2022
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
COLT 2022
Regret Minimization with Performative Feedback
ICML 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits
COLT 2022
Risk-Averse No-Regret Learning in Online Convex Games
ICML 2022
Safe Exploration for Efficient Policy Evaluation and Comparison
ICML 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
ICML 2022
Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification
AAAI 2022