conftrace_

adversarial bandit

59 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) stochastic bandit (98) contextual bandit (381) online algorithm (445) adversarial learning (1595) online mirror descent (40) stochastic setting (12) delayed feedback (54)

Papers

Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021
Approximation Theory Based Methods for RKHS Bandits ICML 2021
Mirror Descent and the Information Ratio COLT 2021
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions COLT 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes ICML 2020
Efficient and robust algorithms for adversarial linear contextual bandits COLT 2020
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020
Exploration by Optimisation in Partial Monitoring COLT 2020
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NIPS 2020
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NIPS 2020
MaxHedge: Maximizing a Maximum Online AISTATS 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NIPS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Online EXP3 Learning in Adversarial Bandits with Delayed Feedback NIPS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Online learning with kernel losses ICML 2019
Beyond the Hazard Rate: More Perturbation Algorithms for Adversarial Multi-armed Bandits JMLR 2018
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits COLT 2017
Online Adaptation of an Attention-Based Neural Network for Natural Language Generation INTERSPEECH 2017
Safety-Aware Algorithms for Adversarial Contextual Bandit ICML 2017
Refined Lower Bounds for Adversarial Bandits NIPS 2016
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016