An Embarrassingly Simple Approach to Visual Domain Adaptation

Citations Over TimeTop 10% of 2018 papers

Abstract

We show that it is possible to achieve high-quality domain adaptation without explicit adaptation. The nature of the classification problem means that when samples from the same class in different domains are sufficiently close, and samples from differing classes are separated by large enough margins, there is a high probability that each will be classified correctly. Inspired by this, we propose an embarrassingly simple yet effective approach to domain adaptation-only the class mean is used to learn class-specific linear projections. Learning these projections is naturally cast into a linear-discriminant-analysis-like framework, which gives an efficient, closed form solution. Furthermore, to enable to application of this approach to unsupervised learning, an iterative validation strategy is developed to infer target labels. Extensive experiments on cross-domain visual recognition demonstrate that, even with the simplest formulation, our approach outperforms existing non-deep adaptation methods and exhibits classification performance comparable with that of modern deep adaptation methods. An analysis of potential issues effecting the practical application of the method is also described, including robustness, convergence, and the impact of small sample sizes.

Related Papers

• → Improvement of the Embarrassingly Parallel Search for Data Centers(2014)18 cited
• → Optimization Monte Carlo: Efficient and Embarrassingly Parallel Likelihood-Free Inference(2015)15 cited
• → Where are embarrassingly parallel problems? The atom-diatom quasiclassical reactivity(1993)10 cited
• → A Tool for Programming Embarrassingly Task Parallel Applications on CoW and NoW(2013)
• → A Tool for Programming Embarrassingly Task Parallel Applications on CoW\n and NoW(2013)