conftrace_

pure exploration

50 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) sample complexity (1169) linear bandit (124) combinatorial optimization (1039) best-arm identification (38) active learning (1301) arm identification (11) stochastic bandit (98) best arm identification (85) confidence bound (29)

Papers

Preference-based Pure Exploration NIPS 2024
Bandit Pareto Set Identification: the Fixed Budget Setting AISTATS 2024
Learning the Pareto Set Under Incomplete Preferences: Pure Exploration in Vector Bandits AISTATS 2024
Query-Efficient Correlation Clustering with Noisy Oracle NIPS 2024
Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit AISTATS 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NIPS 2024
Optimal Exploration is no harder than Thompson Sampling AISTATS 2024
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits AISTATS 2024
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits COLT 2024
Adaptive Experimentation When You Can't Experiment NIPS 2024
Pure Exploration in Bandits with Linear Constraints AISTATS 2024
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023
Optimal Arms Identification with Knapsacks ICML 2023
Online Certification of Preference-Based Fairness for Personalized Recommender Systems (Extended Abstract) IJCAI 2023
Multi-task Representation Learning for Pure Exploration in Linear Bandits ICML 2023
Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023
Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits NIPS 2023
Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022
Near Instance Optimal Model Selection for Pure Exploration Linear Bandits AISTATS 2022
Thompson Sampling for (Combinatorial) Pure Exploration ICML 2022
Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022
Maximizing and Satisficing in Multi-armed Bandits with Graph Information NIPS 2022
Fast Pure Exploration via Frank-Wolfe NIPS 2021
Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback ALT 2021