{"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/loss-sensitive-generative-adversarial","title":"Loss-Sensitive Generative Adversarial Networks on Lipschitz Densities","arxiv_id":"1701.06264","date":"2017-01-23","proceeding":null,"authors":["Guo-Jun Qi"],"abstract":"In this paper, we present the Lipschitz regularization theory and algorithms\nfor a novel Loss-Sensitive Generative Adversarial Network (LS-GAN).\nSpecifically, it trains a loss function to distinguish between real and fake\nsamples by designated margins, while learning a generator alternately to\nproduce realistic samples by minimizing their losses. The LS-GAN further\nregularizes its loss function with a Lipschitz regularity condition on the\ndensity of real data, yielding a regularized model that can better generalize\nto produce new data from a reasonable number of training examples than the\nclassic GAN. We will further present a Generalized LS-GAN (GLS-GAN) and show it\ncontains a large family of regularized GAN models, including both LS-GAN and\nWasserstein GAN, as its special cases. Compared with the other GAN models, we\nwill conduct experiments to show both LS-GAN and GLS-GAN exhibit competitive\nability in generating new images in terms of the Minimum Reconstruction Error\n(MRE) assessed on a separate test set. We further extend the LS-GAN to a\nconditional form for supervised and semi-supervised learning problems, and\ndemonstrate its outstanding performance on image classification tasks.","url_abs":"http://arxiv.org/abs/1701.06264v6","url_pdf":"http://arxiv.org/pdf/1701.06264v6.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":"loss-sensitive-generative-adversarial","repo_url":"https://github.com/guojunq/lsgan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok"}}],"tasks":[{"task_slug":null,"task_name":"Generative Adversarial Network"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-cifar-10","task":"Image Classification","dataset":"CIFAR-10","model":"CLS-GAN","rank_in_archive_order":190,"of":265,"metrics":{"Percentage correct":"91.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-svhn","task":"Image Classification","dataset":"SVHN","model":"CLS-GAN","rank_in_archive_order":43,"of":62,"metrics":{"Percentage error":"5.98"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.06264","atlas_url":"https://app.syntology.ai/?focus=1701.06264","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":"1701.06264"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1701.06264\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1701.06264"},"call":"get_concepts_for_paper(arxiv_id=\"1701.06264\")"}],"by_repo":[{"repo":"guojunq/lsgan","kind":"listed","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":"a5d48730b7972763eea8f0db71e3cdeebcd317e54a3fa4d551bcd4cf0ad7a234","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}