{"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/visda-the-visual-domain-adaptation-challenge","title":"VisDA: The Visual Domain Adaptation Challenge","arxiv_id":"1710.06924","date":"2017-10-18","proceeding":null,"authors":["Xingchao Peng","Ben Usman","Neela Kaushik","Judy Hoffman","Dequan Wang","Kate Saenko"],"abstract":"We present the 2017 Visual Domain Adaptation (VisDA) dataset and challenge, a\nlarge-scale testbed for unsupervised domain adaptation across visual domains.\nUnsupervised domain adaptation aims to solve the real-world problem of domain\nshift, where machine learning models trained on one domain must be transferred\nand adapted to a novel visual domain without additional supervision. The\nVisDA2017 challenge is focused on the simulation-to-reality shift and has two\nassociated tasks: image classification and image segmentation. The goal in both\ntracks is to first train a model on simulated, synthetic data in the source\ndomain and then adapt it to perform well on real image data in the unlabeled\ntest domain. Our dataset is the largest one to date for cross-domain object\nclassification, with over 280K images across 12 categories in the combined\ntraining, validation and testing domains. The image segmentation dataset is\nalso large-scale with over 30K images across 18 categories in the three\ndomains. We compare VisDA to existing cross-domain adaptation datasets and\nprovide a baseline performance analysis using various domain adaptation models\nthat are currently popular in the field.","url_abs":"http://arxiv.org/abs/1710.06924v2","url_pdf":"http://arxiv.org/pdf/1710.06924v2.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":"visda-the-visual-domain-adaptation-challenge","repo_url":"https://github.com/VisionLearningGroup/taskcv-2017-public","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"visda-the-visual-domain-adaptation-challenge","repo_url":"https://github.com/szubing/uniood","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[{"slug":"visda-2017","name":"VisDA-2017","full_name":"VisDA-2017"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.06924","atlas_url":"https://app.syntology.ai/?focus=1710.06924","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":"1710.06924"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.06924\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.06924"},"call":"get_concepts_for_paper(arxiv_id=\"1710.06924\")"}],"by_repo":[{"repo":"VisionLearningGroup/taskcv-2017-public","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"szubing/uniood","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1706.07522"],"harvested_for_calls":[{"arxiv_id":"1706.07522","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.07522"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.07522\")"}]}],"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":"db43ae43be172fcadd51efc866e0c4b455eb227587c6bfe18e6db4853955f9f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}