2014 · 149 citations · 26 references
ComputingComputer ScienceComputer VisionMachine LearningStatistical LearningClassificationObject RecognitionUnsupervised LearningDomain AdaptationManifold LearningRiemannian MetricUnsupervised Object Recognition
In this paper, we tackle the problem of unsupervised domain adaptation for classification. In the unsupervised scenario where no labeled samples from the target domain are provided, a popular approach consists in transforming the data such that the source and target distributions become similar. To compare the two distributions, existing approaches make use of the Maximum Mean Discrepancy (MMD). However, this does not exploit the fact that probability distributions lie on a Riemannian manifold. Here, we propose to make better use of the structure of this manifold and rely on the distance on the manifold to compare the source and target distributions. In this framework, we introduce a sample selection method and a subspace-based method for unsupervised domain adaptation, and show that both these manifold-based techniques outperform the corresponding approaches based on the MMD. Furthermore, we show that our subspace-based approach yields state-of-the-art results on a standard object recognition benchmark.
26
Arthur Gretton, Karsten Borgwardt, Malte J. Rasch et al. · MPG.PuRe (Max Planck Society) · 2012 · 2.2K citations · Full text
Geodesic flow kernel for unsupervised domain adaptation
Boqing Gong, Yuan Shi, Fei Sha et al. · 2012 · 2.2K citations