{"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/self-ensembling-for-visual-domain-adaptation","title":"Self-ensembling for visual domain adaptation","arxiv_id":"1706.05208","date":"2017-06-16","proceeding":"ICLR 2018 1","authors":["Geoffrey French","Michal Mackiewicz","Mark Fisher"],"abstract":"This paper explores the use of self-ensembling for visual domain adaptation\nproblems. Our technique is derived from the mean teacher variant (Tarvainen et\nal., 2017) of temporal ensembling (Laine et al;, 2017), a technique that\nachieved state of the art results in the area of semi-supervised learning. We\nintroduce a number of modifications to their approach for challenging domain\nadaptation scenarios and evaluate its effectiveness. Our approach achieves\nstate of the art results in a variety of benchmarks, including our winning\nentry in the VISDA-2017 visual domain adaptation challenge. In small image\nbenchmarks, our algorithm not only outperforms prior art, but can also achieve\naccuracy that is close to that of a classifier trained in a supervised fashion.","url_abs":"http://arxiv.org/abs/1706.05208v4","url_pdf":"http://arxiv.org/pdf/1706.05208v4.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":"self-ensembling-for-visual-domain-adaptation","repo_url":"https://github.com/Britefury/self-ensemble-visual-domain-adapt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"self-ensembling-for-visual-domain-adaptation","repo_url":"https://github.com/domainadaptation/salad","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MPL-2.0"}},{"paper_slug":"self-ensembling-for-visual-domain-adaptation","repo_url":"https://github.com/thuml/Transfer-Learning-Library","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-mnist-to-usps","task":"Domain Adaptation","dataset":"MNIST-to-USPS","model":"Mean teacher","rank_in_archive_order":4,"of":14,"metrics":{"Accuracy":"98.26"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-svhn-to-mnist","task":"Domain Adaptation","dataset":"SVHN-to-MNIST","model":"Mean teacher","rank_in_archive_order":1,"of":14,"metrics":{"Accuracy":"99.18"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-synth-signs-to-gtsrb","task":"Domain Adaptation","dataset":"Synth Signs-to-GTSRB","model":"Mean teacher","rank_in_archive_order":1,"of":4,"metrics":{"Accuracy":"98.66"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-usps-to-mnist","task":"Domain Adaptation","dataset":"USPS-to-MNIST","model":"Mean teacher","rank_in_archive_order":6,"of":14,"metrics":{"Accuracy":"98.07"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-visda2017","task":"Domain Adaptation","dataset":"VisDA2017","model":"Mean teacher","rank_in_archive_order":17,"of":28,"metrics":{"Accuracy":"85.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.05208","atlas_url":"https://app.syntology.ai/?focus=1706.05208","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":"1706.05208"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.05208\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.05208"},"call":"get_concepts_for_paper(arxiv_id=\"1706.05208\")"}],"by_repo":[{"repo":"Britefury/self-ensemble-visual-domain-adapt","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"domainadaptation/salad","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":"86a69b7ab2dbdcd6a1d5966bba39ae9d82bb1d146f47da27e34756a4c6a72f3e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}