Multi-Armed Bandits

Online learning in bandits with predicted context AISTATS 2024 Online Learning in Contextual Second-Price Pay-Per-Click Auctions AISTATS 2024 Online Learning of Delayed Choices NeurIPS 2024 Online Learning with Sublinear Best-Action Queries NeurIPS 2024 Online Newton Method for Bandit Convex Optimisation Extended Abstract COLT 2024 Online Restless Multi-Armed Bandits with Long-Term Fairness Constraints AAAI 2024 Only Pay for What Is Uncertain: Variance-Adaptive Thompson Sampling ICLR 2024 On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice NeurIPS 2024 On Weak Regret Analysis for Dueling Bandits NeurIPS 2024 Open Problem: What is the Complexity of Joint Differential Privacy in Linear Contextual Bandits? COLT 2024 Optimal Clustering with Bandit Feedback JMLR 2024 Optimal Scalarizations for Sublinear Hypervolume Regret NeurIPS 2024 Optimal Top-Two Method for Best Arm Identification and Fluid Analysis NeurIPS 2024 Optimal Zero-Shot Detector for Multi-Armed Attacks AISTATS 2024 Optimistic Information Directed Sampling COLT 2024 Oracle-Efficient Hybrid Online Learning with Unknown Distribution COLT 2024 Pandora’s Problem with Deadlines AAAI 2024 Piecewise-Stationary Bandits with Knapsacks NeurIPS 2024 Power Mean Estimation in Stochastic Monte-Carlo Tree Search UAI 2024 Predicting Real-World Penny Auction Durations by Integrating Game Theory and Machine Learning AAAI 2024 Preference-based Pure Exploration NeurIPS 2024 Pricing and Competition for Generative AI NeurIPS 2024 PRODuctive bandits: Importance Weighting No More NeurIPS 2024 Provably Efficient UCB-type Algorithms For Learning Predictive State Representations ICLR 2024 Pure Exploration in Asynchronous Federated Bandits UAI 2024