{"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/randomized-smoothing","slug":"randomized-smoothing","name":"Randomized Smoothing","full_name":"Randomized Smoothing","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Certified Adversarial Robustness via Randomized Smoothing","paper":"/paper/certified-adversarial-robustness-via","first_author":"Jeremy M Cohen","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/certified-adversarial-robustness-via"},"source":{"url":"https://arxiv.org/abs/1902.02918v2","title":"Certified Adversarial Robustness via Randomized Smoothing","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":147,"archive_num_papers":147,"papers_newest_first":[{"paper":null,"slug":"one-sample-is-enough-to-make-conformal","title":"One Sample is Enough to Make Conformal Prediction Robust","date":"2025-06-19","arxiv_id":"2506.16553","n_code_links":0,"syntology":null},{"paper":"/paper/cert-ssb-toward-certified-sample-specific","slug":"cert-ssb-toward-certified-sample-specific","title":"Cert-SSB: Toward Certified Sample-Specific Backdoor Defense","date":"2025-04-30","arxiv_id":"2504.21730","n_code_links":1,"syntology":null},{"paper":null,"slug":"auditvotes-a-framework-towards-more","title":"AuditVotes: A Framework Towards More Deployable Certified Robustness for Graph Neural Networks","date":"2025-03-29","arxiv_id":"2503.22998","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-backdoor-attacks-with-reasonable","title":"Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks","date":"2025-03-12","arxiv_id":"2503.09049","n_code_links":0,"syntology":null},{"paper":null,"slug":"cetad-towards-certified-toxicity-aware","title":"CeTAD: Towards Certified Toxicity-Aware Distance in Vision Language Models","date":"2025-03-08","arxiv_id":"2503.10661","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-the-worst-case-robustness-of-large","title":"Towards the Worst-case Robustness of Large Language Models","date":"2025-01-31","arxiv_id":"2501.19040","n_code_links":0,"syntology":null},{"paper":"/paper/robust-representation-consistency-model-via","slug":"robust-representation-consistency-model-via","title":"Robust Representation Consistency Model via Contrastive Denoising","date":"2025-01-22","arxiv_id":"2501.13094","n_code_links":1,"syntology":null},{"paper":"/paper/certified-robustness-for-deep-equilibrium-1","slug":"certified-robustness-for-deep-equilibrium-1","title":"Certified Robustness for Deep Equilibrium Models via Serialized Random Smoothing","date":"2024-11-01","arxiv_id":"2411.00899","n_code_links":1,"syntology":{"ran":12,"of":14,"n_ran_checked":4,"n_instrument":8,"unverified":2,"pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","official":{"repos":["weizhigao/serialized-randomized-smoothing"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"integrating-uncertainty-quantification-into","title":"Integrating uncertainty quantification into randomized smoothing based robustness guarantees","date":"2024-10-27","arxiv_id":"2410.20432","n_code_links":0,"syntology":null},{"paper":null,"slug":"filtered-randomized-smoothing-a-new-defense","title":"Filtered Randomized Smoothing: A New Defense for Robust Modulation Classification","date":"2024-10-08","arxiv_id":"2410.06339","n_code_links":0,"syntology":null},{"paper":null,"slug":"boosting-certificate-robustness-for-time","title":"Boosting Certified Robustness for Time Series Classification with Efficient Self-Ensemble","date":"2024-09-04","arxiv_id":"2409.02802","n_code_links":0,"syntology":null},{"paper":"/paper/promptsmooth-certifying-robustness-of-medical","slug":"promptsmooth-certifying-robustness-of-medical","title":"PromptSmooth: Certifying Robustness of Medical Vision-Language Models via Prompt Learning","date":"2024-08-29","arxiv_id":"2408.16769","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["nhussein/promptsmooth"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"deep-learning-at-the-intersection-certified","title":"Deep Learning at the Intersection: Certified Robustness as a Tool for 3D Vision","date":"2024-08-23","arxiv_id":"2408.13135","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-universal-adversarial","title":"Privacy-preserving Universal Adversarial Defense for Black-box Models","date":"2024-08-20","arxiv_id":"2408.10647","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-01200","title":"Certifiably Robust Encoding Schemes","date":"2024-08-02","arxiv_id":"2408.01200","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-00728","title":"CERT-ED: Certifiably Robust Text Classification for Edit Distance","date":"2024-08-01","arxiv_id":"2408.00728","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-00895","title":"Discrete Randomized Smoothing Meets Quantum Computing","date":"2024-08-01","arxiv_id":"2408.00895","n_code_links":0,"syntology":null},{"paper":"/paper/rsc-snn-exploring-the-trade-off-between","slug":"rsc-snn-exploring-the-trade-off-between","title":"RSC-SNN: Exploring the Trade-off Between Adversarial Robustness and Accuracy in Spiking Neural Networks via Randomized Smoothing Coding","date":"2024-07-29","arxiv_id":"2407.20099","n_code_links":1,"syntology":null},{"paper":null,"slug":"quadratic-advantage-with-quantum-randomized","title":"Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis","date":"2024-07-25","arxiv_id":"2407.18021","n_code_links":0,"syntology":null},{"paper":null,"slug":"variational-randomized-smoothing-for-sample","title":"Variational Randomized Smoothing for Sample-Wise Adversarial Robustness","date":"2024-07-16","arxiv_id":"2407.11844","n_code_links":0,"syntology":null},{"paper":"/paper/certifiably-robust-image-watermark","slug":"certifiably-robust-image-watermark","title":"Certifiably Robust Image Watermark","date":"2024-07-04","arxiv_id":"2407.04086","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":4,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"6 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zhengyuan-jiang/Watermark-Library"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/breaking-the-barrier-enhanced-utility-and","slug":"breaking-the-barrier-enhanced-utility-and","title":"Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents","date":"2024-06-26","arxiv_id":"2406.18062","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":6,"n_instrument":3,"unverified":3,"pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 5 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["trustworthy-ml-lab/robust_highutil_smoothed_drl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/treatment-of-statistical-estimation-problems","slug":"treatment-of-statistical-estimation-problems","title":"Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness","date":"2024-06-25","arxiv_id":"2406.17830","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":6,"n_instrument":0,"unverified":0,"pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 4 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vvoracek/rs_conf_seq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/adaptive-randomized-smoothing-certifying","slug":"adaptive-randomized-smoothing-certifying","title":"Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences","date":"2024-06-14","arxiv_id":"2406.10427","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ubc-systopia/adaptive-randomized-smoothing"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/distributional-adversarial-loss","slug":"distributional-adversarial-loss","title":"Distributional Adversarial Loss","date":"2024-06-05","arxiv_id":"2406.03458","n_code_links":1,"syntology":null},{"paper":"/paper/effects-of-exponential-gaussian-distribution","slug":"effects-of-exponential-gaussian-distribution","title":"Effects of Exponential Gaussian Distribution on (Double Sampling) Randomized Smoothing","date":"2024-06-04","arxiv_id":"2406.02309","n_code_links":1,"syntology":{"ran":19,"of":20,"n_ran_checked":17,"n_instrument":2,"unverified":1,"pointer_only":20,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 8 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tdano1/eg-on-smoothing"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"online-optimization-perspective-on-first","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","date":"2024-06-03","arxiv_id":"2406.01484","n_code_links":0,"syntology":null},{"paper":null,"slug":"certifying-adapters-enabling-and-enhancing","title":"Certifying Adapters: Enabling and Enhancing the Certification of Classifier Adversarial Robustness","date":"2024-05-25","arxiv_id":"2405.16036","n_code_links":0,"syntology":null},{"paper":null,"slug":"universal-robustness-via-median-randomized","title":"Universal Robustness via Median Randomized Smoothing for Real-World Super-Resolution","date":"2024-05-23","arxiv_id":"2405.14934","n_code_links":0,"syntology":null},{"paper":null,"slug":"confidence-estimation-in-unsupervised-deep","title":"Confidence Estimation in Unsupervised Deep Change Vector Analysis","date":"2024-05-16","arxiv_id":"2405.09896","n_code_links":0,"syntology":null},{"paper":"/paper/rs-reg-probabilistic-and-robust-certified","slug":"rs-reg-probabilistic-and-robust-certified","title":"RS-Reg: Probabilistic and Robust Certified Regression Through Randomized Smoothing","date":"2024-05-14","arxiv_id":"2405.08892","n_code_links":1,"syntology":null},{"paper":"/paper/certification-of-speaker-recognition-models","slug":"certification-of-speaker-recognition-models","title":"Certification of Speaker Recognition Models to Additive Perturbations","date":"2024-04-29","arxiv_id":"2404.18791","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["airi-institute/asi-certification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":"/paper/mitigating-the-curse-of-dimensionality-for","slug":"mitigating-the-curse-of-dimensionality-for","title":"Mitigating the Curse of Dimensionality for Certified Robustness via Dual Randomized Smoothing","date":"2024-04-15","arxiv_id":"2404.09586","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":2,"n_instrument":5,"unverified":3,"pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","official":{"repos":["xiasong0501/drs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"commit-certifying-robustness-of-multi-sensor","title":"COMMIT: Certifying Robustness of Multi-Sensor Fusion Systems against Semantic Attacks","date":"2024-03-04","arxiv_id":"2403.02329","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerated-smoothing-a-scalable-approach-to","title":"Accelerated Smoothing: A Scalable Approach to Randomized Smoothing","date":"2024-02-12","arxiv_id":"2402.07498","n_code_links":0,"syntology":null},{"paper":"/paper/your-diffusion-model-is-secretly-a","slug":"your-diffusion-model-is-secretly-a","title":"Diffusion Models are Certifiably Robust Classifiers","date":"2024-02-04","arxiv_id":"2402.02316","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["huanranchen/NoisedDiffusionClassifiers"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"trust-but-verify-a-survey-of-randomized","title":"Rethinking Randomized Smoothing from the Perspective of Scalability","date":"2023-12-19","arxiv_id":"2312.12608","n_code_links":0,"syntology":null},{"paper":"/paper/robust-mri-reconstruction-by-smoothed","slug":"robust-mri-reconstruction-by-smoothed","title":"Robust MRI Reconstruction by Smoothed Unrolling (SMUG)","date":"2023-12-12","arxiv_id":"2312.07784","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sjames40/smug_journal"],"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":["official"]}}},{"paper":null,"slug":"improving-faithfulness-for-vision","title":"Improving Interpretation Faithfulness for Vision Transformers","date":"2023-11-29","arxiv_id":"2311.17983","n_code_links":0,"syntology":null},{"paper":null,"slug":"bias-variance-trade-off-in-physics-informed","title":"Bias-Variance Trade-off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs","date":"2023-11-26","arxiv_id":"2311.15283","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-certification-of-vision-language-models","title":"Fast Certification of Vision-Language Models Using Incremental Randomized Smoothing","date":"2023-11-15","arxiv_id":"2311.09024","n_code_links":0,"syntology":null},{"paper":"/paper/multi-scale-diffusion-denoised-smoothing-1","slug":"multi-scale-diffusion-denoised-smoothing-1","title":"Multi-scale Diffusion Denoised Smoothing","date":"2023-10-25","arxiv_id":"2310.16779","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":["jh-jeong/smoothing-multiscale"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"hierarchical-randomized-smoothing","title":"Hierarchical Randomized Smoothing","date":"2023-10-24","arxiv_id":"2310.16221","n_code_links":0,"syntology":null},{"paper":"/paper/provably-robust-cost-sensitive-learning-via","slug":"provably-robust-cost-sensitive-learning-via","title":"Provably Cost-Sensitive Adversarial Defense via Randomized Smoothing","date":"2023-10-12","arxiv_id":"2310.08732","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["trustmlrg/cs-rs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"promoting-robustness-of-randomized-smoothing","title":"Promoting Robustness of Randomized Smoothing: Two Cost-Effective Approaches","date":"2023-10-11","arxiv_id":"2310.07780","n_code_links":0,"syntology":null},{"paper":"/paper/certification-of-deep-learning-models-for","slug":"certification-of-deep-learning-models-for","title":"Certification of Deep Learning Models for Medical Image Segmentation","date":"2023-10-05","arxiv_id":"2310.03664","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-lipschitz-variance-margin-tradeoff-for","title":"The Lipschitz-Variance-Margin Tradeoff for Enhanced Randomized Smoothing","date":"2023-09-28","arxiv_id":"2309.16883","n_code_links":0,"syntology":null},{"paper":"/paper/projected-randomized-smoothing-for-certified","slug":"projected-randomized-smoothing-for-certified","title":"Projected Randomized Smoothing for Certified Adversarial Robustness","date":"2023-09-25","arxiv_id":"2309.13794","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"0 ran · 2 unverified","official":{"repos":["spfrommer/projected_randomized_smoothing"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/efficient-estimation-of-the-local-robustness","slug":"efficient-estimation-of-the-local-robustness","title":"Characterizing Data Point Vulnerability via Average-Case Robustness","date":"2023-07-26","arxiv_id":"2307.13885","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":13,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ai4life-group/average-case-robustness"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/certified-robustness-for-large-language","slug":"certified-robustness-for-large-language","title":"Certified Robustness for Large Language Models with Self-Denoising","date":"2023-07-14","arxiv_id":"2307.07171","n_code_links":1,"syntology":null},{"paper":"/paper/re-double-sampling-randomized-smoothing","slug":"re-double-sampling-randomized-smoothing","title":"[Re] Double Sampling Randomized Smoothing","date":"2023-06-27","arxiv_id":"2306.15221","n_code_links":1,"syntology":null},{"paper":"/paper/towards-better-certified-segmentation-via","slug":"towards-better-certified-segmentation-via","title":"Towards Better Certified Segmentation via Diffusion Models","date":"2023-06-16","arxiv_id":"2306.09949","n_code_links":1,"syntology":null},{"paper":"/paper/augment-then-smooth-reconciling-differential","slug":"augment-then-smooth-reconciling-differential","title":"Augment then Smooth: Reconciling Differential Privacy with Certified Robustness","date":"2023-06-14","arxiv_id":"2306.08656","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["layer6ai-labs/dp-cert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/incremental-randomized-smoothing","slug":"incremental-randomized-smoothing","title":"Incremental Randomized Smoothing Certification","date":"2023-05-31","arxiv_id":"2305.19521","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["uiuc-arc/incremental-dnn-verification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/randomized-smoothing-with-masked-inference","slug":"randomized-smoothing-with-masked-inference","title":"Randomized Smoothing with Masked Inference for Adversarially Robust Text Classifications","date":"2023-05-11","arxiv_id":"2305.06522","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["han8931/rsmi_nlp"],"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/certifiable-black-box-attack-ensuring","slug":"certifiable-black-box-attack-ensuring","title":"Certifiable Black-Box Attacks with Randomized Adversarial Examples: Breaking Defenses with Provable Confidence","date":"2023-04-10","arxiv_id":"2304.04343","n_code_links":1,"syntology":null},{"paper":"/paper/smug-towards-robust-mri-reconstruction-by","slug":"smug-towards-robust-mri-reconstruction-by","title":"SMUG: Towards robust MRI reconstruction by smoothed unrolling","date":"2023-03-14","arxiv_id":"2303.12735","n_code_links":2,"syntology":null},{"paper":"/paper/feature-partition-aggregation-a-fast","slug":"feature-partition-aggregation-a-fast","title":"Provable Robustness Against a Union of $\\ell_0$ Adversarial Attacks","date":"2023-02-22","arxiv_id":"2302.11628","n_code_links":2,"syntology":null},{"paper":null,"slug":"measuring-equality-in-machine-learning","title":"Measuring Equality in Machine Learning Security Defenses: A Case Study in Speech Recognition","date":"2023-02-17","arxiv_id":"2302.08973","n_code_links":0,"syntology":null},{"paper":"/paper/qcrs-improve-randomized-smoothing-using-quasi","slug":"qcrs-improve-randomized-smoothing-using-quasi","title":"Towards Large Certified Radius in Randomized Smoothing using Quasiconcave Optimization","date":"2023-02-01","arxiv_id":"2302.00209","n_code_links":1,"syntology":null},{"paper":"/paper/rs-del-edit-distance-robustness-certificates-1","slug":"rs-del-edit-distance-robustness-certificates-1","title":"RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion","date":"2023-01-31","arxiv_id":"2302.01757","n_code_links":2,"syntology":{"ran":11,"of":14,"n_ran_checked":9,"n_instrument":2,"unverified":3,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["dovermore/randomized-deletion"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/randomized-message-interception-smoothing","slug":"randomized-message-interception-smoothing","title":"Randomized Message-Interception Smoothing: Gray-box Certificates for Graph Neural Networks","date":"2023-01-05","arxiv_id":"2301.02039","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"pre-trained-encoders-in-self-supervised","title":"Pre-trained Encoders in Self-Supervised Learning Improve Secure and Privacy-preserving Supervised Learning","date":"2022-12-06","arxiv_id":"2212.03334","n_code_links":0,"syntology":null},{"paper":null,"slug":"invariance-aware-randomized-smoothing","title":"Invariance-Aware Randomized Smoothing Certificates","date":"2022-11-25","arxiv_id":"2211.14207","n_code_links":0,"syntology":null},{"paper":null,"slug":"localized-randomized-smoothing-for-collective-1","title":"Localized Randomized Smoothing for Collective Robustness Certification","date":"2022-10-28","arxiv_id":"2210.16140","n_code_links":0,"syntology":null},{"paper":null,"slug":"de-crop-data-efficient-certified-robustness","title":"DE-CROP: Data-efficient Certified Robustness for Pretrained Classifiers","date":"2022-10-17","arxiv_id":"2210.08929","n_code_links":0,"syntology":null},{"paper":null,"slug":"pointdp-diffusion-driven-purification-against","title":"PointDP: Diffusion-driven Purification against Adversarial Attacks on 3D Point Cloud Recognition","date":"2022-08-21","arxiv_id":"2208.09801","n_code_links":0,"syntology":null},{"paper":"/paper/towards-robust-multivariate-time-series","slug":"towards-robust-multivariate-time-series","title":"Robust Multivariate Time-Series Forecasting: Adversarial Attacks and Defense Mechanisms","date":"2022-07-19","arxiv_id":"2207.09572","n_code_links":1,"syntology":{"ran":9,"of":11,"n_ran_checked":9,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["awslabs/gluonts"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/certified-neural-network-watermarks-with","slug":"certified-neural-network-watermarks-with","title":"Certified Neural Network Watermarks with Randomized Smoothing","date":"2022-07-16","arxiv_id":"2207.07972","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":0,"n_instrument":1,"unverified":3,"pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["arpitbansal297/certified_watermarks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/sound-randomized-smoothing-in-floating-point","slug":"sound-randomized-smoothing-in-floating-point","title":"Sound Randomized Smoothing in Floating-Point Arithmetics","date":"2022-07-14","arxiv_id":"2207.07209","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["vvoracek/sound-randomized-smoothing"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"certified-adversarial-robustness-via-1","title":"Certified Adversarial Robustness via Anisotropic Randomized Smoothing","date":"2022-07-12","arxiv_id":"2207.05327","n_code_links":0,"syntology":null},{"paper":null,"slug":"guided-diffusion-model-for-adversarial-1","title":"Guided Diffusion Model for Adversarial Purification from Random Noise","date":"2022-06-22","arxiv_id":"2206.10875","n_code_links":0,"syntology":null},{"paper":"/paper/riemannian-data-dependent-randomized","slug":"riemannian-data-dependent-randomized","title":"Riemannian data-dependent randomized smoothing for neural networks certification","date":"2022-06-21","arxiv_id":"2206.10235","n_code_links":1,"syntology":null},{"paper":"/paper/double-sampling-randomized-smoothing","slug":"double-sampling-randomized-smoothing","title":"Double Sampling Randomized Smoothing","date":"2022-06-16","arxiv_id":"2206.07912","n_code_links":2,"syntology":{"ran":15,"of":17,"n_ran_checked":15,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 14 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["llylly/dsrs"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"gsmooth-certified-robustness-against-semantic-1","title":"GSmooth: Certified Robustness against Semantic Transformations via Generalized Randomized Smoothing","date":"2022-06-09","arxiv_id":"2206.04310","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-evading-the-limits-of-randomized","title":"Towards Evading the Limits of Randomized Smoothing: A Theoretical Analysis","date":"2022-06-03","arxiv_id":"2206.01715","n_code_links":0,"syntology":null},{"paper":"/paper/de-randomized-smoothing-for-decision-stump","slug":"de-randomized-smoothing-for-decision-stump","title":"(De-)Randomized Smoothing for Decision Stump Ensembles","date":"2022-05-27","arxiv_id":"2205.13909","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["eth-sri/drs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"smooth-reduce-leveraging-patches-for-improved","title":"Smooth-Reduce: Leveraging Patches for Improved Certified Robustness","date":"2022-05-12","arxiv_id":"2205.06154","n_code_links":0,"syntology":null},{"paper":null,"slug":"randomized-smoothing-under-attack-how-good-is","title":"Randomized Smoothing under Attack: How Good is it in Pratice?","date":"2022-04-28","arxiv_id":"2204.14187","n_code_links":0,"syntology":null},{"paper":"/paper/3deformrs-certifying-spatial-deformations-on","slug":"3deformrs-certifying-spatial-deformations-on","title":"3DeformRS: Certifying Spatial Deformations on Point Clouds","date":"2022-04-12","arxiv_id":"2204.05687","n_code_links":1,"syntology":null},{"paper":null,"slug":"mel-frequency-spectral-domain-defenses","title":"Mel Frequency Spectral Domain Defenses against Adversarial Attacks on Speech Recognition Systems","date":"2022-03-29","arxiv_id":"2203.15283","n_code_links":0,"syntology":null},{"paper":"/paper/robust-probabilistic-time-series-forecasting","slug":"robust-probabilistic-time-series-forecasting","title":"Robust Probabilistic Time Series Forecasting","date":"2022-02-24","arxiv_id":"2202.11910","n_code_links":1,"syntology":null},{"paper":"/paper/smoothed-embeddings-for-certified-few-shot","slug":"smoothed-embeddings-for-certified-few-shot","title":"Smoothed Embeddings for Certified Few-Shot Learning","date":"2022-02-02","arxiv_id":"2202.01186","n_code_links":1,"syntology":null},{"paper":null,"slug":"end-to-end-autoencoder-communications-with","title":"End-to-End Autoencoder Communications with Optimized Interference Suppression","date":"2021-12-29","arxiv_id":"2201.01388","n_code_links":0,"syntology":null},{"paper":"/paper/latent-space-smoothing-for-individually-fair-1","slug":"latent-space-smoothing-for-individually-fair-1","title":"Latent Space Smoothing for Individually Fair Representations","date":"2021-11-26","arxiv_id":"2111.13650","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["eth-sri/lassi"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"provable-defense-against-clustering-attacks","title":"Provable Defense Against Clustering Attacks on 3D Point Clouds","date":"2021-11-22","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/sequential-randomized-smoothing-for-1","slug":"sequential-randomized-smoothing-for-1","title":"Sequential Randomized Smoothing for Adversarially Robust Speech Recognition","date":"2021-11-05","arxiv_id":"2112.03000","n_code_links":1,"syntology":null},{"paper":null,"slug":"certified-adversarial-robustness-under-the","title":"Certified Adversarial Robustness Under the Bounded Support Set","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"integer-arithmetic-only-certified-robustness","title":"Integer-arithmetic-only Certified Robustness for Quantized Neural Networks","date":"2021-08-21","arxiv_id":"2108.09413","n_code_links":0,"syntology":null},{"paper":null,"slug":"certified-defense-via-latent-space-randomized","title":"Certified Defense via Latent Space Randomized Smoothing with Orthogonal Encoders","date":"2021-08-01","arxiv_id":"2108.00491","n_code_links":0,"syntology":null},{"paper":null,"slug":"leave-one-out-unfairness","title":"Leave-one-out Unfairness","date":"2021-07-21","arxiv_id":"2107.10171","n_code_links":0,"syntology":null},{"paper":"/paper/ancer-anisotropic-certification-via-sample","slug":"ancer-anisotropic-certification-via-sample","title":"ANCER: Anisotropic Certification via Sample-wise Volume Maximization","date":"2021-07-09","arxiv_id":"2107.04570","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["MotasemAlfarra/ANCER"],"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":["official"]}}},{"paper":"/paper/deformrs-certifying-input-deformations-with","slug":"deformrs-certifying-input-deformations-with","title":"DeformRS: Certifying Input Deformations with Randomized Smoothing","date":"2021-07-02","arxiv_id":"2107.00996","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["MotasemAlfarra/DeformRS"],"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":["official"]}}},{"paper":null,"slug":"certified-robustness-via-randomized-smoothing","title":"Certified Robustness via Randomized Smoothing over Multiplicative Parameters of Input Transformations","date":"2021-06-28","arxiv_id":"2106.14432","n_code_links":0,"syntology":null},{"paper":null,"slug":"empirical-robustification-of-pre-trained","title":"Empirical robustification of pre-trained classifiers","date":"2021-06-18","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/certified-robustness-to-text-adversarial","slug":"certified-robustness-to-text-adversarial","title":"Certified Robustness to Text Adversarial Attacks by Randomized [MASK]","date":"2021-05-08","arxiv_id":"2105.03743","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zjiehang/RanMASK"],"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":["official"]}}},{"paper":null,"slug":"adversarial-attacks-and-defenses-for-speech","title":"Adversarial Attacks and Defenses for Speech Recognition Systems","date":"2021-03-31","arxiv_id":"2103.17122","n_code_links":0,"syntology":null},{"paper":null,"slug":"certifiably-robust-federated-adversarial","title":"Certifiably-Robust Federated Adversarial Learning via Randomized Smoothing","date":"2021-03-30","arxiv_id":"2103.16031","n_code_links":0,"syntology":null},{"paper":null,"slug":"improved-autoregressive-modeling-with-1","title":"Improved Autoregressive Modeling with Distribution Smoothing","date":"2021-03-28","arxiv_id":"2103.15089","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":147,"with_a_code_link":67,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":147,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":26,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":26,"listed_every_run_a_failure_of_syntologys_instrument":7,"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":33,"papers_where_code_ran_first_page":"/method/randomized-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":"archive","page":2,"of":2,"url":"/method/randomized-smoothing/papers/2","json":"/method/randomized-smoothing/papers/2.json","rows":47},{"order":"ran","page":1,"of":1,"url":"/method/randomized-smoothing/papers/ran/1","json":"/method/randomized-smoothing/papers/ran/1.json","rows":33}],"tasks":[{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":24},{"task":"/task/adversarial-defense","name":"Adversarial Defense","papers":9},{"task":"/task/denoising","name":"Denoising","papers":7},{"task":"/task/image-classification","name":"Image Classification","papers":7},{"task":"/task/image-classification","name":"image-classification","papers":7},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":6},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":6},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":6},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":4},{"task":"/task/fairness","name":"Fairness","papers":4},{"task":"/task/classification","name":"General Classification","papers":4},{"task":"/task/time-series-1","name":"Time Series","papers":4},{"task":"/task/automatic-speech-recognition-2","name":"Automatic Speech Recognition","papers":3},{"task":"/task/automatic-speech-recognition","name":"Automatic Speech Recognition (ASR)","papers":3},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":3},{"task":"/task/backdoor-attack","name":"Backdoor Attack","papers":3},{"task":"/task/classification-1","name":"Classification","papers":3},{"task":"/task/deep-learning","name":"Deep Learning","papers":3},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":3},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":3}],"tasks_shown":20,"n_tasks":102,"usage_by_year":[{"year":"2019","papers":7},{"year":"2020","papers":30},{"year":"2021","papers":26},{"year":"2022","papers":21},{"year":"2023","papers":26},{"year":"2024","papers":30},{"year":"2025","papers":7}],"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/randomized-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=Randomized%20Smoothing","read_at":"2026-10-05T01:00:55+00:00","query":"Randomized Smoothing","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"randomized smoothing","origin_arxiv_id":"2603.10821"},"resolution":"case_insensitive","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1902.02918","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"listed_only"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2603.10821","citations":1},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Randomized 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":[{"name":"policy smoothing","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='policy smoothing')","origin_arxiv_id":"2106.11420"},{"name":"Center Smoothing","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='Center Smoothing')","origin_arxiv_id":"2102.09701"},{"name":"DEMASKED SMOOTHING","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='DEMASKED SMOOTHING')","origin_arxiv_id":"2209.05980"},{"name":"randomized synthesis data engine","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='randomized synthesis data engine')","origin_arxiv_id":"2411.02372"},{"name":"Denoised Diffusion Smoothing (DDS)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='Denoised Diffusion Smoothing (DDS)')","origin_arxiv_id":"2311.17983"},{"name":"Randomized Return Decomposition (RRD)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Randomized Return Decomposition (RRD)')","origin_arxiv_id":"2111.13485"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2603.10821","page":"/paper/arxiv-2603-10821","syntology_url":"https://syntology.ai/paper/2603.10821","in_graph_layer":true,"samples":3,"ran":1,"n_ran_checked":1,"n_instrument":0,"unverified":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2603.10821: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: listed only). The lookup matched 'randomized smoothing' ignoring case. About another paper: this answer is about arXiv:2603.10821, while the archive credits arXiv:1902.02918.","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":"9bd2df205a2e32bb247ba7b367c57465535924d555f8b8b6dcaeace05ab28d04","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}