pure exploration

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty UAI 2026 Adaptive Threshold Sampling for Pure Exploration in Submodular Bandits UAI 2025 Cost-Aware Optimal Pairwise Pure Exploration AISTATS 2025 Near Optimal Non-asymptotic Sample Complexity of 1-Identification ICML 2025 Optimal Multi-Objective Best Arm Identification with Fixed Confidence AISTATS 2025 Pure Exploration with Feedback Graphs AISTATS 2025 Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits AISTATS 2025 The Batch Complexity of Bandit Pure Exploration ICML 2025 Adaptive Experimentation When You Can't Experiment NeurIPS 2024 Bandit Pareto Set Identification: the Fixed Budget Setting AISTATS 2024 Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit AISTATS 2024 Learning the Pareto Set Under Incomplete Preferences: Pure Exploration in Vector Bandits AISTATS 2024 Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits AISTATS 2024 On Interpolating Experts and Multi-Armed Bandits ICML 2024 Optimal Exploration is no harder than Thompson Sampling AISTATS 2024 Preference-based Pure Exploration NeurIPS 2024 Pure Exploration in Asynchronous Federated Bandits UAI 2024 Pure Exploration in Bandits with Linear Constraints AISTATS 2024 Query-Efficient Correlation Clustering with Noisy Oracle NeurIPS 2024 Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning NeurIPS 2024 The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits COLT 2024 Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits NeurIPS 2023 Collaborative Pure Exploration in Kernel Bandit ICLR 2023 Combinatorial Pure Exploration of Causal Bandits ICLR 2023 Information-Directed Selection for Top-Two Algorithms COLT 2023