adversarial setting

Thompson Sampling for Adversarial Bit Prediction ALT 2020 Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020 Best of many worlds: Robust model selection for online supervised learning AISTATS 2019 Don’t Take the Easy Way Out: Ensemble Based Methods for Avoiding Known Dataset Biases EMNLP 2019 Dying Experts: Efficient Algorithms with Optimal Regret Bounds NeurIPS 2019 Adversarial Task Assignment IJCAI 2018 Decipherment for Adversarial Offensive Language Detection EMNLP 2018 Online Learning with Abstention ICML 2018 Online Learning with an Unknown Fairness Metric NeurIPS 2018 Robust Maximization of Non-Submodular Objectives AISTATS 2018 Minimizing Trust Leaks for Robust Sybil Detection ICML 2017 Conservative Bandits ICML 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 Multi-armed Bandits: Competing with Optimal Sequences NeurIPS 2016 Combinatorial Bandits Revisited NeurIPS 2015 Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret ICML 2015 The Pareto Regret Frontier for Bandits NeurIPS 2015 Adaptive Market Making via Online Learning NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 On Multilabel Classification and Ranking with Partial Feedback NeurIPS 2012 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 New Adaptive Algorithms for Online Classification NeurIPS 2010 Semi-Supervised Learning with Adversarially Missing Label Information NeurIPS 2010