← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Subsidy Allocations in the Presence of Income Shocks AAAI 2020
Distance-Based Equilibria in Normal-Form Games AAAI 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Linear Bandits with Feature Feedback AAAI 2020
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix NIPS 2020
Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NIPS 2020
Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards NIPS 2020
Learning to Play Sequential Games versus Unknown Opponents NIPS 2020
Exploiting the Surrogate Gap in Online Multiclass Classification NIPS 2020
Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization NIPS 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020
Online Bayesian Persuasion NIPS 2020
Online Multitask Learning with Long-Term Memory NIPS 2020
Comparator-Adaptive Convex Bandits NIPS 2020
Adaptive Online Estimation of Piecewise Polynomial Trends NIPS 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games NIPS 2020
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020
Online Learning with Primary and Secondary Losses NIPS 2020
Cooperative Multi-player Bandit Optimization NIPS 2020
Online Agnostic Boosting via Regret Minimization NIPS 2020
A SUPER* Algorithm to Optimize Paper Bidding in Peer Review UAI 2020
A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020
Learning Augmented Energy Minimization via Speed Scaling NIPS 2020