A kernel-interpolation explore-then-commit algorithm achieves sublinear regret in high-dimensional contextual bandits under low-rank context covariance, and sublinear lenient regret under weaker spectral decay.
High-dimensional contextual bandit problem without sparsity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
REJECT 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
High-dimensional Nonparametric Contextual Bandit Problem
A kernel-interpolation explore-then-commit algorithm achieves sublinear regret in high-dimensional contextual bandits under low-rank context covariance, and sublinear lenient regret under weaker spectral decay.