Online Algorithms

Adaptive Double-Exploration Tradeoff for Outlier Detection AAAI 2020 Adaptive Online Estimation of Piecewise Polynomial Trends NeurIPS 2020 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020 An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020 A Novel Confidence-Based Algorithm for Structured Bandits AISTATS 2020 A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020 A Reduction from Reinforcement Learning to No-Regret Online Learning AISTATS 2020 A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020 A SUPER* Algorithm to Optimize Paper Bidding in Peer Review UAI 2020 A Unified Model for the Two-stage Offline-then-Online Resource Allocation IJCAI 2020 Bandit Linear Control NeurIPS 2020 Batched Coarse Ranking in Multi-Armed Bandits NeurIPS 2020 Better Full-Matrix Regret via Parameter-Free Online Learning NeurIPS 2020 Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NeurIPS 2020 Budgeted Online Influence Maximization ICML 2020 Comparator-Adaptive Convex Bandits NeurIPS 2020 Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests AAAI 2020 Contextual Online False Discovery Rate Control AISTATS 2020 Cooperative Multi-player Bandit Optimization NeurIPS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Dimension-Free Bounds for Chasing Convex Functions COLT 2020 Distance-Based Equilibria in Normal-Form Games AAAI 2020 Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication ICLR 2020 Dynamic Assortment Optimization with Changing Contextual Information JMLR 2020