A Smoothed Analysis of Online Lasso for the Sparse Linear Contextual Bandit Problem

Zhiyuan Liu, Huazheng Wang, Bo Waggoner +3

We investigate the sparse linear contextual bandit problem where the parameter $\theta$ is sparse. To relieve the sampling inefficiency, we utilize the "perturbed adversary" where the c…