Online Algorithms

Online Multitask Learning with Long-Term Memory NeurIPS 2020 Online Parameter-Free Learning of Multiple Low Variance Tasks UAI 2020 Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020 Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020 OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits AISTATS 2020 Parameter-free, Dynamic, and Strongly-Adaptive Online Learning ICML 2020 Randomised Gaussian Process Upper Confidence Bound for Bayesian Optimisation IJCAI 2020 Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020 Real-Time Optimisation for Online Learning in Auctions ICML 2020 Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Regret in Online Recommendation Systems NeurIPS 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Revisiting Online Quantum State Learning AAAI 2020 Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization NeurIPS 2020 Semi-bandit Optimization in the Dispersed Setting UAI 2020 Simultaneous Translation Policies: From Fixed to Adaptive ACL 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Subsidy Allocations in the Presence of Income Shocks AAAI 2020 Temporal Variability in Implicit Online Learning NeurIPS 2020 The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020 Thompson Sampling for Unsupervised Sequential Selection ACML 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Trade the System Efficiency for the Income Equality of Drivers in Rideshare IJCAI 2020