conftrace_

multi-armed bandit

1098 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) thompson sampling (237) upper confidence bound (197) regret minimization (315) online algorithm (445) sample complexity (1169) contextual bandit (381) best arm identification (85)

Papers

Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
Bridging the gap between regret minimization and best arm identification, with application to A/B tests AISTATS 2019
Adaptive Ensemble Active Learning for Drifting Data Stream Mining IJCAI 2019
Approximations of the Restless Bandit Problem JMLR 2019
Gain estimation of linear dynamical systems using Thompson Sampling AISTATS 2019
Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model IJCAI 2019
Improved Algorithm on Online Clustering of Bandits IJCAI 2019
Active Exploration in Markov Decision Processes AISTATS 2019
Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019
Thompson Sampling on Symmetric Alpha-Stable Bandits IJCAI 2019
Online Pandora’s Boxes and Bandits AAAI 2019
Adaptive Thompson Sampling Stacks for Memory Bounded Open-Loop Planning IJCAI 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously ICML 2019
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits ICML 2019
On the Design of Estimators for Bandit Off-Policy Evaluation ICML 2019
DBA: Dynamic Multi-Armed Bandit Algorithm AAAI 2019
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits ICML 2019
Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Model ICML 2019
Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem ICML 2019
AutoSeM: Automatic Task Selection and Mixing in Multi-Task Learning NAACL 2019
Rotting bandits are no harder than stochastic ones AISTATS 2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing JMLR 2019
Best Arm Identification for Contaminated Bandits JMLR 2019