Co-occurring keywords · papers mentioning both
Papers
Lenient Regret for Multi-Armed Bandits
AAAI 2021
Matrix games with bandit feedback
UAI 2021
Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations
ACML 2021
Mean Field Equilibrium in Multi-Armed Bandit Game with Continuous Reward
IJCAI 2021
Metadata-based Multi-Task Bandits with Bayesian Hierarchical Models
NeurIPS 2021
Meta-Thompson Sampling
ICML 2021
Misspecified Gaussian Process Bandit Optimization
NeurIPS 2021
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals
JMLR 2021
MOTS: Minimax Optimal Thompson Sampling
ICML 2021
Multi-armed Bandit Requiring Monotone Arm Sequences
NeurIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization
NeurIPS 2021
Multi-Armed Bandits with Cost Subsidy
AISTATS 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning
ICML 2021
Multiplayer Bandit Learning, from Competition to Cooperation
COLT 2021
Multitask Bandit Learning Through Heterogeneous Feedback Aggregation
AISTATS 2021
Nearest neighbor search under uncertainty
UAI 2021
Near-Optimal Confidence Sequences for Bounded Random Variables
ICML 2021
Near-Optimal MNL Bandits Under Risk Criteria
AAAI 2021
Non-stationary Reinforcement Learning without Prior Knowledge: an Optimal Black-box Approach
COLT 2021
No-regret Algorithms for Capturing Events in Poisson Point Processes
ICML 2021
Observation-Free Attacks on Stochastic Bandits
NeurIPS 2021
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication
NeurIPS 2021
Online Multi-Armed Bandits with Adaptive Inference
NeurIPS 2021
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
NeurIPS 2021
On Multi-Armed Bandit Designs for Dose-Finding Trials
JMLR 2021