Co-occurring keywords · papers mentioning both
Papers
Blocking Bandits
NeurIPS 2019
Bootstrapping Upper Confidence Bound
NeurIPS 2019
Bridging the gap between regret minimization and best arm identification, with application to A/B tests
AISTATS 2019
Cascaded Algorithm-Selection and Hyper-Parameter Optimization with Extreme-Region Upper Confidence Bound Bandit
IJCAI 2019
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model
IJCAI 2019
Categorized Bandits
NeurIPS 2019
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback
NeurIPS 2019
Cleaning up the neighborhood: A full classification for adversarial partial monitoring
ALT 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio
NeurIPS 2019
Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Model
ICML 2019
Crawling the Community Structure of Multiplex Networks
AAAI 2019
DBA: Dynamic Multi-Armed Bandit Algorithm
AAAI 2019
Decentralized Cooperative Stochastic Bandits
NeurIPS 2019
Decentralized Exploration in Multi-Armed Bandits
ICML 2019
Delay and Cooperation in Nonstochastic Bandits
JMLR 2019
Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards
NeurIPS 2019
Dueling Bandits with Qualitative Feedback
AAAI 2019
Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue
AAAI 2019
Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem
ICML 2019
Efficient Pure Exploration in Adaptive Round model
NeurIPS 2019
Enhancing Evolutionary Conversion Rate Optimization via Multi-Armed Bandit Algorithms
AAAI 2019
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits
NeurIPS 2019
Equipping Experts/Bandits with Long-term Memory
NeurIPS 2019
FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms
ACL 2019
Finding the bandit in a graph: Sequential search-and-stop
AISTATS 2019