Online Algorithms

Bandit Learning with Positive Externalities NeurIPS 2018 Bandit Regret Scaling with the Effective Loss Range ALT 2018 Bandits with Delayed, Aggregated Anonymous Feedback ICML 2018 Best arm identification in multi-armed bandits with delayed feedback AISTATS 2018 Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback IJCAI 2018 Black-Box Reductions for Parameter-free Online Learning in Banach Spaces COLT 2018 Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018 Causal Bandits with Propagating Inference ICML 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Combinatorial Semi-Bandits with Knapsacks AISTATS 2018 Community Exploration: From Offline Optimization to Online Learning NeurIPS 2018 Competing with Automata-based Expert Sequences AISTATS 2018 Competitive Caching with Machine Learned Advice ICML 2018 Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids RSS 2018 Constant Regret, Generalized Mixability, and Mirror Descent NeurIPS 2018 Contextual Bandits for Adapting Treatment in a Mouse Model of de Novo Carcinogenesis MLHC 2018 Contextual Bandits with Stochastic Experts AISTATS 2018 Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NeurIPS 2018 Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NeurIPS 2018 Contextual Pricing for Lipschitz Buyers NeurIPS 2018 Cost-aware Cascading Bandits IJCAI 2018 Differential Privacy for Growing Databases NeurIPS 2018 Distributed Multi-Player Bandits - a Game of Thrones Approach NeurIPS 2018 Do Less, Get More: Streaming Submodular Maximization with Subsampling NeurIPS 2018 Dynamic Query Re-Planning using QOOP OSDI 2018