Online Algorithms

Parameter-Free Online Learning via Model Selection NeurIPS 2017 Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017 Projection-free Distributed Online Learning in Networks ICML 2017 Random Permutation Online Isotonic Regression NeurIPS 2017 Retaining Data from Streams of Social Platforms with Minimal Regret IJCAI 2017 Second-Order Kernel Online Convex Optimization with Adaptive Sketching ICML 2017 Thresholding Bandits with Augmented UCB IJCAI 2017 Variants of RMSProp and Adagrad with Logarithmic Regret Bounds ICML 2017 An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016 An optimal algorithm for the Thresholding Bandit Problem ICML 2016 Bi-Objective Online Matching and Submodular Allocations NeurIPS 2016 BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016 Coin Betting and Parameter-Free Online Learning NeurIPS 2016 Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016 Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning NeurIPS 2016 Conservative Bandits ICML 2016 Contextual Combinatorial Cascading Bandits ICML 2016 Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 Efficient Second Order Online Learning by Sketching NeurIPS 2016 Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities NeurIPS 2016 Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Maximin Action Identification: A New Bandit Framework for Games COLT 2016 Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NeurIPS 2016