Online Algorithms

Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019 Submodular Optimization over Streams with Inhomogeneous Decays AAAI 2019 Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity ICML 2019 Target Tracking for Contextual Bandits: Application to Demand Side Management ICML 2019 The Parameterized Complexity of Cascading Portfolio Scheduling NeurIPS 2019 Think out of the "Box": Generically-Constrained Asynchronous Composite Optimization and Hedging NeurIPS 2019 Ultra Fast Medoid Identification via Correlated Sequential Halving NeurIPS 2019 Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019 User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NeurIPS 2019 Weighted Linear Bandits for Non-Stationary Environments NeurIPS 2019 A Bandit Approach to Sequential Experimental Design with False Discovery Control NeurIPS 2018 A Better Resource Allocation Algorithm with Semi-Bandit Feedback ALT 2018 Acceleration through Optimistic No-Regret Dynamics NeurIPS 2018 Adaptation to Easy Data in Prediction with Limited Advice NeurIPS 2018 Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits ICML 2018 Adaptive Online Learning in Dynamic Environments NeurIPS 2018 Adaptive Sampling for Coarse Ranking AISTATS 2018 Adaptivity to Smoothness in X-armed bandits COLT 2018 Adversarial Attacks on Stochastic Bandits NeurIPS 2018 A fully adaptive algorithm for pure exploration in linear bandits AISTATS 2018 Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NeurIPS 2018 An Information-Theoretic Analysis for Thompson Sampling with Many Actions NeurIPS 2018 Anytime Focal Search with Applications IJCAI 2018 A Real-Time Game Theoretic Planner for Autonomous Two-Player Drone Racing RSS 2018 Bandit Learning in Concave N-Person Games NeurIPS 2018