{"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/estimating-the-success-of-unsupervised-image","title":"Estimating the Success of Unsupervised Image to Image Translation","arxiv_id":"1712.07886","date":"2017-12-21","proceeding":"ECCV 2018 9","authors":["Sagie Benaim","Tomer Galanti","Lior Wolf"],"abstract":"While in supervised learning, the validation error is an unbiased estimator\nof the generalization (test) error and complexity-based generalization bounds\nare abundant, no such bounds exist for learning a mapping in an unsupervised\nway. As a result, when training GANs and specifically when using GANs for\nlearning to map between domains in a completely unsupervised way, one is forced\nto select the hyperparameters and the stopping epoch by subjectively examining\nmultiple options. We propose a novel bound for predicting the success of\nunsupervised cross domain mapping methods, which is motivated by the recently\nproposed Simplicity Principle. The bound can be applied both in expectation,\nfor comparing hyperparameters and for selecting a stopping criterion, or per\nsample, in order to predict the success of a specific cross-domain translation.\nThe utility of the bound is demonstrated in an extensive set of experiments\nemploying multiple recent algorithms. Our code is available at\nhttps://github.com/sagiebenaim/gan_bound .","url_abs":"http://arxiv.org/abs/1712.07886v2","url_pdf":"http://arxiv.org/pdf/1712.07886v2.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":"estimating-the-success-of-unsupervised-image","repo_url":"https://github.com/sagiebenaim/gan_bound","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"generalization-bounds","task_name":"Generalization Bounds"},{"task_slug":"image-to-image-translation","task_name":"Image-to-Image Translation"},{"task_slug":"translation","task_name":"Translation"},{"task_slug":"unsupervised-image-to-image-translation","task_name":"Unsupervised Image-To-Image Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sagiebenaim/gan_bound","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":"1547c21ffc09d4380d264a7b13902e8e3403de5bd63726800407ef74d11d7e64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}