Online Algorithms

On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019 Optimizing Discount and Reputation Trade-Offs in E-Commerce Systems: Characterization and Online Learning AAAI 2019 Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019 Polynomial Cost of Adaptation for X-Armed Bandits NeurIPS 2019 Predictor-Corrector Policy Optimization ICML 2019 Private Learning Implies Online Learning: An Efficient Reduction NeurIPS 2019 Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics JMLR 2019 Recovering Bandits NeurIPS 2019 Reducing Exploration of Dying Arms in Mortal Bandits UAI 2019 Rotting bandits are no harder than stochastic ones AISTATS 2019 Thresholding Bandit with Optimal Aggregate Regret NeurIPS 2019 Top Feasible Arm Identification AISTATS 2019 Adaptive Online Learning in Dynamic Environments NeurIPS 2018 Advancements in Dueling Bandits IJCAI 2018 Adversarial Attacks on Stochastic Bandits NeurIPS 2018 A General Approach to Multi-Armed Bandits Under Risk Criteria COLT 2018 An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization COLT 2018 Bandit Online Learning on Graphs via Adaptive Optimization IJCAI 2018 Bandits with Delayed, Aggregated Anonymous Feedback ICML 2018 Compiling Combinatorial Prediction Games ICML 2018 Cost-aware Cascading Bandits IJCAI 2018 Distributed Multi-Player Bandits - a Game of Thrones Approach NeurIPS 2018 Dynamic Regret of Strongly Adaptive Methods ICML 2018 Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018 Efficient Contextual Bandits in Non-stationary Worlds COLT 2018