{"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/open-set-domain-adaptation-by-backpropagation","title":"Open Set Domain Adaptation by Backpropagation","arxiv_id":"1804.10427","date":"2018-04-27","proceeding":"ECCV 2018 9","authors":["Kuniaki Saito","Shohei Yamamoto","Yoshitaka Ushiku","Tatsuya Harada"],"abstract":"Numerous algorithms have been proposed for transferring knowledge from a\nlabel-rich domain (source) to a label-scarce domain (target). Almost all of\nthem are proposed for a closed-set scenario, where the source and the target\ndomain completely share the class of their samples. We call the shared class\nthe \\doublequote{known class.} However, in practice, when samples in target\ndomain are not labeled, we cannot know whether the domains share the class. A\ntarget domain can contain samples of classes that are not shared by the source\ndomain. We call such classes the \\doublequote{unknown class} and algorithms\nthat work well in the open set situation are very practical. However, most\nexisting distribution matching methods for domain adaptation do not work well\nin this setting because unknown target samples should not be aligned with the\nsource.\n  In this paper, we propose a method for an open set domain adaptation scenario\nwhich utilizes adversarial training. A classifier is trained to make a boundary\nbetween the source and the target samples whereas a generator is trained to\nmake target samples far from the boundary. Thus, we assign two options to the\nfeature generator: aligning them with source known samples or rejecting them as\nunknown target samples. This approach allows extracting features that separate\nunknown target samples from known target samples. Our method was extensively\nevaluated in domain adaptation setting and outperformed other methods with a\nlarge margin in most settings.","url_abs":"http://arxiv.org/abs/1804.10427v2","url_pdf":"http://arxiv.org/pdf/1804.10427v2.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":"open-set-domain-adaptation-by-backpropagation","repo_url":"https://github.com/ChenJinBIT/OSDA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"open-set-domain-adaptation-by-backpropagation","repo_url":"https://github.com/ksaito-ut/OPDA_BP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"open-set-domain-adaptation-by-backpropagation","repo_url":"https://github.com/redhat12345/Domain-Adaptation-Papers-and-Codes","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"open-set-domain-adaptation-by-backpropagation","repo_url":"https://github.com/thuml/Transfer-Learning-Library","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.10427","atlas_url":"https://app.syntology.ai/?focus=1804.10427","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":"1804.10427"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.10427\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.10427"},"call":"get_concepts_for_paper(arxiv_id=\"1804.10427\")"}],"by_repo":[{"repo":"ChenJinBIT/OSDA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ksaito-ut/OPDA_BP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"redhat12345/Domain-Adaptation-Papers-and-Codes","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thuml/Transfer-Learning-Library","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["1409.7495","1502.02791","1607.01719","1702.05464","1811.12833","1904.05801","2001.01526"],"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":"1502.02791","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.02791"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.02791\")"},{"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\")"},{"arxiv_id":"1811.12833","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.12833"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.12833\")"},{"arxiv_id":"1904.05801","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.05801"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.05801\")"},{"arxiv_id":"2001.01526","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01526"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01526\")"}]}],"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":"f0b27a3c1e1edb6e8c4e94009889873d31dd9e09eb92b82d3b00a76bddd22521","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}