multi-armed bandit

The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication COLT 2022 Thompson Sampling for Bandit Learning in Matching Markets IJCAI 2022 Thompson Sampling for (Combinatorial) Pure Exploration ICML 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 Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information COLT 2022 Tracking Most Significant Arm Switches in Bandits COLT 2022 Tractable Optimality in Episodic Latent MABs NeurIPS 2022 Trading Off Resource Budgets For Improved Regret Bounds NeurIPS 2022 TRAttack: Text Rewriting Attack Against Text Retrieval ACL 2022 UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022 Uplifting Bandits NeurIPS 2022 Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022 When Are Linear Stochastic Bandits Attackable? ICML 2022 When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits NeurIPS 2022 A Biased Graph Neural Network Sampler with Near-Optimal Regret NeurIPS 2021 A/B/n Testing with Control in the Presence of Subpopulations NeurIPS 2021 Achieving Fairness in the Stochastic Multi-Armed Bandit Problem JMLR 2021 A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NeurIPS 2021 Active Feature Selection for the Mutual Information Criterion AAAI 2021 Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021 Adaptive Discretization for Adversarial Lipschitz Bandits COLT 2021