No article text was recorded for this version.
fixed-budget best-arm identification
Version 2 of 288 papers91 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Bandits
- Blog: Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem
- Blog: Learning to Select and Rank from Choice-Based Feedback: A Simple Nested Approach
- Blog: ICQ: A Quantization Scheme for Best-Arm Identification Over Bit-Constrained Channels
- Blog: Posterior Tracking Algorithm for Classification Bandits
- Blog: Best-Arm Identification in Linear Bandits
- Blog: On Universally Optimal Algorithms for A/B Testing
- Blog: On Universally Optimal Algorithms for A/B Testing
- Blog: Robust Pure Exploration in Linear Bandits with Limited Budget
- Blog: The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
- Blog: Information-Directed Selection for Top-Two Algorithms
- Blog: An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
- Blog: Thresholding Bandits with Augmented UCB
- Blog: Optimal Best-Arm Identification in Bandits with Access to Offline Data
- Blog: Fixed-confidence guarantees for Bayesian best-arm identification
- Blog: Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
- Blog: Best Arm Identification with Fairness Constraints on Subpopulations
- Blog: Dealing with Unknown Variances in Best-Arm Identification
- Blog: Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
- Blog: Adaptive Algorithms for Relaxed Pareto Set Identification
- Blog: Adaptive Double-Exploration Tradeoff for Outlier Detection
- Blog: From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model
- Blog: Pure Exploration in Asynchronous Federated Bandits
- Blog: Fixed-Budget Change Point Identification in Piecewise Constant Bandits
- Blog: STAR-Bets: Sequential TArget-Recalculating Bets for Tighter Confidence Intervals
- Blog: Improving Group Testing via Gradient Descent
- Blog: Stochastically Constrained Best Arm Identification with Thompson Sampling
- Blog: Best-Arm Identification in Unimodal Bandits
- Blog: Near-Optimal Design of Experiments via Regret Minimization
- Blog: Finding All $\epsilon$-Good Arms in Stochastic Bandits
- Blog: On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits
- Blog: Optimal Multi-Objective Best Arm Identification with Fixed Confidence
- Blog: Dissimilarity Bandits
- Blog: Identifying All ε-Best Arms in (Misspecified) Linear Bandits
- Blog: Thompson Sampling for (Combinatorial) Pure Exploration
- Blog: Parallel Best Arm Identification in Heterogeneous Environments
- Blog: The True Sample Complexity of Identifying Good Arms
- Blog: Fixed Budget Bayesian Best Arm Identification in Unimodal Bandits
- Blog: On Finding the Largest Mean Among Many
- Blog: Best-Arm Identification in Linear Bandits
- Blog: A PTAS for the Bayesian Thresholding Bandit Problem
- Blog: On Interruptible Pure Exploration in Multi-Armed Bandits
- Blog: On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits
- Blog: Experimental Design for Semiparametric Bandits
- Blog: Optimal Arms Identification with Knapsacks
- Blog: Optimal Best Arm Identification with Fixed Confidence
- Blog: Optimal Thresholding Linear Bandit
- Blog: Federated Best Arm Identification with Heterogeneous Clients
- Blog: A fully adaptive algorithm for pure exploration in linear bandits
- Blog: Constrained Pareto Set Identification with Bandit Feedback
- Blog: Bandit Pareto Set Identification: the Fixed Budget Setting
- Blog: Best Arm Identification in Linear Bandits with Linear Dimension Dependency
- Blog: Multiple Identifications in Multi-Armed Bandits
- Blog: Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
- Blog: Top Feasible Arm Identification
- Blog: ICQ: A Quantization Scheme for Best-Arm Identification Over Bit-Constrained Channels
- Blog: Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting
- Blog: Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications
- Blog: The Sample Complexity of Best-k Items Selection from Pairwise Comparisons
- Blog: Top Two Algorithms Revisited
Showing 60 of 88 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_fixed_budget_best_arm_identification_d0a7ee12,
title = {fixed-budget best-arm identification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-budget-best-arm-identification/rdr_d0a7ee1206314a44afdac3231a097c10},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_fixed_budget_best_arm_identification_d0a7ee12_v2,
title = {fixed-budget best-arm identification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-budget-best-arm-identification/rdr_d0a7ee1206314a44afdac3231a097c10/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}