{"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/unified-deep-supervised-domain-adaptation-and","title":"Unified Deep Supervised Domain Adaptation and Generalization","arxiv_id":"1709.10190","date":"2017-09-28","proceeding":"ICCV 2017 10","authors":["Saeid Motiian","Marco Piccirilli","Donald A. Adjeroh","Gianfranco Doretto"],"abstract":"This work provides a unified framework for addressing the problem of visual\nsupervised domain adaptation and generalization with deep models. The main idea\nis to exploit the Siamese architecture to learn an embedding subspace that is\ndiscriminative, and where mapped visual domains are semantically aligned and\nyet maximally separated. The supervised setting becomes attractive especially\nwhen only few target data samples need to be labeled. In this scenario,\nalignment and separation of semantic probability distributions is difficult\nbecause of the lack of data. We found that by reverting to point-wise\nsurrogates of distribution distances and similarities provides an effective\nsolution. In addition, the approach has a high speed of adaptation, which\nrequires an extremely low number of labeled target training samples, even one\nper category can be effective. The approach is extended to domain\ngeneralization. For both applications the experiments show very promising\nresults.","url_abs":"http://arxiv.org/abs/1709.10190v1","url_pdf":"http://arxiv.org/pdf/1709.10190v1.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":"unified-deep-supervised-domain-adaptation-and","repo_url":"https://github.com/YooJiHyeong/CCSA_PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"unified-deep-supervised-domain-adaptation-and","repo_url":"https://github.com/adapt-python/adapt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"unified-deep-supervised-domain-adaptation-and","repo_url":"https://github.com/samotiian/CCSA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"domain-generalization","task_name":"Domain Generalization"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-generalization-on-pacs-2","task":"Domain Generalization","dataset":"PACS","model":"CCSA (Resnet-18)","rank_in_archive_order":96,"of":133,"metrics":{"Average Accuracy":"79.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1709.10190","atlas_url":"https://app.syntology.ai/?focus=1709.10190","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":"1709.10190"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1709.10190\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1709.10190"},"call":"get_concepts_for_paper(arxiv_id=\"1709.10190\")"}],"by_repo":[{"repo":"YooJiHyeong/CCSA_PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"adapt-python/adapt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1409.7495","1607.01719","1702.05464"],"harvested_for_calls":[{"arxiv_id":"1409.7495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1409.7495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1409.7495\")"},{"arxiv_id":"1607.01719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.01719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.01719\")"},{"arxiv_id":"1702.05464","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.05464"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.05464\")"}]},{"repo":"samotiian/CCSA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"0d975ec519b8de3505b17fe85621d289b4e37030c9a2ba9ff8506d23862db165","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}