pure exploration

Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NeurIPS 2023 Multi-task Representation Learning for Pure Exploration in Linear Bandits ICML 2023 Online Certification of Preference-Based Fairness for Personalized Recommender Systems (Extended Abstract) IJCAI 2023 Optimal Arms Identification with Knapsacks ICML 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022 Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022 Maximizing and Satisficing in Multi-armed Bandits with Graph Information NeurIPS 2022 Near Instance Optimal Model Selection for Pure Exploration Linear Bandits AISTATS 2022 Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022 Thompson Sampling for (Combinatorial) Pure Exploration ICML 2022 Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback ALT 2021 Fast active learning for pure exploration in reinforcement learning ICML 2021 Fast Pure Exploration via Frank-Wolfe NeurIPS 2021 Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits ICML 2021 Pure Exploration in Kernel and Neural Bandits NeurIPS 2021 Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 Finding All ε-Good Arms in Stochastic Bandits NeurIPS 2020 Gamification of Pure Exploration for Linear Bandits ICML 2020 Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019 Efficient Pure Exploration in Adaptive Round model NeurIPS 2019 Making the Cut: A Bandit-based Approach to Tiered Interviewing NeurIPS 2019 Non-Asymptotic Pure Exploration by Solving Games NeurIPS 2019 Pure Exploration with Multiple Correct Answers NeurIPS 2019