← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Feedback graph regret bounds for Thompson Sampling and UCB ALT 2020
Thompson Sampling for Adversarial Bit Prediction ALT 2020
The Nonstochastic Control Problem ALT 2020
Cooperative Online Learning: Keeping your Neighbors Updated ALT 2020
First-Order Bayesian Regret Analysis of Thompson Sampling ALT 2020
Robust Algorithms for Online $k$-means Clustering ALT 2020
The Primal-Dual method for Learning Augmented Algorithms NIPS 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NIPS 2020
VoiceID on the Fly: A Speaker Recognition System that Learns from Scratch INTERSPEECH 2020
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP IJCAI 2020
Stable Roommate Problem with Diversity Preferences IJCAI 2020
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020
Thompson Sampling Algorithms for Mean-Variance Bandits ICML 2020
Robust Outlier Arm Identification ICML 2020
Projection-free Distributed Online Convex Optimization with $O(\sqrtT)$ Communication Complexity ICML 2020
Adaptive Sampling for Estimating Probability Distributions ICML 2020
Bandits with Adversarial Scaling ICML 2020
Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games ICML 2020
Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020
Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent ICML 2020
Gamification of Pure Exploration for Linear Bandits ICML 2020
Derivative-Free & Order-Robust Optimisation AISTATS 2020
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020
Sundial: Fault-tolerant Clock Synchronization for Datacenters OSDI 2020
Collaborative Exploration in Stochastic Multi-Player Bandits ACML 2020