bandit algorithm

Learning to Rank under Multinomial Logit Choice JMLR 2023 Logarithmic regret in communicating MDPs: Leveraging known dynamics with bandits ACML 2023 Meta-Learning for Simple Regret Minimization AAAI 2023 Multi-Agent Best Arm Identification with Private Communications ICML 2023 Online Corrupted User Detection and Regret Minimization NeurIPS 2023 Overcoming Prior Misspecification in Online Learning to Rank AISTATS 2023 Practical Contextual Bandits with Feedback Graphs NeurIPS 2023 Reward Imputation with Sketching for Contextual Batched Bandits NeurIPS 2023 Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms NeurIPS 2023 A Fast Algorithm for PAC Combinatorial Pure Exploration AAAI 2022 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees CVPR 2022 Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits JMLR 2022 Graph Neural Network Bandits NeurIPS 2022 IMED-RL: Regret optimal learning of ergodic Markov decision processes NeurIPS 2022 Incentivizing Combinatorial Bandit Exploration NeurIPS 2022 Maximizing and Satisficing in Multi-armed Bandits with Graph Information NeurIPS 2022 Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification NeurIPS 2022 Minimax Regret for Cascading Bandits NeurIPS 2022 Multi-Fidelity Best-Arm Identification NeurIPS 2022 Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NeurIPS 2022 Online Decision Mediation NeurIPS 2022 Online Learning and Pricing for Network Revenue Management with Reusable Resources NeurIPS 2022 On the Value of Prior in Online Learning to Rank AISTATS 2022 Product Ranking for Revenue Maximization with Multiple Purchases NeurIPS 2022