Online Algorithms

Taking a hint: How to leverage loss predictors in contextual bandits? COLT 2020 Temporal Variability in Implicit Online Learning NeurIPS 2020 The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NeurIPS 2020 The Blind Men and the Elephant: Integrated Offline/Online Optimization Under Uncertainty IJCAI 2020 The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits AISTATS 2020 The Method of Random Directions Optimization for Stereo Audio Source Separation Interspeech 2020 Themis: Fair and Efficient GPU Cluster Scheduling NSDI 2020 The Nonstochastic Control Problem ALT 2020 The Power of Predictions in Online Control NeurIPS 2020 The Primal-Dual method for Learning Augmented Algorithms NeurIPS 2020 The Quantile Snapshot Scan: Comparing Quantiles of Spatial Data from Two Snapshots in Time AISTATS 2020 Thompson Sampling Algorithms for Mean-Variance Bandits ICML 2020 Thompson Sampling for Adversarial Bit Prediction ALT 2020 Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020 Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020 Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NeurIPS 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Top-k Combinatorial Bandits with Full-Bandit Feedback ALT 2020 Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips IJCAI 2020 Towards Logically Centralized Interdomain Routing NSDI 2020 Trade the System Efficiency for the Income Equality of Drivers in Rideshare IJCAI 2020 Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020 Understanding the Effects of Batching in Online Active Learning AISTATS 2020 Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NeurIPS 2020 VoiceID on the Fly: A Speaker Recognition System that Learns from Scratch Interspeech 2020