BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Batched Single-Index Global Multi-Armed Bandits with Covariates
BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.