{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/deep-multi-wasserstein-unsupervised-domain","title":"Deep multi-Wasserstein unsupervised domain adaptation","arxiv_id":null,"date":"2019-04-30","proceeding":"Pattern Recognition Letters 2019 4","authors":["Tien-Nam Le","Amaury Habrard","Marc Sebban"],"abstract":"In unsupervised domain adaptation (DA), 1 aims at learning from labeled source data and fully unlabeled target examples a model with a low error on the target domain. In this setting, standard generalization bounds prompt us to minimize the sum of three terms: (a) the source true risk, (b) the divergence be- tween the source and target domains, and (c) the combined error of the ideal joint hypothesis over the two domains. Many DA methods – especially those using deep neural networks – have focused on the first two terms by using different divergence measures to align the source and target distributions on a shared latent feature space, while ignoring the third term, assuming it is negligible to perform the adaptation. However, it has been shown that purely aligning the two distributions while minimizing the source error may lead to so-called negative transfer . In this paper, we address this issue with a new deep unsupervised DA method – called MCDA – minimizing the first two terms while controlling the third one. MCDA benefits from highly-confident target samples (using softmax predictions) to minimize class- wise Wasserstein distances and efficiently approximate the ideal joint hypothesis. Empirical results show that our approach outperforms state of the art methods.","url_abs":"https://www.sciencedirect.com/science/article/abs/pii/S0167865519301400?via%3Dihub","url_pdf":null,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-multi-wasserstein-unsupervised-domain","repo_url":"https://github.com/CtrlZ1/Domain-Adaptation-Algorithms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deep-multi-wasserstein-unsupervised-domain","repo_url":"https://github.com/CtrlZ1/Domain-Adaptive-CodeBase","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"generalization-bounds","task_name":"Generalization Bounds"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"CtrlZ1/Domain-Adaptation-Algorithms","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CtrlZ1/Domain-Adaptive-CodeBase","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f78805e487af0b15ba92771ebc7645a5c8635becb10b748ba78fa09ca79dacb2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}