Dimension Reduction in Contextual Online Learning via Nonparametric Variable Selection
share
We consider a contextual online learning (multi-armed bandit) problem with high-dimensional covariate 𝐱 and decision 𝐲. The reward function to learn, f(𝐱,𝐲), does not have a particular parametric form. The literature has shown that the optimal regret is Õ(T^(d_x+d_y+1)/(d_x+d_y+2)), where d_x and d_y are the dimensions of 𝐱 and 𝐲, and thus it suffers from the curse of dimensionality. In many applications, only a small subset of variables in the covariate affect the value of f, which is referred to as sparsity in statistics. To take advantage of the sparsity structure of the covariate, we propose a variable selection algorithm called BV-LASSO, which incorporates novel ideas such as binning and voting to apply LASSO to nonparametric settings. Our algorithm achieves the regret Õ(T^(d_x^*+d_y+1)/(d_x^*+d_y+2)), where d_x^* is the effective covariate dimension. The regret matches the optimal regret when the covariate is d^*_x-dimensional and thus cannot be improved. Our algorithm may serve as a general recipe to achieve dimension reduction via variable selection in nonparametric settings.
READ FULL TEXT