Multi-Armed Bandits

Adversarial Attacks on Online Learning to Rank with Click Feedback NeurIPS 2023 Affective and Dynamic Beam Search for Story Generation EMNLP 2023 A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023 Allocating Divisible Resources on Arms with Unknown and Random Rewards COLT 2023 Almost Cost-Free Communication in Federated Best Arm Identification AAAI 2023 An Information-Theoretic Analysis of Nonstationary Bandit Learning ICML 2023 An Optimization-based Algorithm for Non-stationary Kernel Bandits without Prior Knowledge AISTATS 2023 Anytime Model Selection in Linear Bandits NeurIPS 2023 Approximately Stationary Bandits with Knapsacks COLT 2023 A Second-Order Method for Stochastic Bandit Convex Optimisation COLT 2023 Asymptotically Unbiased Off-Policy Policy Evaluation when Reusing Old Data in Nonstationary Environments AISTATS 2023 Asymptotic Instance-Optimal Algorithms for Interactive Decision Making ICLR 2023 A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs COLT 2023 Bandit Learnability can be Undecidable COLT 2023 Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits ICML 2023 Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023 Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning ICML 2023 Bayesian Optimization with Conformal Prediction Sets AISTATS 2023 Best Arm Identification in Multi-Agent Multi-Armed Bandits ICML 2023 Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm COLT 2023 Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds COLT 2023 Boosted Off-Policy Learning AISTATS 2023 Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NeurIPS 2023 Causal Entropy Optimization AISTATS 2023 Collaborative Pure Exploration in Kernel Bandit ICLR 2023