Multi-Armed Bandits

Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022 Safe Exploration for Efficient Policy Evaluation and Comparison ICML 2022 Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022 Simulating Bandit Learning from User Feedback for Extractive Question Answering ACL 2022 Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model AAAI 2022 Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback ICML 2022 Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity NeurIPS 2022 Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022 Smoothed Online Learning is as Easy as Statistical Learning COLT 2022 Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization AAAI 2022 Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022 Stochastic Rising Bandits ICML 2022 Supervised Off-Policy Ranking ICML 2022 The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication COLT 2022 The price of unfairness in linear bandits with biased feedback NeurIPS 2022 Thompson Sampling for Bandit Learning in Matching Markets IJCAI 2022 Thompson Sampling for Robust Transfer in Multi-Task Bandits ICML 2022 Thompson Sampling with a Mixture Prior AISTATS 2022 Top K Ranking for Multi-Armed Bandit with Noisy Evaluations AISTATS 2022 Top Two Algorithms Revisited NeurIPS 2022 Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise AISTATS 2022 Towards Off-Policy Learning for Ranking Policies with Logged Feedback AAAI 2022 Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information COLT 2022 Tracking Most Significant Arm Switches in Bandits COLT 2022 Trading Off Resource Budgets For Improved Regret Bounds NeurIPS 2022