Multi-Armed Bandits

Norm-Agnostic Linear Bandits AISTATS 2022 No Weighted-Regret Learning in Adversarial Bandits with Delays JMLR 2022 Off-Policy Evaluation for Large Action Spaces via Embeddings ICML 2022 On Elimination Strategies for Bandit Fixed-Confidence Identification NeurIPS 2022 Online Certification of Preference-Based Fairness for Personalized Recommender Systems AAAI 2022 Online Learning and Pricing for Network Revenue Management with Reusable Resources NeurIPS 2022 Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards ICML 2022 On the Value of Prior in Online Learning to Rank AISTATS 2022 Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs COLT 2022 Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022 Open Problem: Regret Bounds for Noise-Free Kernel-Based Bandits COLT 2022 Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022 Optimal Clustering with Noisy Queries via Multi-Armed Bandit ICML 2022 Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits AISTATS 2022 Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees NeurIPS 2022 Pareto Optimal Model Selection in Linear Bandits AISTATS 2022 Peer Prediction for Learning Agents NeurIPS 2022 Pessimism for Offline Linear Contextual Bandits using ℓ_p Confidence Sets NeurIPS 2022 ProtoBandit: Efficient Prototype Selection via Multi-Armed Bandits ACML 2022 Random Effect Bandits AISTATS 2022 Real-Time Driver-Request Assignment in Ridesourcing AAAI 2022 Regret Minimization with Performative Feedback ICML 2022 Regret, stability & fairness in matching markets with bandit learners AISTATS 2022 Reinforcement Learning Augmented Asymptotically Optimal Index Policy for Finite-Horizon Restless Bandits AAAI 2022 Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022