{"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-robustness","name":"Adversarial Robustness","slug":"adversarial-robustness","description_markdown":"Adversarial Robustness evaluates the vulnerabilities of machine learning models under various types of adversarial attacks.","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":1746,"papers_with_code":788,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"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":13,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/adversarial-robustness-on-advglue","slug":"adversarial-robustness-on-advglue","dataset":"AdvGLUE","dataset_url":"/dataset/advglue","rows_in_archive":10,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DeBERTa (single model)","paper_title":"Adversarial GLUE: A Multi-Task Benchmark for Robustness Evaluation of Language Models","paper_url":"/paper/adversarial-glue-a-multi-task-benchmark-for","paper_date":"2021-11-04","arxiv_id":"2111.02840","code_links":[{"title":"ai-secure/adversarial-glue","url":"https://github.com/ai-secure/adversarial-glue"}],"syntology":null}},{"leaderboard":"/sota/adversarial-robustness-on-cifar-10","slug":"adversarial-robustness-on-cifar-10","dataset":"CIFAR-10","dataset_url":"/dataset/cifar-10","rows_in_archive":5,"metrics":["Accuracy","Robust Accuracy","Attack: AutoAttack"],"first_row_in_archive_order":{"model":"Mixed classifier","paper_title":"Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing","paper_url":"/paper/improving-the-accuracy-robustness-trade-off","paper_date":"2023-01-29","arxiv_id":"2301.12554","code_links":[{"title":"codelion/adaptive-classifier","url":"https://github.com/codelion/adaptive-classifier"},{"title":"bai-yt/adaptivesmoothing","url":"https://github.com/bai-yt/adaptivesmoothing"}],"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/improving-the-accuracy-robustness-trade-off#ran","syntology_url":"https://syntology.ai/paper/2301.12554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12554"}},"official":{"repos":["bai-yt/adaptivesmoothing"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/adversarial-robustness-on-imagenet","slug":"adversarial-robustness-on-imagenet","dataset":"ImageNet","dataset_url":"/dataset/imagenet","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"ResNet-50 (SGD, Cosine)","paper_title":"Are Transformers More Robust Than CNNs?","paper_url":"/paper/are-transformers-more-robust-than-cnns","paper_date":"2021-11-10","arxiv_id":"2111.05464","code_links":[{"title":"ytongbai/ViTs-vs-CNNs","url":"https://github.com/ytongbai/ViTs-vs-CNNs"}],"syntology":null}},{"leaderboard":"/sota/adversarial-robustness-on-imagenet-a","slug":"adversarial-robustness-on-imagenet-a","dataset":"ImageNet-A","dataset_url":"/dataset/imagenet-a","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DeiT-S (AdamW, Cosine)","paper_title":"Are Transformers More Robust Than CNNs?","paper_url":"/paper/are-transformers-more-robust-than-cnns","paper_date":"2021-11-10","arxiv_id":"2111.05464","code_links":[{"title":"ytongbai/ViTs-vs-CNNs","url":"https://github.com/ytongbai/ViTs-vs-CNNs"}],"syntology":null}},{"leaderboard":"/sota/adversarial-robustness-on-imagenet-c","slug":"adversarial-robustness-on-imagenet-c","dataset":"ImageNet-C","dataset_url":"/dataset/imagenet-c","rows_in_archive":4,"metrics":["mean Corruption Error (mCE)"],"first_row_in_archive_order":{"model":"DeiT-S (AdamW, Cosine)","paper_title":"Are Transformers More Robust Than CNNs?","paper_url":"/paper/are-transformers-more-robust-than-cnns","paper_date":"2021-11-10","arxiv_id":"2111.05464","code_links":[{"title":"ytongbai/ViTs-vs-CNNs","url":"https://github.com/ytongbai/ViTs-vs-CNNs"}],"syntology":null}},{"leaderboard":"/sota/adversarial-robustness-on-stylized-imagenet","slug":"adversarial-robustness-on-stylized-imagenet","dataset":"Stylized ImageNet","dataset_url":"/dataset/stylized-imagenet","rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DeiT-S (AdamW, Cosine)","paper_title":"Are Transformers More Robust Than CNNs?","paper_url":"/paper/are-transformers-more-robust-than-cnns","paper_date":"2021-11-10","arxiv_id":"2111.05464","code_links":[{"title":"ytongbai/ViTs-vs-CNNs","url":"https://github.com/ytongbai/ViTs-vs-CNNs"}],"syntology":null}},{"leaderboard":"/sota/adversarial-robustness-on-cifar-100","slug":"adversarial-robustness-on-cifar-100","dataset":"CIFAR-100","dataset_url":"/dataset/cifar-100","rows_in_archive":2,"metrics":["Clean Accuracy","AutoAttacked Accuracy"],"first_row_in_archive_order":{"model":"Mixed Classifier","paper_title":"Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing","paper_url":"/paper/improving-the-accuracy-robustness-trade-off","paper_date":"2023-01-29","arxiv_id":"2301.12554","code_links":[{"title":"codelion/adaptive-classifier","url":"https://github.com/codelion/adaptive-classifier"},{"title":"bai-yt/adaptivesmoothing","url":"https://github.com/bai-yt/adaptivesmoothing"}],"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/improving-the-accuracy-robustness-trade-off#ran","syntology_url":"https://syntology.ai/paper/2301.12554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12554"}},"official":{"repos":["bai-yt/adaptivesmoothing"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}}}],"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/imagenet-c","name":"ImageNet-C","full_name":"ImageNet-C","num_papers_in_archive":602},{"url":"/dataset/imagenet-a","name":"ImageNet-A","full_name":"","num_papers_in_archive":431},{"url":"/dataset/stylized-imagenet","name":"Stylized ImageNet","full_name":"Stylized ImageNet","num_papers_in_archive":106},{"url":"/dataset/advglue","name":"AdvGLUE","full_name":"Adversarial GLUE","num_papers_in_archive":36},{"url":"/dataset/imagenet-patch","name":"ImageNet-Patch","full_name":"","num_papers_in_archive":5},{"url":"/dataset/clear-bias","name":"CLEAR-Bias","full_name":"Corpus for Linguistic Evaluation of Adversarial Robustness against Bias","num_papers_in_archive":2},{"url":"/dataset/advsuffixes","name":"AdvSuffixes","full_name":"Adversarial Suffixes","num_papers_in_archive":1},{"url":"/dataset/osn-transmission-mini-celeba","name":"OSN-transmission_mini_CelebA","full_name":"","num_papers_in_archive":1},{"url":"/dataset/shadr","name":"SHADR","full_name":"sythetic SDoH Human Annotated Demographic Robustness dataset (SHADR)","num_papers_in_archive":1},{"url":"/dataset/speech-robust-bench","name":"Speech Robust Bench","full_name":"","num_papers_in_archive":1}],"subtasks":[],"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":18,"rows_per_page":100,"shown":100,"of":1746,"of_with_code":788,"tagged_in_all":1746,"counts":{"archive_papers_tagged":1746,"with_a_code_link":788,"where_syntology_ran_a_sample":261,"not_listed_spam_title":0,"listed":1746,"listed_where_code_ran":261,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":204,"every_run_a_failure_of_syntologys_instrument":57,"listed_with_a_run_with_no_instrument_failure":204,"listed_every_run_a_failure_of_syntologys_instrument":57,"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/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/generating-adversarial-examples-with","slug":"generating-adversarial-examples-with","title":"Generating Adversarial Examples with Adversarial Networks","date":"2018-01-08","arxiv_id":"1801.02610","repositories_listed":10,"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/reliable-evaluation-of-adversarial-robustness","slug":"reliable-evaluation-of-adversarial-robustness","title":"Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks","date":"2020-03-03","arxiv_id":"2003.01690","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reliable-evaluation-of-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2003.01690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01690"}},"official":{"repos":["fra31/auto-attack","max-andr/square-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/robustness-may-be-at-odds-with-accuracy","slug":"robustness-may-be-at-odds-with-accuracy","title":"Robustness May Be at Odds with Accuracy","date":"2018-05-30","arxiv_id":"1805.12152","repositories_listed":8,"syntology":null},{"url":"/paper/fixing-data-augmentation-to-improve","slug":"fixing-data-augmentation-to-improve","title":"Fixing Data Augmentation to Improve Adversarial Robustness","date":"2021-03-02","arxiv_id":"2103.01946","repositories_listed":7,"syntology":null},{"url":"/paper/adversarial-robustness-toolbox-v040","slug":"adversarial-robustness-toolbox-v040","title":"Adversarial Robustness Toolbox v1.0.0","date":"2018-07-03","arxiv_id":"1807.01069","repositories_listed":7,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via","slug":"improving-adversarial-robustness-via","title":"Improving Adversarial Robustness via Promoting Ensemble Diversity","date":"2019-01-25","arxiv_id":"1901.08846","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-adversarial-robustness-via#ran","syntology_url":"https://syntology.ai/paper/1901.08846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08846"}},"official":{"repos":["P2333/Adaptive-Diversity-Promoting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ead-elastic-net-attacks-to-deep-neural","slug":"ead-elastic-net-attacks-to-deep-neural","title":"EAD: Elastic-Net Attacks to Deep Neural Networks via Adversarial Examples","date":"2017-09-13","arxiv_id":"1709.04114","repositories_listed":6,"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/ead-elastic-net-attacks-to-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1709.04114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.04114"}},"official":{"repos":["ysharma1126/EAD-Attack"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/provably-bounding-neural-network-preimages-1","slug":"provably-bounding-neural-network-preimages-1","title":"Provably Bounding Neural Network Preimages","date":"2023-02-02","arxiv_id":"2302.01404","repositories_listed":5,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"0 ran · 6 unverified","sample_list":"/paper/provably-bounding-neural-network-preimages-1#ran","syntology_url":"https://syntology.ai/paper/2302.01404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01404"}},"official":{"repos":["kothasuhas/verify-input"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/190600945","slug":"190600945","title":"Adversarial Robustness as a Prior for Learned Representations","date":"2019-06-03","arxiv_id":"1906.00945","repositories_listed":5,"syntology":null},{"url":"/paper/improving-alignment-and-robustness-with-short","slug":"improving-alignment-and-robustness-with-short","title":"Improving Alignment and Robustness with Circuit Breakers","date":"2024-06-06","arxiv_id":"2406.04313","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/improving-alignment-and-robustness-with-short#ran","syntology_url":"https://syntology.ai/paper/2406.04313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04313"}},"official":{"repos":["blackswan-ai/circuit-breakers","blackswan-ai/short-circuiting","grayswanai/circuit-breakers"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"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/demystifying-self-supervised-trojan-attacks","slug":"demystifying-self-supervised-trojan-attacks","title":"An Embarrassingly Simple Backdoor Attack on Self-supervised Learning","date":"2022-10-13","arxiv_id":"2210.07346","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/demystifying-self-supervised-trojan-attacks#ran","syntology_url":"https://syntology.ai/paper/2210.07346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07346"}},"official":{"repos":["meet-cjli/ctrl","CCCjiang/CTRL"],"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/uncovering-the-limits-of-adversarial-training","slug":"uncovering-the-limits-of-adversarial-training","title":"Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examples","date":"2020-10-07","arxiv_id":"2010.03593","repositories_listed":4,"syntology":null},{"url":"/paper/unlabeled-data-improves-adversarial","slug":"unlabeled-data-improves-adversarial","title":"Unlabeled Data Improves Adversarial Robustness","date":"2019-05-31","arxiv_id":"1905.13736","repositories_listed":4,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/unlabeled-data-improves-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.13736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13736"}},"official":{"repos":["yaircarmon/semisup-adv","worksheets.codalab.org/worksheets/0x9df253b24dac4a2b930108be9c6e5496"],"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/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/s-zero-gradient-based-optimization-of-ell-0","slug":"s-zero-gradient-based-optimization-of-ell-0","title":"$σ$-zero: Gradient-based Optimization of $\\ell_0$-norm Adversarial Examples","date":"2024-02-02","arxiv_id":"2402.01879","repositories_listed":3,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":13,"phrase":"10 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; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/s-zero-gradient-based-optimization-of-ell-0#ran","syntology_url":"https://syntology.ai/paper/2402.01879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01879"}},"official":{"repos":["cinofix/sigma-zero-adversarial-attack","jeromerony/adversarial-library","sigma0-advx/sigma-zero"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"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/certified-adversarial-robustness-for-free","slug":"certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","arxiv_id":"2206.10550","repositories_listed":3,"syntology":{"n":34,"n_ran":28,"n_constructed":0,"n_ran_checked":15,"n_instrument":13,"n_unverified":6,"n_honours":4,"n_violates":0,"n_no_contract":11,"n_pointer_only":13,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 13 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/certified-adversarial-robustness-for-free#ran","syntology_url":"https://syntology.ai/paper/2206.10550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10550"}},"official":{"repos":["ethz-privsec/diffusion_denoised_smoothing"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fednest-federated-bilevel-minimax-and","slug":"fednest-federated-bilevel-minimax-and","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","date":"2022-05-04","arxiv_id":"2205.02215","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fednest-federated-bilevel-minimax-and#ran","syntology_url":"https://syntology.ai/paper/2205.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02215"}},"official":{"repos":["ucr-optml/FedNest"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/pdpgd-primal-dual-proximal-gradient-descent","slug":"pdpgd-primal-dual-proximal-gradient-descent","title":"PDPGD: Primal-Dual Proximal Gradient Descent Adversarial Attack","date":"2021-06-03","arxiv_id":"2106.01538","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pdpgd-primal-dual-proximal-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2106.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01538"}},"official":{"repos":["aam-at/cpgd"],"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/fast-minimum-norm-adversarial-attacks-through","slug":"fast-minimum-norm-adversarial-attacks-through","title":"Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraints","date":"2021-02-25","arxiv_id":"2102.12827","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/fast-minimum-norm-adversarial-attacks-through#ran","syntology_url":"https://syntology.ai/paper/2102.12827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12827"}},"official":{"repos":["pralab/Fast-Minimum-Norm-FMN-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/bridging-mode-connectivity-in-loss-landscapes-1","slug":"bridging-mode-connectivity-in-loss-landscapes-1","title":"Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness","date":"2020-04-30","arxiv_id":"2005.00060","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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","sample_list":"/paper/bridging-mode-connectivity-in-loss-landscapes-1#ran","syntology_url":"https://syntology.ai/paper/2005.00060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00060"}},"official":{"repos":["IBM/model-sanitization"],"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"]}}},{"url":"/paper/revisiting-loss-landscape-for-adversarial","slug":"revisiting-loss-landscape-for-adversarial","title":"Adversarial Weight Perturbation Helps Robust Generalization","date":"2020-04-13","arxiv_id":"2004.05884","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-loss-landscape-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2004.05884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05884"}},"official":{"repos":["csdongxian/AWP","fra31/auto-attack"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["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/interpolated-adversarial-training-achieving","slug":"interpolated-adversarial-training-achieving","title":"Interpolated Adversarial Training: Achieving Robust Neural Networks without Sacrificing Too Much Accuracy","date":"2019-06-16","arxiv_id":"1906.06784","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpolated-adversarial-training-achieving#ran","syntology_url":"https://syntology.ai/paper/1906.06784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06784"}},"official":null}},{"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/second-order-adversarial-attack-and","slug":"second-order-adversarial-attack-and","title":"Certified Adversarial Robustness with Additive Noise","date":"2018-09-10","arxiv_id":"1809.03113","repositories_listed":3,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/second-order-adversarial-attack-and#ran","syntology_url":"https://syntology.ai/paper/1809.03113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03113"}},"official":{"repos":["Bai-Li/STN-Code"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/genattack-practical-black-box-attacks-with","slug":"genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","arxiv_id":"1805.11090","repositories_listed":3,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/genattack-practical-black-box-attacks-with#ran","syntology_url":"https://syntology.ai/paper/1805.11090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11090"}},"official":{"repos":["nesl/adversarial_genattack"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-the-first-adversarially-robust-neural","slug":"towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","arxiv_id":"1805.09190","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-the-first-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/1805.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09190"}},"official":null}},{"url":"/paper/patchguard-adversarially-robust-anomaly-1","slug":"patchguard-adversarially-robust-anomaly-1","title":"PatchGuard: Adversarially Robust Anomaly Detection and Localization through Vision Transformers and Pseudo Anomalies","date":"2025-06-10","arxiv_id":"2506.09237","repositories_listed":2,"syntology":null},{"url":"/paper/towards-optimal-adversarial-robust","slug":"towards-optimal-adversarial-robust","title":"Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error","date":"2025-02-23","arxiv_id":"2502.16734","repositories_listed":2,"syntology":null},{"url":"/paper/an-adaptive-orthogonal-convolution-scheme-for","slug":"an-adaptive-orthogonal-convolution-scheme-for","title":"An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architectures","date":"2025-01-14","arxiv_id":"2501.07930","repositories_listed":2,"syntology":null},{"url":"/paper/towards-physically-realizable-adversarial","slug":"towards-physically-realizable-adversarial","title":"Towards Physically Realizable Adversarial Attacks in Embodied Vision Navigation","date":"2024-09-16","arxiv_id":"2409.10071","repositories_listed":2,"syntology":null},{"url":"/paper/padetbench-towards-benchmarking-physical","slug":"padetbench-towards-benchmarking-physical","title":"PADetBench: Towards Benchmarking Physical Attacks against Object Detection","date":"2024-08-17","arxiv_id":"2408.09181","repositories_listed":2,"syntology":null},{"url":"/paper/ensemble-everything-everywhere-multi-scale","slug":"ensemble-everything-everywhere-multi-scale","title":"Ensemble everything everywhere: Multi-scale aggregation for adversarial robustness","date":"2024-08-08","arxiv_id":"2408.05446","repositories_listed":2,"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":3,"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/ensemble-everything-everywhere-multi-scale#ran","syntology_url":"https://syntology.ai/paper/2408.05446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05446"}},"official":{"repos":["stanislavfort/ensemble-everything-everywhere"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/an-unsupervised-approach-to-achieve","slug":"an-unsupervised-approach-to-achieve","title":"An Unsupervised Approach to Achieve Supervised-Level Explainability in Healthcare Records","date":"2024-06-13","arxiv_id":"2406.08958","repositories_listed":2,"syntology":null},{"url":"/paper/universal-adversarial-perturbations-for-3","slug":"universal-adversarial-perturbations-for-3","title":"Universal Adversarial Perturbations for Vision-Language Pre-trained Models","date":"2024-05-09","arxiv_id":"2405.05524","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/universal-adversarial-perturbations-for-3#ran","syntology_url":"https://syntology.ai/paper/2405.05524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.05524"}},"official":null}},{"url":"/paper/alert-a-comprehensive-benchmark-for-assessing","slug":"alert-a-comprehensive-benchmark-for-assessing","title":"ALERT: A Comprehensive Benchmark for Assessing Large Language Models' Safety through Red Teaming","date":"2024-04-06","arxiv_id":"2404.08676","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-fine-tuning-of-compressed-neural","slug":"adversarial-fine-tuning-of-compressed-neural","title":"Adversarial Fine-tuning of Compressed Neural Networks for Joint Improvement of Robustness and Efficiency","date":"2024-03-14","arxiv_id":"2403.09441","repositories_listed":2,"syntology":null},{"url":"/paper/towards-optimal-adversarial-robust-q-learning","slug":"towards-optimal-adversarial-robust-q-learning","title":"Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error","date":"2024-02-03","arxiv_id":"2402.02165","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"7 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-optimal-adversarial-robust-q-learning#ran","syntology_url":"https://syntology.ai/paper/2402.02165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02165"}},"official":{"repos":["leoranlmia/CAR-DQN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/authorship-obfuscation-in-multilingual","slug":"authorship-obfuscation-in-multilingual","title":"Authorship Obfuscation in Multilingual Machine-Generated Text Detection","date":"2024-01-15","arxiv_id":"2401.07867","repositories_listed":2,"syntology":null},{"url":"/paper/scar-scaling-adversarial-robustness-for-lidar","slug":"scar-scaling-adversarial-robustness-for-lidar","title":"ScAR: Scaling Adversarial Robustness for LiDAR Object Detection","date":"2023-12-05","arxiv_id":"2312.03085","repositories_listed":2,"syntology":null},{"url":"/paper/oodrobustbench-benchmarking-and-analyzing","slug":"oodrobustbench-benchmarking-and-analyzing","title":"OODRobustBench: a Benchmark and Large-Scale Analysis of Adversarial Robustness under Distribution Shift","date":"2023-10-19","arxiv_id":"2310.12793","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/oodrobustbench-benchmarking-and-analyzing#ran","syntology_url":"https://syntology.ai/paper/2310.12793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12793"}},"official":{"repos":["oodrobustbench/oodrobustbench"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/j-guard-journalism-guided-adversarially","slug":"j-guard-journalism-guided-adversarially","title":"J-Guard: Journalism Guided Adversarially Robust Detection of AI-generated News","date":"2023-09-06","arxiv_id":"2309.03164","repositories_listed":2,"syntology":null},{"url":"/paper/prediction-without-preclusion-recourse","slug":"prediction-without-preclusion-recourse","title":"Prediction without Preclusion: Recourse Verification with Reachable Sets","date":"2023-08-24","arxiv_id":"2308.12820","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-modsecurity-countering","slug":"adversarial-modsecurity-countering","title":"ModSec-AdvLearn: Countering Adversarial SQL Injections with Robust Machine Learning","date":"2023-08-09","arxiv_id":"2308.04964","repositories_listed":2,"syntology":null},{"url":"/paper/robust-semantic-segmentation-strong","slug":"robust-semantic-segmentation-strong","title":"Towards Reliable Evaluation and Fast Training of Robust Semantic Segmentation Models","date":"2023-06-22","arxiv_id":"2306.12941","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-semantic-segmentation-strong#ran","syntology_url":"https://syntology.ai/paper/2306.12941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12941"}},"official":{"repos":["nmndeep/robust-segmentation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/red-teaming-language-model-detectors-with","slug":"red-teaming-language-model-detectors-with","title":"Red Teaming Language Model Detectors with Language Models","date":"2023-05-31","arxiv_id":"2305.19713","repositories_listed":2,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/red-teaming-language-model-detectors-with#ran","syntology_url":"https://syntology.ai/paper/2305.19713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19713"}},"official":{"repos":["shizhouxing/Attack-LM-Detectors"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/robustness-implies-fairness-in-casual","slug":"robustness-implies-fairness-in-casual","title":"Robustness Implies Fairness in Causal Algorithmic Recourse","date":"2023-02-07","arxiv_id":"2302.03465","repositories_listed":2,"syntology":null},{"url":"/paper/exploring-and-exploiting-decision-boundary","slug":"exploring-and-exploiting-decision-boundary","title":"Exploring and Exploiting Decision Boundary Dynamics for Adversarial Robustness","date":"2023-02-06","arxiv_id":"2302.03015","repositories_listed":2,"syntology":{"n":12,"n_ran":4,"n_constructed":2,"n_ran_checked":4,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/exploring-and-exploiting-decision-boundary#ran","syntology_url":"https://syntology.ai/paper/2302.03015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03015"}},"official":{"repos":["yuancheng-xu/dynamics-aware-robust-training"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/cospgd-a-unified-white-box-adversarial-attack","slug":"cospgd-a-unified-white-box-adversarial-attack","title":"CosPGD: an efficient white-box adversarial attack for pixel-wise prediction tasks","date":"2023-02-04","arxiv_id":"2302.02213","repositories_listed":2,"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":2,"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/cospgd-a-unified-white-box-adversarial-attack#ran","syntology_url":"https://syntology.ai/paper/2302.02213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02213"}},"official":{"repos":["shashankskagnihotri/adv-corrected-ddcat-cospgd","shashankskagnihotri/cospgd"],"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/improving-the-accuracy-robustness-trade-off","slug":"improving-the-accuracy-robustness-trade-off","title":"Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing","date":"2023-01-29","arxiv_id":"2301.12554","repositories_listed":2,"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/improving-the-accuracy-robustness-trade-off#ran","syntology_url":"https://syntology.ai/paper/2301.12554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12554"}},"official":{"repos":["bai-yt/adaptivesmoothing"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-zero-shot-adversarial","slug":"understanding-zero-shot-adversarial","title":"Understanding Zero-Shot Adversarial Robustness for Large-Scale Models","date":"2022-12-14","arxiv_id":"2212.07016","repositories_listed":2,"syntology":null},{"url":"/paper/robust-lottery-tickets-for-pre-trained-1","slug":"robust-lottery-tickets-for-pre-trained-1","title":"Robust Lottery Tickets for Pre-trained Language Models","date":"2022-11-06","arxiv_id":"2211.03013","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/adversarial-robustness-of-representation","slug":"adversarial-robustness-of-representation","title":"Adversarial Robustness of Representation Learning for Knowledge Graphs","date":"2022-09-30","arxiv_id":"2210.00122","repositories_listed":2,"syntology":null},{"url":"/paper/decoupled-adversarial-contrastive-learning","slug":"decoupled-adversarial-contrastive-learning","title":"Decoupled Adversarial Contrastive Learning for Self-supervised Adversarial Robustness","date":"2022-07-22","arxiv_id":"2207.10899","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/decoupled-adversarial-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2207.10899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10899"}},"official":{"repos":["pantheon5100/deacl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/flatten-the-curve-efficiently-training-low","slug":"flatten-the-curve-efficiently-training-low","title":"Efficiently Training Low-Curvature Neural Networks","date":"2022-06-14","arxiv_id":"2206.07144","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flatten-the-curve-efficiently-training-low#ran","syntology_url":"https://syntology.ai/paper/2206.07144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07144"}},"official":{"repos":["kylematoba/lcnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/flooding-x-improving-berts-resistance-to","slug":"flooding-x-improving-berts-resistance-to","title":"Flooding-X: Improving BERT’s Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning","date":"2022-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-adversarial-robustness-for-deep","slug":"enhancing-adversarial-robustness-for-deep","title":"Enhancing Adversarial Robustness for Deep Metric Learning","date":"2022-03-02","arxiv_id":"2203.01439","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/enhancing-adversarial-robustness-for-deep#ran","syntology_url":"https://syntology.ai/paper/2203.01439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01439"}},"official":{"repos":["cdluminate/robdml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-real-world-adversarial-robustness-of","slug":"on-the-real-world-adversarial-robustness-of","title":"On the Real-World Adversarial Robustness of Real-Time Semantic Segmentation Models for Autonomous Driving","date":"2022-01-05","arxiv_id":"2201.01850","repositories_listed":2,"syntology":null},{"url":"/paper/pixmix-dreamlike-pictures-comprehensively","slug":"pixmix-dreamlike-pictures-comprehensively","title":"PixMix: Dreamlike Pictures Comprehensively Improve Safety Measures","date":"2021-12-09","arxiv_id":"2112.05135","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":2,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 2 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pixmix-dreamlike-pictures-comprehensively#ran","syntology_url":"https://syntology.ai/paper/2112.05135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05135"}},"official":{"repos":["andyzoujm/pixmix"],"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":["listed","official","unlocated"]}}},{"url":"/paper/is-robustbench-autoattack-a-suitable","slug":"is-robustbench-autoattack-a-suitable","title":"Is RobustBench/AutoAttack a suitable Benchmark for Adversarial Robustness?","date":"2021-12-02","arxiv_id":"2112.01601","repositories_listed":2,"syntology":null},{"url":"/paper/when-does-contrastive-learning-preserve","slug":"when-does-contrastive-learning-preserve","title":"When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?","date":"2021-11-01","arxiv_id":"2111.01124","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-does-contrastive-learning-preserve#ran","syntology_url":"https://syntology.ai/paper/2111.01124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01124"}},"official":{"repos":["lijiefan/advcl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/katana-simple-post-training-robustness-using","slug":"katana-simple-post-training-robustness-using","title":"Simple Post-Training Robustness Using Test Time Augmentations and Random Forest","date":"2021-09-16","arxiv_id":"2109.08191","repositories_listed":2,"syntology":null},{"url":"/paper/are-socially-aware-trajectory-prediction","slug":"are-socially-aware-trajectory-prediction","title":"Are socially-aware trajectory prediction models really socially-aware?","date":"2021-08-24","arxiv_id":"2108.10879","repositories_listed":2,"syntology":null},{"url":"/paper/wavecnet-wavelet-integrated-cnns-to-suppress","slug":"wavecnet-wavelet-integrated-cnns-to-suppress","title":"WaveCNet: Wavelet Integrated CNNs to Suppress Aliasing Effect for Noise-Robust Image Classification","date":"2021-07-28","arxiv_id":"2107.13335","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/wavecnet-wavelet-integrated-cnns-to-suppress#ran","syntology_url":"https://syntology.ai/paper/2107.13335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13335"}},"official":{"repos":["LiQiufu/WaveCNet","CVI-SZU/WaveCNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"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/indicators-of-attack-failure-debugging-and","slug":"indicators-of-attack-failure-debugging-and","title":"Indicators of Attack Failure: Debugging and Improving Optimization of Adversarial Examples","date":"2021-06-18","arxiv_id":"2106.09947","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/indicators-of-attack-failure-debugging-and#ran","syntology_url":"https://syntology.ai/paper/2106.09947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09947"}},"official":{"repos":["pralab/IndicatorsOfAttackFailure"],"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":["official"]}}},{"url":"/paper/adversarial-visual-robustness-by-causal","slug":"adversarial-visual-robustness-by-causal","title":"Adversarial Visual Robustness by Causal Intervention","date":"2021-06-17","arxiv_id":"2106.09534","repositories_listed":2,"syntology":null},{"url":"/paper/reliable-adversarial-distillation-with","slug":"reliable-adversarial-distillation-with","title":"Reliable Adversarial Distillation with Unreliable Teachers","date":"2021-06-09","arxiv_id":"2106.04928","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/reliable-adversarial-distillation-with#ran","syntology_url":"https://syntology.ai/paper/2106.04928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04928"}},"official":{"repos":["zfancy/iad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-adversarial-robustness-using-proxy","slug":"improving-adversarial-robustness-using-proxy","title":"Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?","date":"2021-04-19","arxiv_id":"2104.09425","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/improving-adversarial-robustness-using-proxy#ran","syntology_url":"https://syntology.ai/paper/2104.09425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09425"}},"official":{"repos":["inspire-group/proxy-distributions"],"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/claimed-a-visual-and-scalable-component","slug":"claimed-a-visual-and-scalable-component","title":"CLAIMED, a visual and scalable component library for Trusted AI","date":"2021-03-04","arxiv_id":"2103.03281","repositories_listed":2,"syntology":null},{"url":"/paper/mind-the-box-l-1-apgd-for-sparse-adversarial","slug":"mind-the-box-l-1-apgd-for-sparse-adversarial","title":"Mind the box: $l_1$-APGD for sparse adversarial attacks on image classifiers","date":"2021-03-01","arxiv_id":"2103.01208","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":1,"n_instrument":9,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 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; 9 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mind-the-box-l-1-apgd-for-sparse-adversarial#ran","syntology_url":"https://syntology.ai/paper/2103.01208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01208"}},"official":{"repos":["fra31/auto-attack","jeromerony/adversarial-library"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cifs-improving-adversarial-robustness-of-cnns","slug":"cifs-improving-adversarial-robustness-of-cnns","title":"CIFS: Improving Adversarial Robustness of CNNs via Channel-wise Importance-based Feature Selection","date":"2021-02-10","arxiv_id":"2102.05311","repositories_listed":2,"syntology":null},{"url":"/paper/spade-a-spectral-method-for-black-box","slug":"spade-a-spectral-method-for-black-box","title":"SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation","date":"2021-02-07","arxiv_id":"2102.03716","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-robustness-study-of-convolutional","slug":"adversarial-robustness-study-of-convolutional","title":"Adversarial Robustness Study of Convolutional Neural Network for Lumbar Disk Shape Reconstruction from MR images","date":"2021-02-04","arxiv_id":"2102.02885","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/learn-robust-features-via-orthogonal-multi-1","slug":"learn-robust-features-via-orthogonal-multi-1","title":"Towards Robust Neural Networks via Orthogonal Diversity","date":"2020-10-23","arxiv_id":"2010.12190","repositories_listed":2,"syntology":null},{"url":"/paper/bag-of-tricks-for-adversarial-training","slug":"bag-of-tricks-for-adversarial-training","title":"Bag of Tricks for Adversarial Training","date":"2020-10-01","arxiv_id":"2010.00467","repositories_listed":2,"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/bag-of-tricks-for-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2010.00467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00467"}},"official":{"repos":["P2333/Bag-of-Tricks-for-AT","fra31/auto-attack"],"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":["official","unlocated"]}}},{"url":"/paper/a-deep-dive-into-adversarial-robustness-in","slug":"a-deep-dive-into-adversarial-robustness-in","title":"A Deep Dive into Adversarial Robustness in Zero-Shot Learning","date":"2020-08-17","arxiv_id":"2008.07651","repositories_listed":2,"syntology":null},{"url":"/paper/provable-worst-case-guarantees-for-the","slug":"provable-worst-case-guarantees-for-the","title":"Certifiably Adversarially Robust Detection of Out-of-Distribution Data","date":"2020-07-16","arxiv_id":"2007.08473","repositories_listed":2,"syntology":null},{"url":"/paper/delving-into-the-adversarial-robustness-on","slug":"delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","arxiv_id":"2007.04118","repositories_listed":2,"syntology":{"n":23,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/delving-into-the-adversarial-robustness-on#ran","syntology_url":"https://syntology.ai/paper/2007.04118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04118"}},"official":{"repos":["ShawnXYang/Face-Robustness-Benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/biologically-inspired-mechanisms-for","slug":"biologically-inspired-mechanisms-for","title":"Biologically Inspired Mechanisms for Adversarial Robustness","date":"2020-06-29","arxiv_id":"2006.16427","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/achieving-robustness-in-classification-using","slug":"achieving-robustness-in-classification-using","title":"Achieving robustness in classification using optimal transport with hinge regularization","date":"2020-06-11","arxiv_id":"2006.06520","repositories_listed":2,"syntology":null},{"url":"/paper/a-self-supervised-approach-for-adversarial-1","slug":"a-self-supervised-approach-for-adversarial-1","title":"A Self-supervised Approach for Adversarial Robustness","date":"2020-06-08","arxiv_id":"2006.04924","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-self-supervised-approach-for-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2006.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04924"}},"official":{"repos":["Muzammal-Naseer/NRP"],"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":["listed","official"]}}},{"url":"/paper/adversarial-robustness-of-deep-convolutional","slug":"adversarial-robustness-of-deep-convolutional","title":"Adversarial Robustness of Deep Convolutional Candlestick Learner","date":"2020-05-29","arxiv_id":"2006.03686","repositories_listed":2,"syntology":null},{"url":"/paper/improve-robustness-of-dnn-for-ecg-signal","slug":"improve-robustness-of-dnn-for-ecg-signal","title":"Improve robustness of DNN for ECG signal classification:a noise-to-signal ratio perspective","date":"2020-05-18","arxiv_id":"2005.09134","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improve-robustness-of-dnn-for-ecg-signal#ran","syntology_url":"https://syntology.ai/paper/2005.09134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09134"}},"official":{"repos":["SarielMa/ICLR2020_AI4AH"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-adversarial-robustness-requires","slug":"improving-adversarial-robustness-requires","title":"Improving Adversarial Robustness Requires Revisiting Misclassified Examples","date":"2020-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-examples-and-where-to-find-them","slug":"adversarial-examples-and-where-to-find-them","title":"How to compare adversarial robustness of classifiers from a global perspective","date":"2020-04-22","arxiv_id":"2004.10882","repositories_listed":2,"syntology":null},{"url":"/paper/approximate-manifold-defense-against-multiple","slug":"approximate-manifold-defense-against-multiple","title":"Approximate Manifold Defense Against Multiple Adversarial Perturbations","date":"2020-04-05","arxiv_id":"2004.02183","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/approximate-manifold-defense-against-multiple#ran","syntology_url":"https://syntology.ai/paper/2004.02183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02183"}},"official":{"repos":["jayjaynandy/RBF-CNN"],"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/architectural-resilience-to-foreground-and","slug":"architectural-resilience-to-foreground-and","title":"Architectural Resilience to Foreground-and-Background Adversarial Noise","date":"2020-03-23","arxiv_id":"2003.10045","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-vertex-mixup-toward-better","slug":"adversarial-vertex-mixup-toward-better","title":"Adversarial Vertex Mixup: Toward Better Adversarially Robust Generalization","date":"2020-03-05","arxiv_id":"2003.02484","repositories_listed":2,"syntology":null},{"url":"/paper/learning-adversarially-robust-representations","slug":"learning-adversarially-robust-representations","title":"Learning Adversarially Robust Representations via Worst-Case Mutual Information Maximization","date":"2020-02-26","arxiv_id":"2002.11798","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/learning-adversarially-robust-representations#ran","syntology_url":"https://syntology.ai/paper/2002.11798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11798"}},"official":{"repos":["schzhu/learning-adversarially-robust-representations"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/polynomial-optimization-for-bounding","slug":"polynomial-optimization-for-bounding","title":"Semialgebraic Optimization for Lipschitz Constants of ReLU Networks","date":"2020-02-10","arxiv_id":"2002.03657","repositories_listed":2,"syntology":null}],"syntology_records":51,"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-robustness-on-cifar-10","since_archive":"/sota/adversarial-robustness-on-cifar-10#since-judged","papers_judged":4,"placed":0}]},"papers_where_code_ran":261,"papers_where_code_ran_first_page":"/task/adversarial-robustness/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":18,"url":"/task/adversarial-robustness/papers/2","json":"/task/adversarial-robustness/papers/2.json","rows":100},{"order":"archive","page":3,"of":18,"url":"/task/adversarial-robustness/papers/3","json":"/task/adversarial-robustness/papers/3.json","rows":100},{"order":"archive","page":4,"of":18,"url":"/task/adversarial-robustness/papers/4","json":"/task/adversarial-robustness/papers/4.json","rows":100},{"order":"archive","page":5,"of":18,"url":"/task/adversarial-robustness/papers/5","json":"/task/adversarial-robustness/papers/5.json","rows":100},{"order":"archive","page":6,"of":18,"url":"/task/adversarial-robustness/papers/6","json":"/task/adversarial-robustness/papers/6.json","rows":100},{"order":"archive","page":7,"of":18,"url":"/task/adversarial-robustness/papers/7","json":"/task/adversarial-robustness/papers/7.json","rows":100},{"order":"archive","page":8,"of":18,"url":"/task/adversarial-robustness/papers/8","json":"/task/adversarial-robustness/papers/8.json","rows":100},{"order":"archive","page":9,"of":18,"url":"/task/adversarial-robustness/papers/9","json":"/task/adversarial-robustness/papers/9.json","rows":100},{"order":"archive","page":10,"of":18,"url":"/task/adversarial-robustness/papers/10","json":"/task/adversarial-robustness/papers/10.json","rows":100},{"order":"archive","page":11,"of":18,"url":"/task/adversarial-robustness/papers/11","json":"/task/adversarial-robustness/papers/11.json","rows":100},{"order":"archive","page":12,"of":18,"url":"/task/adversarial-robustness/papers/12","json":"/task/adversarial-robustness/papers/12.json","rows":100},{"order":"archive","page":13,"of":18,"url":"/task/adversarial-robustness/papers/13","json":"/task/adversarial-robustness/papers/13.json","rows":100},{"order":"archive","page":14,"of":18,"url":"/task/adversarial-robustness/papers/14","json":"/task/adversarial-robustness/papers/14.json","rows":100},{"order":"archive","page":15,"of":18,"url":"/task/adversarial-robustness/papers/15","json":"/task/adversarial-robustness/papers/15.json","rows":100},{"order":"archive","page":16,"of":18,"url":"/task/adversarial-robustness/papers/16","json":"/task/adversarial-robustness/papers/16.json","rows":100},{"order":"archive","page":17,"of":18,"url":"/task/adversarial-robustness/papers/17","json":"/task/adversarial-robustness/papers/17.json","rows":100},{"order":"archive","page":18,"of":18,"url":"/task/adversarial-robustness/papers/18","json":"/task/adversarial-robustness/papers/18.json","rows":46},{"order":"ran","page":1,"of":3,"url":"/task/adversarial-robustness/papers/ran/1","json":"/task/adversarial-robustness/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/adversarial-robustness/papers/ran/2","json":"/task/adversarial-robustness/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/adversarial-robustness/papers/ran/3","json":"/task/adversarial-robustness/papers/ran/3.json","rows":61}],"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":"46e2c28390a05d2a547b57213e91455a8c4560ebbbf4518f1e8135059f227868","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}