← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Learning from a Sample in Online Algorithms NIPS 2022
Anonymous Bandits for Multi-User Systems NIPS 2022
Sequential Information Design: Learning to Persuade in the Dark NIPS 2022
Parameter-Free Online Linear Optimization with Side Information via Universal Coin Betting AISTATS 2022
Best Arm Identification with Safety Constraints AISTATS 2022
Learning in Congestion Games with Bandit Feedback NIPS 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach AAAI 2022
A gradient estimator via L1-randomization for online zero-order optimization with two point feedback NIPS 2022
Parameter-free Regret in High Probability with Heavy Tails NIPS 2022
Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems NIPS 2022
Debiasing Samples from Online Learning Using Bootstrap AISTATS 2022
Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions NIPS 2022
Simple and Optimal Greedy Online Contention Resolution Schemes NIPS 2022
On-the-fly adaptation of patrolling strategies in changing environments UAI 2022
Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory AISTATS 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control NIPS 2022
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022
Scale-free Unconstrained Online Learning for Curved Losses COLT 2022
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization AAAI 2022
Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022
Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022
Online Page Migration with ML Advice AISTATS 2022
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022
The Two-Sided Game of Googol JMLR 2022