Personalizing Many Decisions with High-Dimensional
Covariates
Nima Hamidi Mohsen Bayati Kapil Gupta
Abstract
We consider the k-armed stochastic contextual bandit problem with d dimensional
features, when both k and d can be large. To the best of our knowledge, all existing
algorithms for this problem have a regret bound that scale as polynomials of degree
at least two in k and d. The main contribution of this pa ...


雷达卡


京公网安备 11010802022788号







