conftrace_

adversarial setting

45 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) stochastic setting (12) adversarial learning (1595) online algorithm (445) contextual bandit (381) regret minimization (315) stochastic bandit (98) adversarial bandit (59)

Papers

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