On a regularization of unsupervised domain adaptation in RKHS

We analyze the use of the so-called general regularization scheme in the scenario of unsupervised domain adaptation under the covariate shift assumption. Learning algorithms arising from the above scheme are generalizations of importance weighted regularized least squares method, which up to now is among the most used approaches in the covariate shift setting. We explore a link between the considered domain adaptation scenario and estimation of Radon-Nikodym derivatives in reproducing kernel Hilbert spaces, where the general regularization scheme can also be employed and is a generalization of the kernelized unconstrained leastsquares importance fitting. We estimate the convergence rates of the corresponding regularized learning algorithms and discuss how to resolve the issue with the tuning of their regularization parameters. The theoretical results are illustrated by numerical examples, one of which is based on real data collected for automatic stenosis detection in cervical arteries.

Automated summary

In this study, we analyze the use of the general regularization scheme in unsupervised domain adaptation under the covariate shift assumption. The results show that the general scheme is a generalization of importance weighted regularized least squares method and can be linked to the estimation of Radon-Nikodym derivatives in reproducing kernel Hilbert spaces. Numerical examples are provided to illustrate the theoretical findings.