{"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/disjoint-label-space-transfer-learning-with","title":"Disjoint Label Space Transfer Learning with Common Factorised Space","arxiv_id":"1812.02605","date":"2018-12-06","proceeding":null,"authors":["Xiaobin Chang","Yongxin Yang","Tao Xiang","Timothy M. Hospedales"],"abstract":"In this paper, a unified approach is presented to transfer learning that\naddresses several source and target domain label-space and annotation\nassumptions with a single model. It is particularly effective in handling a\nchallenging case, where source and target label-spaces are disjoint, and\noutperforms alternatives in both unsupervised and semi-supervised settings. The\nkey ingredient is a common representation termed Common Factorised Space. It is\nshared between source and target domains, and trained with an unsupervised\nfactorisation loss and a graph-based loss. With a wide range of experiments, we\ndemonstrate the flexibility, relevance and efficacy of our method, both in the\nchallenging cases with disjoint label spaces, and in the more conventional\ncases such as unsupervised domain adaptation, where the source and target\ndomains share the same label-sets.","url_abs":"http://arxiv.org/abs/1812.02605v1","url_pdf":"http://arxiv.org/pdf/1812.02605v1.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":[],"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":[{"leaderboard":"/sota/unsupervised-domain-adaptation-on-duke-to","task":"Unsupervised Domain Adaptation","dataset":"Duke to Market","model":"CFSM","rank_in_archive_order":22,"of":26,"metrics":{"mAP":"28.3","rank-1":"61.2","rank-10":"-","rank-5":"-"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-market-to","task":"Unsupervised Domain Adaptation","dataset":"Market to Duke","model":"CFSM","rank_in_archive_order":21,"of":25,"metrics":{"mAP":"27.3","rank-1":"49.8","rank-10":"-","rank-5":"-"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.02605","atlas_url":"https://app.syntology.ai/?focus=1812.02605","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1812.02605"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.02605\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.02605"},"call":"get_concepts_for_paper(arxiv_id=\"1812.02605\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"692826215d98029952c61003598c090930835fd45d64136e08c4a4ab66d39c19","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}