Multi-Armed Bandits

Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback NeurIPS 2022 Game Redesign in No-regret Game Playing IJCAI 2022 Gaussian Process Bandits with Aggregated Feedback AAAI 2022 Graph Neural Network Bandits NeurIPS 2022 Hierarchical Bayesian Bandits AISTATS 2022 Identifying near-optimal decisions in linear-in-parameter bandit models with continuous decision sets UAI 2022 IMED-RL: Regret optimal learning of ergodic Markov decision processes NeurIPS 2022 Incentivizing Combinatorial Bandit Exploration NeurIPS 2022 Instance Dependent Regret Analysis of Kernelized Bandits ICML 2022 Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022 Inverse Contextual Bandits: Learning How Behavior Evolves over Time ICML 2022 Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022 k-experts - Online Policies and Fundamental Limits AISTATS 2022 KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints JMLR 2022 Langevin Monte Carlo for Contextual Bandits ICML 2022 Learning Competitive Equilibria in Exchange Economies with Bandit Feedback AISTATS 2022 Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits AISTATS 2022 Learning in Congestion Games with Bandit Feedback NeurIPS 2022 Learning Infinite-Horizon Average-Reward Restless Multi-Action Bandits via Index Awareness NeurIPS 2022 Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions NeurIPS 2022 Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits NeurIPS 2022 Linear Bandit Algorithms with Sublinear Time Complexity ICML 2022 Lipschitz Bandits with Batched Feedback NeurIPS 2022 Maillard Sampling: Boltzmann Exploration Done Optimally AISTATS 2022 Masked Language Models Know Which are Popular: A Simple Ranking Strategy for Commonsense Question Answering EMNLP 2022