{"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/one-sided-unsupervised-domain-mapping","title":"One-Sided Unsupervised Domain Mapping","arxiv_id":"1706.00826","date":"2017-06-02","proceeding":"NeurIPS 2017 12","authors":["Sagie Benaim","Lior Wolf"],"abstract":"In unsupervised domain mapping, the learner is given two unmatched datasets\n$A$ and $B$. The goal is to learn a mapping $G_{AB}$ that translates a sample\nin $A$ to the analog sample in $B$. Recent approaches have shown that when\nlearning simultaneously both $G_{AB}$ and the inverse mapping $G_{BA}$,\nconvincing mappings are obtained. In this work, we present a method of learning\n$G_{AB}$ without learning $G_{BA}$. This is done by learning a mapping that\nmaintains the distance between a pair of samples. Moreover, good mappings are\nobtained, even by maintaining the distance between different parts of the same\nsample before and after mapping. We present experimental results that the new\nmethod not only allows for one sided mapping learning, but also leads to\npreferable numerical results over the existing circularity-based constraint.\nOur entire code is made publicly available at\nhttps://github.com/sagiebenaim/DistanceGAN .","url_abs":"http://arxiv.org/abs/1706.00826v2","url_pdf":"http://arxiv.org/pdf/1706.00826v2.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":"one-sided-unsupervised-domain-mapping","repo_url":"https://github.com/sagiebenaim/DistanceGAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"style-transfer","task_name":"Style Transfer"},{"task_slug":"unsupervised-image-to-image-translation","task_name":"Unsupervised Image-To-Image Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.00826","atlas_url":"https://app.syntology.ai/?focus=1706.00826","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.00826"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.00826\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.00826"},"call":"get_concepts_for_paper(arxiv_id=\"1706.00826\")"}],"by_repo":[{"repo":"sagiebenaim/DistanceGAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"05cf41594c8d1b7dbd07e169eb10cd204f926e66d4879df8998db0017b5f0bfc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}