{"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/mode-seeking-generative-adversarial-networks","title":"Mode Seeking Generative Adversarial Networks for Diverse Image Synthesis","arxiv_id":"1903.05628","date":"2019-03-13","proceeding":"CVPR 2019 6","authors":["Qi Mao","Hsin-Ying Lee","Hung-Yu Tseng","Siwei Ma","Ming-Hsuan Yang"],"abstract":"Most conditional generation tasks expect diverse outputs given a single conditional context. However, conditional generative adversarial networks (cGANs) often focus on the prior conditional information and ignore the input noise vectors, which contribute to the output variations. Recent attempts to resolve the mode collapse issue for cGANs are usually task-specific and computationally expensive. In this work, we propose a simple yet effective regularization term to address the mode collapse issue for cGANs. The proposed method explicitly maximizes the ratio of the distance between generated images with respect to the corresponding latent codes, thus encouraging the generators to explore more minor modes during training. This mode seeking regularization term is readily applicable to various conditional generation tasks without imposing training overhead or modifying the original network structures. We validate the proposed algorithm on three conditional image synthesis tasks including categorical generation, image-to-image translation, and text-to-image synthesis with different baseline models. Both qualitative and quantitative results demonstrate the effectiveness of the proposed regularization method for improving diversity without loss of quality.","url_abs":"https://arxiv.org/abs/1903.05628v6","url_pdf":"https://arxiv.org/pdf/1903.05628v6.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":"mode-seeking-generative-adversarial-networks","repo_url":"https://github.com/HelenMao/MSGAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"mode-seeking-generative-adversarial-networks","repo_url":"https://github.com/JPlin/MSGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"image-to-image-translation","task_name":"Image-to-Image Translation"},{"task_slug":"multimodal-unsupervised-image-to-image","task_name":"Multimodal Unsupervised Image-To-Image Translation"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-cifar-10","task":"Image Generation","dataset":"CIFAR-10","model":"MSGAN","rank_in_archive_order":67,"of":78,"metrics":{"FID":"28.73"},"uses_additional_data":false},{"leaderboard":"/sota/multimodal-unsupervised-image-to-image-5","task":"Multimodal Unsupervised Image-To-Image Translation","dataset":"AFHQ","model":"MSGAN","rank_in_archive_order":3,"of":4,"metrics":{"FID":"61.4"},"uses_additional_data":false},{"leaderboard":"/sota/multimodal-unsupervised-image-to-image-4","task":"Multimodal Unsupervised Image-To-Image Translation","dataset":"CelebA-HQ","model":"MSGAN","rank_in_archive_order":3,"of":4,"metrics":{"FID":"33.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.05628","atlas_url":"https://app.syntology.ai/?focus=1903.05628","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.05628"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.05628\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.05628"},"call":"get_concepts_for_paper(arxiv_id=\"1903.05628\")"}],"by_repo":[{"repo":"HelenMao/MSGAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JPlin/MSGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1511.06434"],"harvested_for_calls":[{"arxiv_id":"1511.06434","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.06434"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.06434\")"}]}],"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":"6ec098806473f82096122340f62cef196613cc382c3cbb580a69ae58cd50cd7b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}