Co-occurring keywords · papers mentioning both
Papers
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio
NeurIPS 2019
FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms
ACL 2019
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing
NeurIPS 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking
NeurIPS 2019
Noisy Blackbox Optimization using Multi-fidelity Queries: A Tree Search Approach
AISTATS 2019
No-Regret Learning in Unknown Games with Correlated Payoffs
NeurIPS 2019
Online Influence Maximization with Local Observations
ALT 2019
On the Performance of Thompson Sampling on Logistic Bandits
COLT 2019
PAC Battling Bandits in the Plackett-Luce Model
ALT 2019
Thresholding Bandit with Optimal Aggregate Regret
NeurIPS 2019
A Better Resource Allocation Algorithm with Semi-Bandit Feedback
ALT 2018
Adaptation to Easy Data in Prediction with Limited Advice
NeurIPS 2018
Advancements in Dueling Bandits
IJCAI 2018
Bandit Online Learning on Graphs via Adaptive Optimization
IJCAI 2018
Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
JMLR 2018
Mitigating Bias in Adaptive Data Gathering via Differential Privacy
ICML 2018
Practical Contextual Bandits with Regression Oracles
ICML 2018
Bernoulli Rank-1 Bandits for Click Feedback
IJCAI 2017
Corralling a Band of Bandit Algorithms
COLT 2017
Efficient Online Bandit Multiclass Learning with Õ(√T) Regret
ICML 2017
Identifying Outlier Arms in Multi-Armed Bandit
NeurIPS 2017
Model-Independent Online Learning for Influence Maximization
ICML 2017
Copeland Dueling Bandits
NeurIPS 2015
Extreme bandits
NeurIPS 2014