Co-occurring keywords · papers mentioning both
Papers
Thresholding Graph Bandits with GrAPL
AISTATS 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits
COLT 2020
Towards Hands-Free Visual Dialog Interactive Recommendation
AAAI 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits
COLT 2020
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms
NeurIPS 2020
X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks
ACML 2019
A Bandit Approach to Maximum Inner Product Search
AAAI 2019
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
COLT 2019
Active Exploration in Markov Decision Processes
AISTATS 2019
ActiveHNE: Active Heterogeneous Network Embedding
IJCAI 2019
Adaptive Ensemble Active Learning for Drifting Data Stream Mining
IJCAI 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes
COLT 2019
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits
ICML 2019
Adaptive Thompson Sampling Stacks for Memory Bounded Open-Loop Planning
IJCAI 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring
COLT 2019
An Optimal Algorithm for Stochastic and Adversarial Bandits
AISTATS 2019
Approximations of the Restless Bandit Problem
JMLR 2019
Are sample means in multi-armed bandits positively or negatively biased?
NeurIPS 2019
AutoSeM: Automatic Task Selection and Mixing in Multi-Task Learning
NAACL 2019
Bandit Online Learning with Unknown Delays
AISTATS 2019
Bandits with Feedback Graphs and Switching Costs
NeurIPS 2019
Batched Multi-armed Bandits Problem
NeurIPS 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously
ICML 2019
Best Arm Identification for Contaminated Bandits
JMLR 2019
Better Algorithms for Stochastic Bandits with Adversarial Corruptions
COLT 2019