simple regret

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons AAAI 2026 Adaptive Partitioning Schemes for Optimistic Optimization ICML 2025 Best Arm Identification for Stochastic Rising Bandits ICML 2024 An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond NeurIPS 2023 A stopping criterion for Bayesian optimization by the gap of expected minimum simple regrets AISTATS 2023 Learning good interventions in causal graphs via covering UAI 2023 Meta-Learning for Simple Regret Minimization AAAI 2023 Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimization NeurIPS 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 A causal bandit approach to learning good atomic interventions in presence of unobserved confounders UAI 2022 Gaussian Process Bandits with Aggregated Feedback AAAI 2022 Budgeted and Non-Budgeted Causal Bandits AISTATS 2021 Optimal Order Simple Regret for Gaussian Process Bandits NeurIPS 2021 Adaptive multi-fidelity optimization with fast learning rates AISTATS 2020 Derivative-Free & Order-Robust Optimisation AISTATS 2020 Identifying Best Interventions through Online Importance Sampling ICML 2017 Causal Bandits: Learning Good Interventions via Causal Inference NeurIPS 2016 Minimum Regret Search for Single- and Multi-Task Optimization ICML 2016 Simple regret for infinitely many armed bandits ICML 2015