{"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/denoised-smoothing","slug":"denoised-smoothing","name":"Denoised Smoothing","full_name":"Denoised Smoothing","full_name_withheld":false,"description_markdown":"**Denoised Smoothing** is a method for obtaining a provably robust classifier from a fixed pretrained one, without any additional training or fine-tuning of the latter. The basic idea is to prepend a custom-trained denoiser before the pretrained classifier, and then apply randomized smoothing. Randomized smoothing is a certified defense that converts any given classifier $f$ into a new smoothed classifier $g$ that is characterized by a non-linear Lipschitz property. When queried at a point $x$, the smoothed classifier $g$ outputs the class that is most likely to be returned by $f$ under isotropic Gaussian perturbations of its inputs. Unfortunately, randomized smoothing requires that the underlying classifier $f$ is robust to relatively large random Gaussian perturbations of the input, which is not the case for off-the-shelf pretrained models. By applying our custom-trained denoiser to the classifier $f$, we can effectively make $f$ robust to such Gaussian perturbations, thereby making it “suitable” for randomized smoothing.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Denoised Smoothing: A Provable Defense for Pretrained Classifiers","paper":"/paper/black-box-smoothing-a-provable-defense-for","first_author":"Hadi Salman","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/black-box-smoothing-a-provable-defense-for"},"source":{"url":"https://arxiv.org/abs/2003.01908v2","title":"Denoised Smoothing: A Provable Defense for Pretrained Classifiers","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":"Robustness Methods","url":"/methods/category/robustness-methods","pwc_aliases":[]}],"n_papers_tagged":8,"archive_num_papers":8,"papers_newest_first":[{"paper":null,"slug":"beyond-classification-evaluating-diffusion","title":"Beyond Classification: Evaluating Diffusion Denoised Smoothing for Security-Utility Trade off","date":"2025-05-21","arxiv_id":"2505.15594","n_code_links":0,"syntology":null},{"paper":"/paper/confidence-aware-denoised-fine-tuning-of-off","slug":"confidence-aware-denoised-fine-tuning-of-off","title":"Confidence-aware Denoised Fine-tuning of Off-the-shelf Models for Certified Robustness","date":"2024-11-13","arxiv_id":"2411.08933","n_code_links":1,"syntology":null},{"paper":"/paper/advancing-the-robustness-of-large-language","slug":"advancing-the-robustness-of-large-language","title":"Advancing the Robustness of Large Language Models through Self-Denoised Smoothing","date":"2024-04-18","arxiv_id":"2404.12274","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ucsb-nlp-chang/selfdenoise"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"certified-zeroth-order-black-box-defense-with","title":"Certified Zeroth-order Black-Box Defense with Robust UNet Denoiser","date":"2023-04-13","arxiv_id":"2304.06430","n_code_links":0,"syntology":null},{"paper":"/paper/certified-adversarial-robustness-for-free","slug":"certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","arxiv_id":"2206.10550","n_code_links":3,"syntology":{"ran":28,"of":34,"n_ran_checked":15,"n_instrument":13,"unverified":6,"pointer_only":13,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 13 where Syntology's instrument failed) · 6 unverified","official":{"repos":["ethz-privsec/diffusion_denoised_smoothing"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/how-to-robustify-black-box-ml-models-a-zeroth-1","slug":"how-to-robustify-black-box-ml-models-a-zeroth-1","title":"How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective","date":"2022-03-27","arxiv_id":"2203.14195","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["damon-demon/black-box-defense"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/poisoned-classifiers-are-not-only-backdoored-1","slug":"poisoned-classifiers-are-not-only-backdoored-1","title":"Poisoned classifiers are not only backdoored, they are fundamentally broken","date":"2020-10-18","arxiv_id":"2010.09080","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["locuslab/breaking-poisoned-classifier"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/black-box-smoothing-a-provable-defense-for","slug":"black-box-smoothing-a-provable-defense-for","title":"Denoised Smoothing: A Provable Defense for Pretrained Classifiers","date":"2020-03-04","arxiv_id":"2003.01908","n_code_links":4,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["microsoft/blackbox-smoothing","microsoft/denoised-smoothing"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}],"papers_shown":8,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":8,"with_a_code_link":6,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"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":4,"papers_where_code_ran_first_page":"/method/denoised-smoothing/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/denoised-smoothing/papers/ran/1","json":"/method/denoised-smoothing/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":4},{"task":"/task/denoising","name":"Denoising","papers":3},{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":2},{"task":"/task/image-classification","name":"image-classification","papers":2},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/hallucination","name":"Hallucination","papers":1},{"task":"/task/robust-classification","name":"Robust classification","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2020","papers":2},{"year":"2022","papers":2},{"year":"2023","papers":1},{"year":"2024","papers":2},{"year":"2025","papers":1}],"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/denoised-smoothing"},"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=Denoised%20Smoothing","read_at":"2026-10-05T00:54:44+00:00","query":"Denoised Smoothing","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2003.01908"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2003.01908","repositories":{"listed":4,"in_graph":4,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='2003.01908')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2003.01908","citations":24},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Denoised Smoothing'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2003.01908","page":"/paper/black-box-smoothing-a-provable-defense-for","syntology_url":"https://syntology.ai/paper/2003.01908","in_graph_layer":true,"samples":4,"ran":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 4 listed of 4 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2003.01908, not a method entry. This answer is about arXiv:2003.01908, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"573c843eb04bd05f4dcb2acb087d1e51a2cffc0fa8012993510796c463a32197","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}