Efficient and Provable Algorithms for Covariate Shift

Covariate shift, a widely used assumption in tackling it distributional shift (when training and test distributions differ), focuses on scenarios where the distribution of the labels conditioned on the feature vector is the same, but the distribution of features in the training and test data are different. Despite the significance and extensive work on covariate shift, theoretical guarantees for algorithms in this domain remain sparse. In this paper, we distill the essence of the covariate shift problem and focus on estimating the average mathbbE_tildex~ ptestf(tildex), of any unknown and bounded function f, given labeled training samples (xi, f(xi)), and unlabeled test samples tildexi; this is a core subroutine for several widely studied learning problems. We give several efficient algorithms, with provable sample complexity and computational guarantees. Moreover, we provide the first rigorous analysis of algorithms in this space when f is unrestricted, laying the groundwork for developing a solid theoretical foundation for covariate shift problems.