Abstract

This paper concerns structured regression problems wherein the issue of covariate shift is addressed, which aims at reducing the discrepancy in training and test data distributions, using computationally efficient and sparse optimization principles. In particular, the projection-free Frank–Wolfe optimization algorithms are used to learn the importance weights and re-weight the training data in the context of covariate shift. To determine the unbiased estimates of the weights, Kullback–Leibler importance estimation procedure is used but its computational cost can be high since it is based on projected gradient optimization. Instead of using the standard Frank–Wolfe algorithm, we adapt its variants and propose away-steps Frank–Wolfe and pairwise Frank–Wolfe covariate shift algorithms to correct the covariate shift. The results highlight the improved computational efficiency and sparsity achieved while learning the importance weights on synthetic as well as benchmark datasets. Furthermore, importance weighted Sharma-Mittal twin Gaussian process structured regression framework is proposed to incorporate the learned weights from covariate shift algorithms, and its equations are derived for importance weighted derivatives and uncertainties. The performance of proposed algorithms is evaluated on two applications of structured regression, namely, human pose estimation and music mood estimation, where the benefit of handling covariate shift is demonstrated with improved performance relative to the state-of-the-art techniques.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.