Co-occurring keywords · papers mentioning both
Papers
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems
NeurIPS 2019
On the Performance of Thompson Sampling on Logistic Bandits
COLT 2019
Open Problem: Risk of Ruin in Multiarmed Bandits
COLT 2019
Optimal Best Markovian Arm Identification with Fixed Confidence
NeurIPS 2019
Optimal Exploitation of Clustering and History Information in Multi-armed Bandit
IJCAI 2019
Optimal Testing in the Experiment-rich Regime
AISTATS 2019
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
ICML 2019
Partially Observable Multi-Sensor Sequential Change Detection: A Combinatorial Multi-Armed Bandit Approach
AAAI 2019
Perturbed-History Exploration in Stochastic Multi-Armed Bandits
IJCAI 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints
NeurIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits
NeurIPS 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs
UAI 2019
Pure Exploration with Multiple Correct Answers
NeurIPS 2019
Recovering Bandits
NeurIPS 2019
Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems
NeurIPS 2019
Regularized Contextual Bandits
AISTATS 2019
Rotting bandits are no harder than stochastic ones
AISTATS 2019
Sample complexity of partition identification using multi-armed bandits
COLT 2019
Semi-Parametric Sampling for Stochastic Bandits with Many Arms
AAAI 2019
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits
NeurIPS 2019
Stay With Me: Lifetime Maximization Through Heteroscedastic Linear Bandits With Reneging
ICML 2019
Stochastic Bandits with Context Distributions
NeurIPS 2019
Structural Causal Bandits with Non-Manipulable Variables
AAAI 2019
Thompson Sampling and Approximate Inference
NeurIPS 2019
Thompson Sampling Guided Stochastic Searching on the Line for Deceptive Environments with Applications to Root-Finding Problems
JMLR 2019