{"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/certified-adversarial-robustness-via","title":"Certified Adversarial Robustness via Randomized Smoothing","arxiv_id":"1902.02918","date":"2019-02-08","proceeding":null,"authors":["Jeremy M Cohen","Elan Rosenfeld","J. Zico Kolter"],"abstract":"We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the $\\ell_2$ norm. This \"randomized smoothing\" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robustness guarantee in $\\ell_2$ norm for smoothing with Gaussian noise. We use randomized smoothing to obtain an ImageNet classifier with e.g. a certified top-1 accuracy of 49% under adversarial perturbations with $\\ell_2$ norm less than 0.5 (=127/255). No certified defense has been shown feasible on ImageNet except for smoothing. On smaller-scale datasets where competing approaches to certified $\\ell_2$ robustness are viable, smoothing delivers higher certified accuracies. Our strong empirical results suggest that randomized smoothing is a promising direction for future research into adversarially robust classification. Code and models are available at http://github.com/locuslab/smoothing.","url_abs":"https://arxiv.org/abs/1902.02918v2","url_pdf":"https://arxiv.org/pdf/1902.02918v2.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":"certified-adversarial-robustness-via","repo_url":"https://github.com/locuslab/smoothing","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/RaphaelOlivier/gard_eval2_public","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/akshaymehra24/poisoning_certified_defenses","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/alevine0/smoothingGenGaussian","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/aounon/distributional-robustness","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/blaisedelattre/bridging_the_gap_rs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/jayjaynandy/RBF-CNN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/llylly/dsrs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/mwojnars/nifty","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/sayakpaul/Denoised-Smoothing-TF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/xzh0u/randomized-smoothing","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"certified-adversarial-robustness-via","repo_url":"https://github.com/zijianh4/CROP-leaderboard.github.io","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"adversarial-defense","task_name":"Adversarial Defense"},{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"},{"task_slug":"robust-classification","task_name":"Robust classification"}],"methods":[{"method_slug":"randomized-smoothing","method_name":"Randomized Smoothing"}],"datasets_introduced":[],"methods_introduced":[{"slug":"randomized-smoothing","name":"Randomized Smoothing","full_name":"Randomized Smoothing"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.02918","atlas_url":"https://app.syntology.ai/?focus=1902.02918","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":"1902.02918"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.02918\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.02918"},"call":"get_concepts_for_paper(arxiv_id=\"1902.02918\")"}],"by_repo":[{"repo":"locuslab/smoothing","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"RaphaelOlivier/gard_eval2_public","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"akshaymehra24/poisoning_certified_defenses","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alevine0/smoothingGenGaussian","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aounon/distributional-robustness","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"blaisedelattre/bridging_the_gap_rs","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2206.10550"],"harvested_for_calls":[{"arxiv_id":"2206.10550","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.10550"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.10550\")"}]},{"repo":"jayjaynandy/RBF-CNN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2004.02183"],"harvested_for_calls":[{"arxiv_id":"2004.02183","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.02183"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.02183\")"}]},{"repo":"llylly/dsrs","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2206.07912"],"harvested_for_calls":[{"arxiv_id":"2206.07912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.07912"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.07912\")"}]},{"repo":"mwojnars/nifty","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sayakpaul/Denoised-Smoothing-TF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.01908"],"harvested_for_calls":[{"arxiv_id":"2003.01908","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.01908"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.01908\")"}]},{"repo":"xzh0u/randomized-smoothing","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zijianh4/CROP-leaderboard.github.io","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"c76e786ed00c72924c8f6f0dd001335daa4214588597ab9763a5ba374b7facef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}