Offline data from a distribution of bandit tasks provably identifies near-optimal algorithm hyperparameters, with inter-task sample complexity depending on a new piecewise-complexity measure QD.
Sequential transfer in multi-armed bandit with finite set of models
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Offline-to-online hyperparameter transfer for stochastic bandits
Offline data from a distribution of bandit tasks provably identifies near-optimal algorithm hyperparameters, with inter-task sample complexity depending on a new piecewise-complexity measure QD.