Multi-Armed Bandits

TRAttack: Text Rewriting Attack Against Text Retrieval ACL 2022 Tsetlin Machine for Solving Contextual Bandit Problems NeurIPS 2022 UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022 Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022 Uplifting Bandits NeurIPS 2022 Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022 Weighted Gaussian Process Bandits for Non-stationary Environments AISTATS 2022 When Are Linear Stochastic Bandits Attackable? ICML 2022 When Combinatorial Thompson Sampling meets Approximation Regret NeurIPS 2022 When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits NeurIPS 2022 A/B/n Testing with Control in the Presence of Subpopulations NeurIPS 2021 A Contextual Bandit Bake-off JMLR 2021 Adaptive Discretization for Adversarial Lipschitz Bandits COLT 2021 Addressing the Long-term Impact of ML Decisions via Policy Regret IJCAI 2021 Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021 Adversarial Dueling Bandits ICML 2021 AI for Planning Public Health Interventions IJCAI 2021 Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021 An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NeurIPS 2021 A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021 Approximation Theory Based Methods for RKHS Bandits ICML 2021 Asymptotically Best Causal Effect Identification with Multi-Armed Bandits NeurIPS 2021 Asymptotically Optimal Information-Directed Sampling COLT 2021 Auditing Black-Box Prediction Models for Data Minimization Compliance NeurIPS 2021 A unified framework for bandit multiple testing NeurIPS 2021