{"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/connections-between-support-vector-machines","title":"Gradient penalty from a maximum margin perspective","arxiv_id":"1910.06922","date":"2019-10-15","proceeding":null,"authors":["Alexia Jolicoeur-Martineau","Ioannis Mitliagkas"],"abstract":"A popular heuristic for improved performance in Generative adversarial networks (GANs) is to use some form of gradient penalty on the discriminator. This gradient penalty was originally motivated by a Wasserstein distance formulation. However, the use of gradient penalty in other GAN formulations is not well motivated. We present a unifying framework of expected margin maximization and show that a wide range of gradient-penalized GANs (e.g., Wasserstein, Standard, Least-Squares, and Hinge GANs) can be derived from this framework. Our results imply that employing gradient penalties induces a large-margin classifier (thus, a large-margin discriminator in GANs). We describe how expected margin maximization helps reduce vanishing gradients at fake (generated) samples, a known problem in GANs. From this framework, we derive a new $L^\\infty$ gradient norm penalty with Hinge loss which generally produces equally good (or better) generated output in GANs than $L^2$-norm penalties (based on the Fr\\'echet Inception Distance).","url_abs":"https://arxiv.org/abs/1910.06922v2","url_pdf":"https://arxiv.org/pdf/1910.06922v2.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":"connections-between-support-vector-machines","repo_url":"https://github.com/AlexiaJM/MaximumMarginGANs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"connections-between-support-vector-machines","repo_url":"https://github.com/lucidrains/stylegan2-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"image-generation","task_name":"Image Generation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-cifar-10","task":"Image Generation","dataset":"CIFAR-10","model":"HingeGAN","rank_in_archive_order":65,"of":78,"metrics":{"FID":"27.12"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1910.06922","atlas_url":"https://app.syntology.ai/?focus=1910.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06922"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.06922"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.06922"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.06922\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1910.06922"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1910.06922\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1910.06922"},"call":"get_concepts_for_paper(arxiv_id=\"1910.06922\")"}],"by_repo":[{"repo":"AlexiaJM/MaximumMarginGANs","kind":"official","samples":10,"ran":6,"instrument":1,"unverified":4},{"repo":"lucidrains/stylegan2-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1912.04958"],"harvested_for_calls":[{"arxiv_id":"1912.04958","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1912.04958"},"call":"get_harvested_code_for_paper(arxiv_id=\"1912.04958\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1910.06922.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1910.06922.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lucidrains/stylegan2-pytorch","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/AlexiaJM/MaximumMarginGANs","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_fixture":1,"ran":4,"ran_violates":1,"unverified":4},"n_samples":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":10,"ran":6,"n_ran_checked":5,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":2,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"7e61fe013d57c481","code_sha256_prefix":"7e61fe013d57c481","entry":"calculate_frechet_distance","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/fid.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/fid.py","link_basis":"plan_row","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"mu1:ndarray/1/float, sigma1:ndarray/2/float, mu2:ndarray/1/float, sigma2:ndarray/2/float, eps:float/0/float","fixture_out_type":"float32","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"7e61fe013d57c481"},"code_page":"/code/calculate-frechet-distance","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from huangjiadidi/PUGAN, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"7e61fe013d57c481"}},{"code_sha256":"846d824d45774de9","code_sha256_prefix":"846d824d45774de9","entry":"calculate_frechet_distance","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/fid_new.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/fid_new.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"mu1:ndarray/1/float, sigma1:ndarray/2/float, mu2:ndarray/1/float, sigma2:ndarray/2/float, eps:float/0/float","fixture_out_type":"float64","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":"/code/calculate-frechet-distance","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"846d824d45774de9"}},{"code_sha256":"52a3f79b47513c42","code_sha256_prefix":"52a3f79b47513c42","entry":"make_dot","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/pytorch_visualize.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/pytorch_visualize.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"var:Tensor/0/float, params:dict/0/?","fixture_out_type":"Digraph","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":"/code/make-dot","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"52a3f79b47513c42"}},{"code_sha256":"7376fdf98a6f6485","code_sha256_prefix":"7376fdf98a6f6485","entry":"preprocessCatFace","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/preprocess_cat_dataset.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/preprocess_cat_dataset.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"coords:list/1/float, image:ndarray/3/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7376fdf98a6f6485"}},{"code_sha256":"cf539e0bbc356efb","code_sha256_prefix":"cf539e0bbc356efb","entry":"rotateCoords","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/preprocess_cat_dataset.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/preprocess_cat_dataset.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"coords:list/1/float, center:list/1/float, angleRadians:float/0/float","fixture_out_type":"list","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cf539e0bbc356efb"}},{"code_sha256":"9617b12aa6ac6bbe","code_sha256_prefix":"9617b12aa6ac6bbe","entry":"strToBool","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/GAN.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/GAN.py","link_basis":"plan_row","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"str:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AlexiaJM/RelativisticGAN, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"9617b12aa6ac6bbe"}},{"code_sha256":"6917ffcb1214d74f","code_sha256_prefix":"6917ffcb1214d74f","entry":"calculate_activation_statistics","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/fid.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/fid.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/calculate-activation-statistics","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6917ffcb1214d74f"}},{"code_sha256":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","entry":"get_activations","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/fid.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/fid.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-activations","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"code_sha256":"c3ee865ac3297b5a","code_sha256_prefix":"c3ee865ac3297b5a","entry":"register_vis_hooks","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/pytorch_visualize.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/pytorch_visualize.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c3ee865ac3297b5a"}},{"code_sha256":"17dcbb4211f84f3f","code_sha256_prefix":"17dcbb4211f84f3f","entry":"save_visualization","repo":"AlexiaJM/MaximumMarginGANs","repo_kind":"official","path":"Code/pytorch_visualize.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/pytorch_visualize.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"17dcbb4211f84f3f"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9fde9e16a9a7cb99daa056a757d9dd56a495e913aab0a58740633b43ff85d70f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}