{"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":"/task/adversarial-defense","name":"Adversarial Defense","slug":"adversarial-defense","description_markdown":"Competitions with currently unpublished results:\r\n\r\n- [TrojAI](https://pages.nist.gov/trojai/)","categories":[{"name":"Adversarial","url":"/area/adversarial"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":403,"papers_with_code":216,"benchmarks":10,"benchmark_tables_in_archive":10,"benchmark_tables_shown":10,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":2,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/adversarial-defense-on-cifar-10","slug":"adversarial-defense-on-cifar-10","dataset":"CIFAR-10","dataset_url":"/dataset/cifar-10","rows_in_archive":8,"metrics":["Accuracy","Attack: AutoAttack","Robust Accuracy"],"first_row_in_archive_order":{"model":"WRN-28-10","paper_title":"Language Guided Adversarial Purification","paper_url":"/paper/language-guided-adversarial-purification","paper_date":"2023-09-19","arxiv_id":"2309.10348","code_links":[{"title":"Visual-Conception-Group/LGAP","url":"https://github.com/Visual-Conception-Group/LGAP"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-imagenet-non-targeted","slug":"adversarial-defense-on-imagenet-non-targeted","dataset":"ImageNet (non-targeted PGD, max perturbation=4)","dataset_url":null,"rows_in_archive":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SAT-EfficientNet-L1","paper_title":"Smooth Adversarial Training","paper_url":"/paper/smooth-adversarial-training","paper_date":"2020-06-25","arxiv_id":"2006.14536","code_links":[{"title":"cihangxie/SmoothAdversarialTraining","url":"https://github.com/cihangxie/SmoothAdversarialTraining"}],"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/smooth-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2006.14536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14536"}},"official":{"repos":["cihangxie/SmoothAdversarialTraining"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/adversarial-defense-on-cifar-100","slug":"adversarial-defense-on-cifar-100","dataset":"CIFAR-100","dataset_url":"/dataset/cifar-100","rows_in_archive":3,"metrics":["autoattack"],"first_row_in_archive_order":{"model":"wideresnet-34-20","paper_title":"Learnable Boundary Guided Adversarial Training","paper_url":"/paper/learnable-boundary-guided-adversarial","paper_date":"2020-11-23","arxiv_id":"2011.11164","code_links":[{"title":"fra31/auto-attack","url":"https://github.com/fra31/auto-attack"},{"title":"jiequancui/LBGAT","url":"https://github.com/jiequancui/LBGAT"},{"title":"dvlab-research/LBGAT","url":"https://github.com/dvlab-research/LBGAT"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-imagenet","slug":"adversarial-defense-on-imagenet","dataset":"ImageNet","dataset_url":"/dataset/imagenet","rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ResNet101","paper_title":"NOMARO: Defending against Adversarial Attacks by NOMA-Inspired Reconstruction Operation","paper_url":"/paper/nomaro-defending-against-adversarial-attacks","paper_date":"2021-12-14","arxiv_id":null,"code_links":[{"title":"as791/NOMARO_defense","url":"https://github.com/as791/NOMARO_defense"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-imagenet-targeted-pgd","slug":"adversarial-defense-on-imagenet-targeted-pgd","dataset":"ImageNet (targeted PGD, max perturbation=16)","dataset_url":null,"rows_in_archive":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ResNet-152 Denoise","paper_title":"Feature Denoising for Improving Adversarial Robustness","paper_url":"/paper/feature-denoising-for-improving-adversarial","paper_date":"2018-12-09","arxiv_id":"1812.03411","code_links":[{"title":"facebookresearch/ImageNet-Adversarial-Training","url":"https://github.com/facebookresearch/ImageNet-Adversarial-Training"},{"title":"lirundong/quant-pack","url":"https://github.com/lirundong/quant-pack"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-mnist","slug":"adversarial-defense-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":2,"metrics":["Accuracy","Inference speed"],"first_row_in_archive_order":{"model":"Defense GAN","paper_title":"Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models","paper_url":"/paper/defense-gan-protecting-classifiers-against","paper_date":"2018-05-17","arxiv_id":"1805.06605","code_links":[{"title":"kabkabm/defensegan","url":"https://github.com/kabkabm/defensegan"},{"title":"mnswdhw/DefenseGAN-and-Cowboy-Defense","url":"https://github.com/mnswdhw/DefenseGAN-and-Cowboy-Defense"},{"title":"RSMung/DefenseGAN-pytorch","url":"https://github.com/RSMung/DefenseGAN-pytorch"},{"title":"mnswdhw/InvGAN-Pytorch","url":"https://github.com/mnswdhw/InvGAN-Pytorch"},{"title":"bibin-sebastian/Physical_Adversarial_examples_GAN","url":"https://github.com/bibin-sebastian/Physical_Adversarial_examples_GAN"}],"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/defense-gan-protecting-classifiers-against#ran","syntology_url":"https://syntology.ai/paper/1805.06605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06605"}},"official":{"repos":["kabkabm/defensegan"],"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"]}}}},{"leaderboard":"/sota/adversarial-defense-on-caad-2018","slug":"adversarial-defense-on-caad-2018","dataset":"CAAD 2018","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Feature Denoising","paper_title":"Feature Denoising for Improving Adversarial Robustness","paper_url":"/paper/feature-denoising-for-improving-adversarial","paper_date":"2018-12-09","arxiv_id":"1812.03411","code_links":[{"title":"facebookresearch/ImageNet-Adversarial-Training","url":"https://github.com/facebookresearch/ImageNet-Adversarial-Training"},{"title":"lirundong/quant-pack","url":"https://github.com/lirundong/quant-pack"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-miniimagenet","slug":"adversarial-defense-on-miniimagenet","dataset":"miniImageNet","dataset_url":"/dataset/mini-imagenet","rows_in_archive":1,"metrics":["Accuracy "],"first_row_in_archive_order":{"model":"Auto Encoder-Block Switching defense with GradCAM","paper_title":"An integrated Auto Encoder-Block Switching defense approach to prevent adversarial attacks","paper_url":"/paper/an-integrated-auto-encoder-block-switching-1","paper_date":"2022-03-11","arxiv_id":"2203.10930","code_links":[{"title":"anirudh9784/Adversarial-Defense","url":"https://github.com/anirudh9784/Adversarial-Defense"},{"title":"anirudh9784/Adversarial-Attacks-and-Defences","url":"https://github.com/anirudh9784/Adversarial-Attacks-and-Defences"}],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-trojai-round-0","slug":"adversarial-defense-on-trojai-round-0","dataset":"TrojAI Round 0","dataset_url":null,"rows_in_archive":1,"metrics":["Detection Accuracy"],"first_row_in_archive_order":{"model":"Cassandra","paper_title":"Cassandra: Detecting Trojaned Networks from Adversarial Perturbations","paper_url":"/paper/cassandra-detecting-trojaned-networks-from","paper_date":"2020-07-28","arxiv_id":"2007.14433","code_links":[],"syntology":null}},{"leaderboard":"/sota/adversarial-defense-on-trojai-round-1","slug":"adversarial-defense-on-trojai-round-1","dataset":"TrojAI Round 1","dataset_url":null,"rows_in_archive":1,"metrics":["Detection Accuracy"],"first_row_in_archive_order":{"model":"Cassandra","paper_title":"Cassandra: Detecting Trojaned Networks from Adversarial Perturbations","paper_url":"/paper/cassandra-detecting-trojaned-networks-from","paper_date":"2020-07-28","arxiv_id":"2007.14433","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145},{"url":"/dataset/imagenet","name":"ImageNet","full_name":"","num_papers_in_archive":15430},{"url":"/dataset/cifar-100","name":"CIFAR-100","full_name":"","num_papers_in_archive":9045},{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/icons-50","name":"Icons-50","full_name":"","num_papers_in_archive":2}],"subtasks":[{"url":"/task/adversarial-purification","name":"Adversarial Purification"},{"url":"/task/provable-adversarial-defense","name":"Provable Adversarial Defense"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":403,"of_with_code":216,"tagged_in_all":403,"counts":{"archive_papers_tagged":403,"with_a_code_link":216,"where_syntology_ran_a_sample":66,"not_listed_spam_title":0,"listed":403,"listed_where_code_ran":66,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":50,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":50,"listed_every_run_a_failure_of_syntologys_instrument":16,"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"},"items":[{"url":"/paper/towards-deep-learning-models-resistant-to","slug":"towards-deep-learning-models-resistant-to","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","date":"2017-06-19","arxiv_id":"1706.06083","repositories_listed":59,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":8,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/towards-deep-learning-models-resistant-to#ran","syntology_url":"https://syntology.ai/paper/1706.06083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.06083"}},"official":{"repos":["MadryLab/cifar10_challenge","MadryLab/mnist_challenge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/benchmarking-neural-network-robustness-to-2","slug":"benchmarking-neural-network-robustness-to-2","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","date":"2019-03-28","arxiv_id":"1903.12261","repositories_listed":14,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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","sample_list":"/paper/benchmarking-neural-network-robustness-to-2#ran","syntology_url":"https://syntology.ai/paper/1903.12261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12261"}},"official":{"repos":["hendrycks/robustness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/technical-report-on-the-cleverhans-v210","slug":"technical-report-on-the-cleverhans-v210","title":"Technical Report on the CleverHans v2.1.0 Adversarial Examples Library","date":"2016-10-03","arxiv_id":"1610.00768","repositories_listed":13,"syntology":{"n":26,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":14,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":26,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/technical-report-on-the-cleverhans-v210#ran","syntology_url":"https://syntology.ai/paper/1610.00768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.00768"}},"official":{"repos":["tensorflow/cleverhans"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/certified-adversarial-robustness-via","slug":"certified-adversarial-robustness-via","title":"Certified Adversarial Robustness via Randomized Smoothing","date":"2019-02-08","arxiv_id":"1902.02918","repositories_listed":12,"syntology":null},{"url":"/paper/the-limitations-of-deep-learning-in","slug":"the-limitations-of-deep-learning-in","title":"The Limitations of Deep Learning in Adversarial Settings","date":"2015-11-24","arxiv_id":"1511.07528","repositories_listed":11,"syntology":null},{"url":"/paper/theoretically-principled-trade-off-between","slug":"theoretically-principled-trade-off-between","title":"Theoretically Principled Trade-off between Robustness and Accuracy","date":"2019-01-24","arxiv_id":"1901.08573","repositories_listed":9,"syntology":{"n":15,"n_ran":12,"n_constructed":6,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"12 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/theoretically-principled-trade-off-between#ran","syntology_url":"https://syntology.ai/paper/1901.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08573"}},"official":{"repos":["yaodongyu/TRADES"],"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"]}}},{"url":"/paper/adversarial-training-for-free","slug":"adversarial-training-for-free","title":"Adversarial Training for Free!","date":"2019-04-29","arxiv_id":"1904.12843","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/adversarial-training-for-free#ran","syntology_url":"https://syntology.ai/paper/1904.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12843"}},"official":{"repos":["ashafahi/free_adv_train","mahyarnajibi/FreeAdversarialTraining"],"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"]}}},{"url":"/paper/enresnet-resnet-ensemble-via-the-feynman-kac","slug":"enresnet-resnet-ensemble-via-the-feynman-kac","title":"ResNets Ensemble via the Feynman-Kac Formalism to Improve Natural and Robust Accuracies","date":"2018-11-26","arxiv_id":"1811.10745","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/enresnet-resnet-ensemble-via-the-feynman-kac#ran","syntology_url":"https://syntology.ai/paper/1811.10745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.10745"}},"official":{"repos":["BaoWangMath/EnResNet"],"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"]}}},{"url":"/paper/defense-gan-protecting-classifiers-against","slug":"defense-gan-protecting-classifiers-against","title":"Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models","date":"2018-05-17","arxiv_id":"1805.06605","repositories_listed":5,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/defense-gan-protecting-classifiers-against#ran","syntology_url":"https://syntology.ai/paper/1805.06605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06605"}},"official":{"repos":["kabkabm/defensegan"],"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"]}}},{"url":"/paper/zoo-zeroth-order-optimization-based-black-box","slug":"zoo-zeroth-order-optimization-based-black-box","title":"ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models","date":"2017-08-14","arxiv_id":"1708.03999","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/zoo-zeroth-order-optimization-based-black-box#ran","syntology_url":"https://syntology.ai/paper/1708.03999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.03999"}},"official":{"repos":["huanzhang12/ZOO-Attack"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/decoupled-kullback-leibler-divergence-loss","slug":"decoupled-kullback-leibler-divergence-loss","title":"Decoupled Kullback-Leibler Divergence Loss","date":"2023-05-23","arxiv_id":"2305.13948","repositories_listed":4,"syntology":{"n":11,"n_ran":11,"n_constructed":1,"n_ran_checked":5,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decoupled-kullback-leibler-divergence-loss#ran","syntology_url":"https://syntology.ai/paper/2305.13948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13948"}},"official":{"repos":["jiequancui/DKL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-evaluating-adversarial-robustness","slug":"on-evaluating-adversarial-robustness","title":"On Evaluating Adversarial Robustness","date":"2019-02-18","arxiv_id":"1902.06705","repositories_listed":4,"syntology":null},{"url":"/paper/obfuscated-gradients-give-a-false-sense-of","slug":"obfuscated-gradients-give-a-false-sense-of","title":"Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples","date":"2018-02-01","arxiv_id":"1802.00420","repositories_listed":4,"syntology":null},{"url":"/paper/certified-defenses-against-adversarial","slug":"certified-defenses-against-adversarial","title":"Certified Defenses against Adversarial Examples","date":"2018-01-29","arxiv_id":"1801.09344","repositories_listed":4,"syntology":null},{"url":"/paper/learning-deep-compositional-grammatical","slug":"learning-deep-compositional-grammatical","title":"AOGNets: Compositional Grammatical Architectures for Deep Learning","date":"2017-11-15","arxiv_id":"1711.05847","repositories_listed":4,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 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; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-deep-compositional-grammatical#ran","syntology_url":"https://syntology.ai/paper/1711.05847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05847"}},"official":{"repos":["iVMCL/AOGNets"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/advfas-a-robust-face-anti-spoofing-framework","slug":"advfas-a-robust-face-anti-spoofing-framework","title":"AdvFAS: A robust face anti-spoofing framework against adversarial examples","date":"2023-08-04","arxiv_id":"2308.02116","repositories_listed":3,"syntology":null},{"url":"/paper/robust-classification-via-a-single-diffusion","slug":"robust-classification-via-a-single-diffusion","title":"Robust Classification via a Single Diffusion Model","date":"2023-05-24","arxiv_id":"2305.15241","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/robust-classification-via-a-single-diffusion#ran","syntology_url":"https://syntology.ai/paper/2305.15241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15241"}},"official":{"repos":["huanranchen/diffusionclassifier","huanranchen/AdversarialAttacks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/learnable-boundary-guided-adversarial","slug":"learnable-boundary-guided-adversarial","title":"Learnable Boundary Guided Adversarial Training","date":"2020-11-23","arxiv_id":"2011.11164","repositories_listed":3,"syntology":null},{"url":"/paper/ensembles-of-many-diverse-weak-defenses-can","slug":"ensembles-of-many-diverse-weak-defenses-can","title":"ATHENA: A Framework based on Diverse Weak Defenses for Building Adversarial Defense","date":"2020-01-02","arxiv_id":"2001.00308","repositories_listed":3,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ensembles-of-many-diverse-weak-defenses-can#ran","syntology_url":"https://syntology.ai/paper/2001.00308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00308"}},"official":{"repos":["softsys4ai/athena"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/190808016","slug":"190808016","title":"Testing Robustness Against Unforeseen Adversaries","date":"2019-08-21","arxiv_id":"1908.08016","repositories_listed":3,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190808016#ran","syntology_url":"https://syntology.ai/paper/1908.08016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08016"}},"official":{"repos":["centerforaisafety/adversarial-corruptions","ddkang/advex-uar"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/provably-robust-deep-learning-via","slug":"provably-robust-deep-learning-via","title":"Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers","date":"2019-06-09","arxiv_id":"1906.04584","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/provably-robust-deep-learning-via#ran","syntology_url":"https://syntology.ai/paper/1906.04584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04584"}},"official":{"repos":["Hadisalman/smoothing-adversarial"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/robust-decision-trees-against-adversarial","slug":"robust-decision-trees-against-adversarial","title":"Robust Decision Trees Against Adversarial Examples","date":"2019-02-27","arxiv_id":"1902.10660","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/robust-decision-trees-against-adversarial#ran","syntology_url":"https://syntology.ai/paper/1902.10660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10660"}},"official":{"repos":["chenhongge/RobustTrees"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/advertorch-v01-an-adversarial-robustness","slug":"advertorch-v01-an-adversarial-robustness","title":"advertorch v0.1: An Adversarial Robustness Toolbox based on PyTorch","date":"2019-02-20","arxiv_id":"1902.07623","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/advertorch-v01-an-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/1902.07623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07623"}},"official":{"repos":["BorealisAI/advertorch"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/sample-correlation-for-fingerprinting-deep","slug":"sample-correlation-for-fingerprinting-deep","title":"Sample Correlation for Fingerprinting Deep Face Recognition","date":"2024-12-30","arxiv_id":"2412.20768","repositories_listed":2,"syntology":null},{"url":"/paper/dad-improved-data-free-test-time-adversarial","slug":"dad-improved-data-free-test-time-adversarial","title":"DAD++: Improved Data-free Test Time Adversarial Defense","date":"2023-09-10","arxiv_id":"2309.05132","repositories_listed":2,"syntology":null},{"url":"/paper/critical-points-an-agile-point-cloud","slug":"critical-points-an-agile-point-cloud","title":"Robustifying Point Cloud Networks by Refocusing","date":"2023-08-10","arxiv_id":"2308.05525","repositories_listed":2,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":6,"n_honours":2,"n_violates":1,"n_no_contract":8,"n_pointer_only":22,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 1 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/critical-points-an-agile-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2308.05525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05525"}},"official":{"repos":["yossilevii100/critical_points2","yossilevii100/refocusing"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/visual-prompting-for-adversarial-robustness","slug":"visual-prompting-for-adversarial-robustness","title":"Visual Prompting for Adversarial Robustness","date":"2022-10-12","arxiv_id":"2210.06284","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/visual-prompting-for-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2210.06284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06284"}},"official":{"repos":["Phoveran/vp-for-adversarial-robustness"],"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"]}}},{"url":"/paper/lpf-defense-3d-adversarial-defense-based-on","slug":"lpf-defense-3d-adversarial-defense-based-on","title":"LPF-Defense: 3D Adversarial Defense based on Frequency Analysis","date":"2022-02-23","arxiv_id":"2202.11287","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-and-advancing-fast-adversarial-1","slug":"revisiting-and-advancing-fast-adversarial-1","title":"Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization","date":"2021-12-23","arxiv_id":"2112.12376","repositories_listed":2,"syntology":null},{"url":"/paper/robust-person-re-identification-with-multi","slug":"robust-person-re-identification-with-multi","title":"Person Re-identification Method Based on Color Attack and Joint Defence","date":"2021-11-18","arxiv_id":"2111.09571","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/robust-person-re-identification-with-multi#ran","syntology_url":"https://syntology.ai/paper/2111.09571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.09571"}},"official":null}},{"url":"/paper/helper-based-adversarial-training-reducing","slug":"helper-based-adversarial-training-reducing","title":"Helper-based Adversarial Training: Reducing Excessive Margin to Achieve a Better Accuracy vs. Robustness Trade-off","date":"2021-06-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/fast-certified-robust-training-via-better","slug":"fast-certified-robust-training-via-better","title":"Fast Certified Robust Training with Short Warmup","date":"2021-03-31","arxiv_id":"2103.17268","repositories_listed":2,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/fast-certified-robust-training-via-better#ran","syntology_url":"https://syntology.ai/paper/2103.17268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.17268"}},"official":{"repos":["KaidiXu/auto_LiRPA","shizhouxing/Fast-Certified-Robust-Training"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-person-re-identification-data-augmentation","slug":"a-person-re-identification-data-augmentation","title":"A Person Re-identification Data Augmentation Method with Adversarial Defense Effect","date":"2021-01-21","arxiv_id":"2101.08783","repositories_listed":2,"syntology":null},{"url":"/paper/towards-building-a-robust-and-fair-federated","slug":"towards-building-a-robust-and-fair-federated","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","date":"2020-11-20","arxiv_id":"2011.10464","repositories_listed":2,"syntology":null},{"url":"/paper/perceptual-adversarial-robustness-defense","slug":"perceptual-adversarial-robustness-defense","title":"Perceptual Adversarial Robustness: Defense Against Unseen Threat Models","date":"2020-06-22","arxiv_id":"2006.12655","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":9,"n_ran_checked":10,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 9 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/perceptual-adversarial-robustness-defense#ran","syntology_url":"https://syntology.ai/paper/2006.12655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12655"}},"official":{"repos":["cassidylaidlaw/perceptual-advex"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":7,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/patchattack-a-black-box-texture-based-attack","slug":"patchattack-a-black-box-texture-based-attack","title":"PatchAttack: A Black-box Texture-based Attack with Reinforcement Learning","date":"2020-04-12","arxiv_id":"2004.05682","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/patchattack-a-black-box-texture-based-attack#ran","syntology_url":"https://syntology.ai/paper/2004.05682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05682"}},"official":{"repos":["Chenglin-Yang/PatchAttack"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/error-correcting-output-codes-improve","slug":"error-correcting-output-codes-improve","title":"Error Correcting Output Codes Improve Probability Estimation and Adversarial Robustness of Deep Neural Networks","date":"2019-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/smoothed-inference-for-adversarially-trained","slug":"smoothed-inference-for-adversarially-trained","title":"Smoothed Inference for Adversarially-Trained Models","date":"2019-11-17","arxiv_id":"1911.07198","repositories_listed":2,"syntology":null},{"url":"/paper/you-only-propagate-once-painless-adversarial","slug":"you-only-propagate-once-painless-adversarial","title":"You Only Propagate Once: Accelerating Adversarial Training via Maximal Principle","date":"2019-05-02","arxiv_id":"1905.00877","repositories_listed":2,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via-guided","slug":"improving-adversarial-robustness-via-guided","title":"Improving Adversarial Robustness via Guided Complement Entropy","date":"2019-03-23","arxiv_id":"1903.09799","repositories_listed":2,"syntology":null},{"url":"/paper/the-vulnerabilities-of-graph-convolutional","slug":"the-vulnerabilities-of-graph-convolutional","title":"Adversarial Examples on Graph Data: Deep Insights into Attack and Defense","date":"2019-03-05","arxiv_id":"1903.01610","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/the-vulnerabilities-of-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1903.01610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01610"}},"official":{"repos":["stellargraph/stellargraph"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/wasserstein-adversarial-examples-via","slug":"wasserstein-adversarial-examples-via","title":"Wasserstein Adversarial Examples via Projected Sinkhorn Iterations","date":"2019-02-21","arxiv_id":"1902.07906","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-adversarial-examples-via#ran","syntology_url":"https://syntology.ai/paper/1902.07906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07906"}},"official":{"repos":["locuslab/projected_sinkhorn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-denoising-for-improving-adversarial","slug":"feature-denoising-for-improving-adversarial","title":"Feature Denoising for Improving Adversarial Robustness","date":"2018-12-09","arxiv_id":"1812.03411","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-formal-safety-analysis-of-neural","slug":"efficient-formal-safety-analysis-of-neural","title":"Efficient Formal Safety Analysis of Neural Networks","date":"2018-09-19","arxiv_id":"1809.08098","repositories_listed":2,"syntology":null},{"url":"/paper/benchmarking-neural-network-robustness-to","slug":"benchmarking-neural-network-robustness-to","title":"Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations","date":"2018-07-04","arxiv_id":"1807.01697","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarking-neural-network-robustness-to#ran","syntology_url":"https://syntology.ai/paper/1807.01697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.01697"}},"official":null}},{"url":"/paper/defense-against-adversarial-attacks-using","slug":"defense-against-adversarial-attacks-using","title":"Defense against Adversarial Attacks Using High-Level Representation Guided Denoiser","date":"2017-12-08","arxiv_id":"1712.02976","repositories_listed":2,"syntology":null},{"url":"/paper/mitigating-adversarial-effects-through","slug":"mitigating-adversarial-effects-through","title":"Mitigating Adversarial Effects Through Randomization","date":"2017-11-06","arxiv_id":"1711.01991","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/mitigating-adversarial-effects-through#ran","syntology_url":"https://syntology.ai/paper/1711.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.01991"}},"official":{"repos":["cihangxie/NIPS2017_adv_challenge_defense"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/delving-into-transferable-adversarial","slug":"delving-into-transferable-adversarial","title":"Delving into Transferable Adversarial Examples and Black-box Attacks","date":"2016-11-08","arxiv_id":"1611.02770","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/delving-into-transferable-adversarial#ran","syntology_url":"https://syntology.ai/paper/1611.02770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.02770"}},"official":{"repos":["sunblaze-ucb/transferability-advdnn-pub"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/safety-verification-of-deep-neural-networks","slug":"safety-verification-of-deep-neural-networks","title":"Safety Verification of Deep Neural Networks","date":"2016-10-21","arxiv_id":"1610.06940","repositories_listed":2,"syntology":null},{"url":"/paper/bridging-robustness-and-generalization","slug":"bridging-robustness-and-generalization","title":"Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach","date":"2025-07-14","arxiv_id":"2507.10330","repositories_listed":1,"syntology":null},{"url":"/paper/towards-effective-and-efficient-adversarial","slug":"towards-effective-and-efficient-adversarial","title":"Towards Effective and Efficient Adversarial Defense with Diffusion Models for Robust Visual Tracking","date":"2025-05-31","arxiv_id":"2506.00325","repositories_listed":1,"syntology":null},{"url":"/paper/accidental-misalignment-fine-tuning-language","slug":"accidental-misalignment-fine-tuning-language","title":"Accidental Misalignment: Fine-Tuning Language Models Induces Unexpected Vulnerability","date":"2025-05-22","arxiv_id":"2505.16789","repositories_listed":1,"syntology":null},{"url":"/paper/a-few-large-shifts-layer-inconsistency-based","slug":"a-few-large-shifts-layer-inconsistency-based","title":"A Few Large Shifts: Layer-Inconsistency Based Minimal Overhead Adversarial Example Detection","date":"2025-05-19","arxiv_id":"2505.12586","repositories_listed":1,"syntology":null},{"url":"/paper/2505-10983","slug":"2505-10983","title":"GenoArmory: A Unified Evaluation Framework for Adversarial Attacks on Genomic Foundation Models","date":"2025-05-16","arxiv_id":"2505.10983","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-defense-against-adversarial","slug":"lightweight-defense-against-adversarial","title":"Lightweight Defense Against Adversarial Attacks in Time Series Classification","date":"2025-05-04","arxiv_id":"2505.02073","repositories_listed":1,"syntology":null},{"url":"/paper/ddad-a-two-pronged-adversarial-defense-based","slug":"ddad-a-two-pronged-adversarial-defense-based","title":"One Stone, Two Birds: Enhancing Adversarial Defense Through the Lens of Distributional Discrepancy","date":"2025-03-04","arxiv_id":"2503.02169","repositories_listed":1,"syntology":null},{"url":"/paper/videopure-diffusion-based-adversarial","slug":"videopure-diffusion-based-adversarial","title":"VideoPure: Diffusion-based Adversarial Purification for Video Recognition","date":"2025-01-25","arxiv_id":"2501.14999","repositories_listed":1,"syntology":null},{"url":"/paper/neural-fingerprints-for-adversarial-attack","slug":"neural-fingerprints-for-adversarial-attack","title":"Neural Fingerprints for Adversarial Attack Detection","date":"2024-11-07","arxiv_id":"2411.04533","repositories_listed":1,"syntology":null},{"url":"/paper/alignment-based-adversarial-training-abat-for","slug":"alignment-based-adversarial-training-abat-for","title":"Alignment-Based Adversarial Training (ABAT) for Improving the Robustness and Accuracy of EEG-Based BCIs","date":"2024-11-04","arxiv_id":"2411.02094","repositories_listed":1,"syntology":null},{"url":"/paper/causaldiff-causality-inspired-disentanglement","slug":"causaldiff-causality-inspired-disentanglement","title":"CausalDiff: Causality-Inspired Disentanglement via Diffusion Model for Adversarial Defense","date":"2024-10-30","arxiv_id":"2410.23091","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/causaldiff-causality-inspired-disentanglement#ran","syntology_url":"https://syntology.ai/paper/2410.23091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23091"}},"official":{"repos":["cas-aisafetybasicresearchgroup/causaldiff"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/unitary-multi-margin-bert-for-robust-natural","slug":"unitary-multi-margin-bert-for-robust-natural","title":"Unitary Multi-Margin BERT for Robust Natural Language Processing","date":"2024-10-16","arxiv_id":"2410.12759","repositories_listed":1,"syntology":null},{"url":"/paper/interpretability-guided-test-time-adversarial","slug":"interpretability-guided-test-time-adversarial","title":"Interpretability-Guided Test-Time Adversarial Defense","date":"2024-09-23","arxiv_id":"2409.15190","repositories_listed":1,"syntology":null},{"url":"/paper/real-world-adversarial-defense-against-patch","slug":"real-world-adversarial-defense-against-patch","title":"Real-world Adversarial Defense against Patch Attacks based on Diffusion Model","date":"2024-09-14","arxiv_id":"2409.09406","repositories_listed":1,"syntology":null},{"url":"/paper/improving-out-of-distribution-data-handling","slug":"improving-out-of-distribution-data-handling","title":"Improving Out-of-Distribution Data Handling and Corruption Resistance via Modern Hopfield Networks","date":"2024-08-21","arxiv_id":"2408.11309","repositories_listed":1,"syntology":null},{"url":"/paper/shedding-more-light-on-robust-classifiers","slug":"shedding-more-light-on-robust-classifiers","title":"Shedding More Light on Robust Classifiers under the lens of Energy-based Models","date":"2024-07-08","arxiv_id":"2407.06315","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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","sample_list":"/paper/shedding-more-light-on-robust-classifiers#ran","syntology_url":"https://syntology.ai/paper/2407.06315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06315"}},"official":{"repos":["omnai-lab/robust-classifiers-under-the-lens-of-ebm"],"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"]}}},{"url":"/paper/diffusedef-improved-robustness-to-adversarial","slug":"diffusedef-improved-robustness-to-adversarial","title":"DiffuseDef: Improved Robustness to Adversarial Attacks via Iterative Denoising","date":"2024-06-28","arxiv_id":"2407.00248","repositories_listed":1,"syntology":null},{"url":"/paper/deciphering-the-definition-of-adversarial","slug":"deciphering-the-definition-of-adversarial","title":"Deciphering the Definition of Adversarial Robustness for post-hoc OOD Detectors","date":"2024-06-21","arxiv_id":"2406.15104","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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","sample_list":"/paper/deciphering-the-definition-of-adversarial#ran","syntology_url":"https://syntology.ai/paper/2406.15104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15104"}},"official":{"repos":["adverml/advopenood"],"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"]}}},{"url":"/paper/maskpure-improving-defense-against-text","slug":"maskpure-improving-defense-against-text","title":"MaskPure: Improving Defense Against Text Adversaries with Stochastic Purification","date":"2024-06-18","arxiv_id":"2406.13066","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via-5","slug":"improving-adversarial-robustness-via-5","title":"Improving Adversarial Robustness via Decoupled Visual Representation Masking","date":"2024-06-16","arxiv_id":"2406.10933","repositories_listed":1,"syntology":null},{"url":"/paper/towards-unified-robustness-against-both","slug":"towards-unified-robustness-against-both","title":"Towards Unified Robustness Against Both Backdoor and Adversarial Attacks","date":"2024-05-28","arxiv_id":"2405.17929","repositories_listed":1,"syntology":null},{"url":"/paper/robust-width-a-lightweight-and-certifiable","slug":"robust-width-a-lightweight-and-certifiable","title":"Robust width: A lightweight and certifiable adversarial defense","date":"2024-05-24","arxiv_id":"2405.15971","repositories_listed":1,"syntology":null},{"url":"/paper/the-pitfalls-and-promise-of-conformal","slug":"the-pitfalls-and-promise-of-conformal","title":"The Pitfalls and Promise of Conformal Inference Under Adversarial Attacks","date":"2024-05-14","arxiv_id":"2405.08886","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-pitfalls-and-promise-of-conformal#ran","syntology_url":"https://syntology.ai/paper/2405.08886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08886"}},"official":{"repos":["ziquanliu/ICML2024-AT-UR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-the-adversarial-robustness-of","slug":"revisiting-the-adversarial-robustness-of","title":"Revisiting the Adversarial Robustness of Vision Language Models: a Multimodal Perspective","date":"2024-04-30","arxiv_id":"2404.19287","repositories_listed":1,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":6,"n_instrument":12,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 12 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-the-adversarial-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2404.19287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19287"}},"official":{"repos":["ellezwq/mmcoa"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-adversarial-examples-generation","slug":"efficiently-adversarial-examples-generation","title":"Efficient Generation of Targeted and Transferable Adversarial Examples for Vision-Language Models Via Diffusion Models","date":"2024-04-16","arxiv_id":"2404.10335","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/efficiently-adversarial-examples-generation#ran","syntology_url":"https://syntology.ai/paper/2404.10335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10335"}},"official":{"repos":["gq-max/advdiffvlm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adapt-to-robustify-prompt-tuning-vision","slug":"adapt-to-robustify-prompt-tuning-vision","title":"ADAPT to Robustify Prompt Tuning Vision Transformers","date":"2024-03-19","arxiv_id":"2403.13196","repositories_listed":1,"syntology":null},{"url":"/paper/robust-overfitting-does-matter-test-time","slug":"robust-overfitting-does-matter-test-time","title":"Robust Overfitting Does Matter: Test-Time Adversarial Purification With FGSM","date":"2024-03-18","arxiv_id":"2403.11448","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-adversarial-training-under-long","slug":"revisiting-adversarial-training-under-long","title":"Revisiting Adversarial Training under Long-Tailed Distributions","date":"2024-03-15","arxiv_id":"2403.10073","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-adversarial-training-under-long#ran","syntology_url":"https://syntology.ai/paper/2403.10073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10073"}},"official":{"repos":["nisplab/at-bsl"],"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"]}}},{"url":"/paper/a-simple-and-yet-fairly-effective-defense-for","slug":"a-simple-and-yet-fairly-effective-defense-for","title":"A Simple and Yet Fairly Effective Defense for Graph Neural Networks","date":"2024-02-21","arxiv_id":"2402.13987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 2 unverified","sample_list":"/paper/a-simple-and-yet-fairly-effective-defense-for#ran","syntology_url":"https://syntology.ai/paper/2402.13987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13987"}},"official":{"repos":["sennadir/noisygnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-clip-unsupervised-adversarial-fine","slug":"robust-clip-unsupervised-adversarial-fine","title":"Robust CLIP: Unsupervised Adversarial Fine-Tuning of Vision Embeddings for Robust Large Vision-Language Models","date":"2024-02-19","arxiv_id":"2402.12336","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 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; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-clip-unsupervised-adversarial-fine#ran","syntology_url":"https://syntology.ai/paper/2402.12336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12336"}},"official":{"repos":["chs20/robustvlm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-adversarial-defense","slug":"continual-adversarial-defense","title":"Continual Adversarial Defense","date":"2023-12-15","arxiv_id":"2312.09481","repositories_listed":1,"syntology":null},{"url":"/paper/detection-and-defense-of-unlearnable-examples","slug":"detection-and-defense-of-unlearnable-examples","title":"Detection and Defense of Unlearnable Examples","date":"2023-12-14","arxiv_id":"2312.08898","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":1,"n_instrument":12,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 12 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/detection-and-defense-of-unlearnable-examples#ran","syntology_url":"https://syntology.ai/paper/2312.08898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08898"}},"official":{"repos":["hala64/udp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/collapse-oriented-adversarial-training-with","slug":"collapse-oriented-adversarial-training-with","title":"Collapse-Aware Triplet Decoupling for Adversarially Robust Image Retrieval","date":"2023-12-12","arxiv_id":"2312.07364","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/robust-mri-reconstruction-by-smoothed#ran","syntology_url":"https://syntology.ai/paper/2312.07784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.07784"}},"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"]}}},{"url":"/paper/defense-against-adversarial-attacks-using-1","slug":"defense-against-adversarial-attacks-using-1","title":"Defense Against Adversarial Attacks using Convolutional Auto-Encoders","date":"2023-12-06","arxiv_id":"2312.03520","repositories_listed":1,"syntology":null},{"url":"/paper/learn-from-the-past-a-proxy-based-adversarial","slug":"learn-from-the-past-a-proxy-based-adversarial","title":"Learn from the Past: A Proxy Guided Adversarial Defense Framework with Self Distillation Regularization","date":"2023-10-19","arxiv_id":"2310.12713","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/provably-robust-cost-sensitive-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.08732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08732"}},"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"]}}},{"url":"/paper/robust-representation-learning-via-asymmetric","slug":"robust-representation-learning-via-asymmetric","title":"Enhancing Robust Representation in Adversarial Training: Alignment and Exclusion Criteria","date":"2023-10-05","arxiv_id":"2310.03358","repositories_listed":1,"syntology":null},{"url":"/paper/deepzero-scaling-up-zeroth-order-optimization","slug":"deepzero-scaling-up-zeroth-order-optimization","title":"DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training","date":"2023-10-03","arxiv_id":"2310.02025","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/deepzero-scaling-up-zeroth-order-optimization#ran","syntology_url":"https://syntology.ai/paper/2310.02025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02025"}},"official":{"repos":["OPTML-Group/DeepZero"],"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"]}}},{"url":"/paper/revisiting-adversarial-robustness-1","slug":"revisiting-adversarial-robustness-1","title":"Revisiting Adversarial Robustness Distillation from the Perspective of Robust Fairness","date":"2023-09-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/language-guided-adversarial-purification","slug":"language-guided-adversarial-purification","title":"Language Guided Adversarial Purification","date":"2023-09-19","arxiv_id":"2309.10348","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-based-adversarial-purification-for","slug":"diffusion-based-adversarial-purification-for","title":"Robust Physics-based Deep MRI Reconstruction Via Diffusion Purification","date":"2023-09-11","arxiv_id":"2309.05794","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-based-adversarial-purification-for#ran","syntology_url":"https://syntology.ai/paper/2309.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05794"}},"official":{"repos":["sjames40/adversarial-purification-for-mri"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffdefense-defending-against-adversarial","slug":"diffdefense-defending-against-adversarial","title":"DiffDefense: Defending against Adversarial Attacks via Diffusion Models","date":"2023-09-07","arxiv_id":"2309.03702","repositories_listed":1,"syntology":null},{"url":"/paper/universal-adversarial-defense-in-remote","slug":"universal-adversarial-defense-in-remote","title":"Universal Adversarial Defense in Remote Sensing Based on Pre-trained Denoising Diffusion Models","date":"2023-07-31","arxiv_id":"2307.16865","repositories_listed":1,"syntology":null},{"url":"/paper/advdiff-generating-unrestricted-adversarial","slug":"advdiff-generating-unrestricted-adversarial","title":"AdvDiff: Generating Unrestricted Adversarial Examples using Diffusion Models","date":"2023-07-24","arxiv_id":"2307.12499","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":5,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 5 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/advdiff-generating-unrestricted-adversarial#ran","syntology_url":"https://syntology.ai/paper/2307.12499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.12499"}},"official":{"repos":["EricDai0/advdiff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/making-pre-trained-language-models-both-task","slug":"making-pre-trained-language-models-both-task","title":"Making Pre-trained Language Models both Task-solvers and Self-calibrators","date":"2023-07-21","arxiv_id":"2307.11316","repositories_listed":1,"syntology":null},{"url":"/paper/erasing-transforming-and-noising-defense","slug":"erasing-transforming-and-noising-defense","title":"Erasing, Transforming, and Noising Defense Network for Occluded Person Re-Identification","date":"2023-07-14","arxiv_id":"2307.07187","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-adversarial-robustness-via-score-1","slug":"enhancing-adversarial-robustness-via-score-1","title":"Enhancing Adversarial Robustness via Score-Based Optimization","date":"2023-07-10","arxiv_id":"2307.04333","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/enhancing-adversarial-robustness-via-score-1#ran","syntology_url":"https://syntology.ai/paper/2307.04333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04333"}},"official":{"repos":["zzzhangboya/scoreopt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/diffender-diffusion-based-adversarial-defense","slug":"diffender-diffusion-based-adversarial-defense","title":"DIFFender: Diffusion-Based Adversarial Defense against Patch Attacks","date":"2023-06-15","arxiv_id":"2306.09124","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/diffender-diffusion-based-adversarial-defense#ran","syntology_url":"https://syntology.ai/paper/2306.09124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09124"}},"official":{"repos":["kkkcx/diffender"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-closer-look-at-the-adversarial-robustness-1","slug":"a-closer-look-at-the-adversarial-robustness-1","title":"A Closer Look at the Adversarial Robustness of Deep Equilibrium Models","date":"2023-06-02","arxiv_id":"2306.01429","repositories_listed":1,"syntology":null}],"syntology_records":44,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/adversarial-defense-on-cifar-10","since_archive":"/sota/adversarial-defense-on-cifar-10#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/adversarial-defense-on-imagenet","since_archive":"/sota/adversarial-defense-on-imagenet#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":66,"papers_where_code_ran_first_page":"/task/adversarial-defense/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/adversarial-defense/papers/2","json":"/task/adversarial-defense/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/adversarial-defense/papers/3","json":"/task/adversarial-defense/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/adversarial-defense/papers/4","json":"/task/adversarial-defense/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/adversarial-defense/papers/5","json":"/task/adversarial-defense/papers/5.json","rows":3},{"order":"ran","page":1,"of":1,"url":"/task/adversarial-defense/papers/ran/1","json":"/task/adversarial-defense/papers/ran/1.json","rows":66}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"1295d846567c155cdf7aea586c77892f8b4dd5e26b4420c049860bd5ab2fc432","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}