High-dimensional Linear Bandits with Knapsacks
An online variant of the hard thresholding algorithm that performs the sparse estimation in an online manner is developed and embedded in a primal-dual scheme: every knapsack constraint is paired with a dual variable, which is updated by an online learning rule to keep the cumulative resource consumption within budget.