{"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/sliced-wasserstein-discrepancy-for","title":"Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation","arxiv_id":"1903.04064","date":"2019-03-10","proceeding":"CVPR 2019 6","authors":["Chen-Yu Lee","Tanmay Batra","Mohammad Haris Baig","Daniel Ulbricht"],"abstract":"In this work, we connect two distinct concepts for unsupervised domain\nadaptation: feature distribution alignment between domains by utilizing the\ntask-specific decision boundary and the Wasserstein metric. Our proposed sliced\nWasserstein discrepancy (SWD) is designed to capture the natural notion of\ndissimilarity between the outputs of task-specific classifiers. It provides a\ngeometrically meaningful guidance to detect target samples that are far from\nthe support of the source and enables efficient distribution alignment in an\nend-to-end trainable fashion. In the experiments, we validate the effectiveness\nand genericness of our method on digit and sign recognition, image\nclassification, semantic segmentation, and object detection.","url_abs":"http://arxiv.org/abs/1903.04064v1","url_pdf":"http://arxiv.org/pdf/1903.04064v1.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":"sliced-wasserstein-discrepancy-for","repo_url":"https://github.com/apple/ml-cvpr2019-swd","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"sliced-wasserstein-discrepancy-for","repo_url":"https://github.com/kevinmusgrave/pytorch-adapt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"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":"object-detection","task_name":"Object Detection"},{"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"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-visda2017","task":"Domain Adaptation","dataset":"VisDA2017","model":"SWD","rank_in_archive_order":24,"of":28,"metrics":{"Accuracy":"76.4"},"uses_additional_data":false},{"leaderboard":"/sota/image-to-image-translation-on-synthia-to","task":"Image-to-Image Translation","dataset":"SYNTHIA-to-Cityscapes","model":"SWD","rank_in_archive_order":19,"of":28,"metrics":{"mIoU (13 classes)":"48.1"},"uses_additional_data":false},{"leaderboard":"/sota/synthetic-to-real-translation-on-gtav-to","task":"Synthetic-to-Real Translation","dataset":"GTAV-to-Cityscapes Labels","model":"SWD","rank_in_archive_order":61,"of":73,"metrics":{"mIoU":"44.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.04064","atlas_url":"https://app.syntology.ai/?focus=1903.04064","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":"1903.04064"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.04064\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.04064"},"call":"get_concepts_for_paper(arxiv_id=\"1903.04064\")"}],"by_repo":[{"repo":"apple/ml-cvpr2019-swd","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kevinmusgrave/pytorch-adapt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1607.01719","1702.05464","1705.10667","2108.10860"],"harvested_for_calls":[{"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":"1705.10667","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1705.10667"},"call":"get_harvested_code_for_paper(arxiv_id=\"1705.10667\")"},{"arxiv_id":"2108.10860","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.10860"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.10860\")"}]}],"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":"e8e449e2a993994c47cb0d1589bdbffcafe027c0723bd95afce1932d2c33ad7e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}