Online Algorithms

Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization AAAI 2020 Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound WACV 2020 Adaptive Exploration in Linear Contextual Bandit AISTATS 2020 Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization AAAI 2020 Adaptive Online Estimation of Piecewise Polynomial Trends NeurIPS 2020 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 Adaptive Sampling for Estimating Probability Distributions ICML 2020 A Duality Approach for Regret Minimization in Average-Award Ergodic Markov Decision Processes L4DC 2020 Adversarial Attacks on Linear Contextual Bandits NeurIPS 2020 Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NeurIPS 2020 Adversarial Blocking Bandits NeurIPS 2020 A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints JMLR 2020 A Multiarmed Bandit Based Incentive Mechanism for a Subset Selection of Customers for Demand Response in Smart Grids AAAI 2020 A Multi-Unit Profit Competitive Mechanism for Cellular Traffic Offloading AAAI 2020 An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits NeurIPS 2020 A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles IJCAI 2020 An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020 A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players AISTATS 2020 A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020 A Simple Approach for Non-stationary Linear Bandits AISTATS 2020 A single algorithm for both restless and rested rotting bandits AISTATS 2020 A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NeurIPS 2020 A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 2020