Active Linear Regression
share
We consider the problem of active linear regression where a decision maker has to choose between several covariates to sample in order to obtain the best estimate β̂ of the parameter β^ of the linear model, in the sense of minimizing Eβ̂-β^^2. Using bandit and convex optimization techniques we propose an algorithm to define the sampling strategy of the decision maker and we compare it with other algorithms. We provide theoretical guarantees of our algorithm in different settings, including a O(T^-2) regret bound in the case where the covariates form a basis of the feature space, generalizing and improving existing results. Numerical experiments validate our theoretical findings.
READ FULL TEXT
