Inexact acquisition maximization with bounded accumulated inaccuracy preserves sublinear regret, and random grid search with |X_t|=Theta(t) is a sufficient acquisition solver.
Improved algorithms for linear stochastic bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Bayesian Optimization with Inexact Acquisition: Is Random Grid Search Sufficient?
Inexact acquisition maximization with bounded accumulated inaccuracy preserves sublinear regret, and random grid search with |X_t|=Theta(t) is a sufficient acquisition solver.