{"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/manifold-criterion-guided-transfer-learning","title":"Manifold Criterion Guided Transfer Learning via Intermediate Domain Generation","arxiv_id":"1903.10211","date":"2019-03-25","proceeding":null,"authors":["Lei Zhang","Shan-Shan Wang","Guang-Bin Huang","WangMeng Zuo","Jian Yang","David Zhang"],"abstract":"In many practical transfer learning scenarios, the feature distribution is\ndifferent across the source and target domains (i.e. non-i.i.d.). Maximum mean\ndiscrepancy (MMD), as a domain discrepancy metric, has achieved promising\nperformance in unsupervised domain adaptation (DA). We argue that MMD-based DA\nmethods ignore the data locality structure, which, to some extent, would cause\nthe negative transfer effect. The locality plays an important role in\nminimizing the nonlinear local domain discrepancy underlying the marginal\ndistributions. For better exploiting the domain locality, a novel local\ngenerative discrepancy metric (LGDM) based intermediate domain generation\nlearning called Manifold Criterion guided Transfer Learning (MCTL) is proposed\nin this paper. The merits of the proposed MCTL are four-fold: 1) the concept of\nmanifold criterion (MC) is first proposed as a measure validating the\ndistribution matching across domains, and domain adaptation is achieved if the\nMC is satisfied; 2) the proposed MC can well guide the generation of the\nintermediate domain sharing similar distribution with the target domain, by\nminimizing the local domain discrepancy; 3) a global generative discrepancy\nmetric (GGDM) is presented, such that both the global and local discrepancy can\nbe effectively and positively reduced; 4) a simplified version of MCTL called\nMCTL-S is presented under a perfect domain generation assumption for more\ngeneric learning scenario. Experiments on a number of benchmark visual transfer\ntasks demonstrate the superiority of the proposed manifold criterion guided\ngenerative transfer method, by comparing with other state-of-the-art methods.\nThe source code is available in https://github.com/wangshanshanCQU/MCTL.","url_abs":"http://arxiv.org/abs/1903.10211v1","url_pdf":"http://arxiv.org/pdf/1903.10211v1.pdf","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":"manifold-criterion-guided-transfer-learning","repo_url":"https://github.com/wangshanshanCQU/MCTL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"},{"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":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"wangshanshanCQU/MCTL","kind":"official","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":"e82aa6bb5d1fb20c7fc0063337d5f6e2e980ef9078b690e6e1df0e8b481f047a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}