{ "id": "2002.08675", "version": "v1", "published": "2020-02-20T11:06:41.000Z", "updated": "2020-02-20T11:06:41.000Z", "title": "Unsupervised Domain Adaptation via Discriminative Manifold Embedding and Alignment", "authors": [ "You-Wei Luo", "Chuan-Xian Ren", "Pengfei Ge", "Ke-Kun Huang", "Yu-Feng Yu" ], "comment": "Accepted to AAAI 2020", "categories": [ "cs.LG", "cs.CV", "stat.ML" ], "abstract": "Unsupervised domain adaptation is effective in leveraging the rich information from the source domain to the unsupervised target domain. Though deep learning and adversarial strategy make an important breakthrough in the adaptability of features, there are two issues to be further explored. First, the hard-assigned pseudo labels on the target domain are risky to the intrinsic data structure. Second, the batch-wise training manner in deep learning limits the description of the global structure. In this paper, a Riemannian manifold learning framework is proposed to achieve transferability and discriminability consistently. As to the first problem, this method establishes a probabilistic discriminant criterion on the target domain via soft labels. Further, this criterion is extended to a global approximation scheme for the second issue; such approximation is also memory-saving. The manifold metric alignment is exploited to be compatible with the embedding space. A theoretical error bound is derived to facilitate the alignment. Extensive experiments have been conducted to investigate the proposal and results of the comparison study manifest the superiority of consistent manifold learning framework.", "revisions": [ { "version": "v1", "updated": "2020-02-20T11:06:41.000Z" } ], "analyses": { "keywords": [ "unsupervised domain adaptation", "discriminative manifold embedding", "target domain", "manifold metric alignment", "global approximation scheme" ], "note": { "typesetting": "TeX", "pages": 0, "language": "en", "license": "arXiv", "status": "editable" } } }