{"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":"/method/euclidean-norm-regularization","slug":"euclidean-norm-regularization","name":"Euclidean Norm Regularization","full_name":"Euclidean Norm Regularization","full_name_withheld":false,"description_markdown":"**Euclidean Norm Regularization** is a regularization step used in [generative adversarial networks](https://paperswithcode.com/methods/category/generative-adversarial-networks), and is typically added to both the generator and discriminator losses:\r\n\r\n$$ R\\_{z} = w\\_{r} \\cdot ||\\Delta{z}||^{2}\\_{2} $$\r\n\r\nwhere the scalar weight $w\\_{r}$ is a parameter.\r\n\r\nImage: [LOGAN](https://paperswithcode.com/method/logan)","description_state":"present","introduced_year":null,"introduced_by":{"title":"Deep Compressed Sensing","paper":"/paper/deep-compressed-sensing","first_author":"Yan Wu","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/deep-compressed-sensing"},"source":{"url":"https://arxiv.org/abs/1905.06723v2","title":"Deep Compressed Sensing","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Regularization","url":"/methods/category/regularization","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":9,"papers_newest_first":[{"paper":null,"slug":"auditing-algorithmic-fairness-in-machine","title":"Auditing Algorithmic Fairness in Machine Learning for Health with Severity-Based LOGAN","date":"2022-11-16","arxiv_id":"2211.08742","n_code_links":0,"syntology":null},{"paper":null,"slug":"edge-based-fever-screening-system-over","title":"Edge-based fever screening system over private 5G","date":"2022-02-08","arxiv_id":"2202.03917","n_code_links":0,"syntology":null},{"paper":null,"slug":"sinogram-denoise-based-on-generative","title":"Sinogram Denoise Based on Generative Adversarial Networks","date":"2021-08-09","arxiv_id":"2108.03903","n_code_links":0,"syntology":null},{"paper":null,"slug":"direct-reconstruction-of-linear-parametric","title":"Direct Reconstruction of Linear Parametric Images from Dynamic PET Using Nonlocal Deep Image Prior","date":"2021-06-18","arxiv_id":"2106.10359","n_code_links":0,"syntology":null},{"paper":"/paper/volumetric-quantitative-ablation-margins-for","slug":"volumetric-quantitative-ablation-margins-for","title":"Volumetric Quantitative Ablation Margins for Assessment of Ablation Completeness in Thermal Ablation of Liver Tumors","date":"2021-03-10","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/logan-local-group-bias-detection-by","slug":"logan-local-group-bias-detection-by","title":"LOGAN: Local Group Bias Detection by Clustering","date":"2020-10-06","arxiv_id":"2010.02867","n_code_links":1,"syntology":null},{"paper":null,"slug":"allpass-feedback-delay-networks","title":"Allpass Feedback Delay Networks","date":"2020-07-14","arxiv_id":"2007.07337","n_code_links":0,"syntology":null},{"paper":"/paper/logan-latent-optimisation-for-generative-1","slug":"logan-latent-optimisation-for-generative-1","title":"LOGAN: Latent Optimisation for Generative Adversarial Networks","date":"2019-12-02","arxiv_id":"1912.00953","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":2,"n_instrument":3,"unverified":3,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/deep-compressed-sensing","slug":"deep-compressed-sensing","title":"Deep Compressed Sensing","date":"2019-05-16","arxiv_id":"1905.06723","n_code_links":1,"syntology":null}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":4,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/euclidean-norm-regularization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/euclidean-norm-regularization/papers/ran/1","json":"/method/euclidean-norm-regularization/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/bias-detection","name":"Bias Detection","papers":2},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/conditional-image-generation","name":"Conditional Image Generation","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/edge-computing","name":"Edge-computing","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":null,"name":"Generative Adversarial Network","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/meta-learning","name":"Meta-Learning","papers":1},{"task":"/task/compressed-sensing","name":"compressed sensing","papers":1}],"tasks_shown":13,"n_tasks":13,"usage_by_year":[{"year":"2019","papers":2},{"year":"2020","papers":2},{"year":"2021","papers":3},{"year":"2022","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/euclidean-norm-regularization"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Euclidean%20Norm%20Regularization","read_at":"2026-10-05T00:55:44+00:00","query":"Euclidean Norm Regularization","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1905.06723","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Euclidean Norm Regularization' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Gradient Norm Regularization","Adaptive Norm-Based Regularization","matrix-weighted norm regularization","Abnormal Adversarial Examples Regularization (AAER)","NORM","ASR-Norm","Grad-Norm","LoRA-Norm"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3a0aa0aadc24138e8c84dae52f537058a6653c284fcb99f3322035172c76ba3b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}