{"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-attack","name":"Adversarial Attack","slug":"adversarial-attack","description_markdown":"An **Adversarial Attack** is a technique to find a perturbation that changes the prediction of a machine learning model. The perturbation can be very small and imperceptible to human eyes.\n\n\n<span class=\"description-source\">Source: [Recurrent Attention Model with Log-Polar Mapping is Robust against Adversarial Attacks ](https://arxiv.org/abs/2002.05388)</span>","categories":[{"name":"Adversarial","url":"/area/adversarial"},{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1808,"papers_with_code":745,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"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":11,"subtasks":4,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/adversarial-attack-on-cifar-10","slug":"adversarial-attack-on-cifar-10","dataset":"CIFAR-10","dataset_url":"/dataset/cifar-10","rows_in_archive":6,"metrics":["Attack: PGD20","Attack: AutoAttack","Attack: DeepFool","Robust Accuracy"],"first_row_in_archive_order":{"model":"Xu et al.","paper_title":"An Orthogonal Classifier for Improving the Adversarial Robustness of Neural Networks","paper_url":"/paper/an-orthogonal-classifier-for-improving-the","paper_date":"2021-05-19","arxiv_id":"2105.09109","code_links":[{"title":"MTandHJ/roboc","url":"https://github.com/MTandHJ/roboc"}],"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/an-orthogonal-classifier-for-improving-the#ran","syntology_url":"https://syntology.ai/paper/2105.09109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09109"}},"official":{"repos":["MTandHJ/roboc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/adversarial-attack-on-cifar-100","slug":"adversarial-attack-on-cifar-100","dataset":"CIFAR-100","dataset_url":"/dataset/cifar-100","rows_in_archive":2,"metrics":["Attack: AutoAttack"],"first_row_in_archive_order":{"model":"3-ensemble of multi-resolution self-ensembles","paper_title":"Ensemble everything everywhere: Multi-scale aggregation for adversarial robustness","paper_url":"/paper/ensemble-everything-everywhere-multi-scale","paper_date":"2024-08-08","arxiv_id":"2408.05446","code_links":[{"title":"stanislavfort/ensemble-everything-everywhere","url":"https://github.com/stanislavfort/ensemble-everything-everywhere"},{"title":"ETH-DISCO/self-ensembling","url":"https://github.com/ETH-DISCO/self-ensembling"}],"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"]}}}},{"leaderboard":"/sota/adversarial-attack-on-wsj0-2mix","slug":"adversarial-attack-on-wsj0-2mix","dataset":"WSJ0-2mix","dataset_url":"/dataset/wsj0-2mix-1","rows_in_archive":1,"metrics":["SDR"],"first_row_in_archive_order":{"model":"ConvTasnet and Dual Path Transformers","paper_title":"Harmonicity Plays a Critical Role in DNN Based Versus in Biologically-Inspired Monaural Speech Segregation Systems","paper_url":"/paper/harmonicity-plays-a-critical-role-in-dnn","paper_date":"2022-03-08","arxiv_id":"2203.04420","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145},{"url":"/dataset/cifar-100","name":"CIFAR-100","full_name":"","num_papers_in_archive":9045},{"url":"/dataset/wsj0-2mix-1","name":"WSJ0-2mix","full_name":"","num_papers_in_archive":159},{"url":"/dataset/imagenet-p","name":"ImageNet-P","full_name":"","num_papers_in_archive":32},{"url":"/dataset/nas-bench-1shot1","name":"NAS-Bench-1Shot1","full_name":"","num_papers_in_archive":24},{"url":"/dataset/comma-2k19","name":"comma 2k19","full_name":"","num_papers_in_archive":11},{"url":"/dataset/tcab","name":"TCAB","full_name":"Text Classification Attack Benchmark","num_papers_in_archive":3},{"url":"/dataset/advsuffixes","name":"AdvSuffixes","full_name":"Adversarial Suffixes","num_papers_in_archive":1},{"url":"/dataset/cifar10mnist","name":"Cifar10Mnist","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pointcleannet","name":"PointDenoisingBenchmark","full_name":"","num_papers_in_archive":1},{"url":"/dataset/reap","name":"REAP","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/adversarial-attack-detection","name":"Adversarial Attack Detection"},{"url":"/task/adversarial-text","name":"Adversarial Text"},{"url":"/task/backdoor-attack","name":"Backdoor Attack"},{"url":"/task/real-world-adversarial-attack","name":"Real-World Adversarial Attack"}],"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":19,"rows_per_page":100,"shown":100,"of":1808,"of_with_code":745,"tagged_in_all":1808,"counts":{"archive_papers_tagged":1808,"with_a_code_link":745,"where_syntology_ran_a_sample":206,"not_listed_spam_title":0,"listed":1808,"listed_where_code_ran":206,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":158,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":158,"listed_every_run_a_failure_of_syntologys_instrument":48,"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/towards-evaluating-the-robustness-of-neural","slug":"towards-evaluating-the-robustness-of-neural","title":"Towards Evaluating the Robustness of Neural Networks","date":"2016-08-16","arxiv_id":"1608.04644","repositories_listed":27,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-evaluating-the-robustness-of-neural#ran","syntology_url":"https://syntology.ai/paper/1608.04644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.04644"}},"official":null}},{"url":"/paper/universal-and-transferable-adversarial","slug":"universal-and-transferable-adversarial","title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","date":"2023-07-27","arxiv_id":"2307.15043","repositories_listed":25,"syntology":{"n":61,"n_ran":39,"n_constructed":7,"n_ran_checked":19,"n_instrument":20,"n_unverified":22,"n_honours":4,"n_violates":1,"n_no_contract":14,"n_pointer_only":4,"phrase":"39 ran (of which 7 constructed an object rather than computing a result; 19 with no instrument failure: 4 honoured, 1 violated, 14 with no contract checked; 20 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/universal-and-transferable-adversarial#ran","syntology_url":"https://syntology.ai/paper/2307.15043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15043"}},"official":{"repos":["llm-attacks/llm-attacks"],"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":["listed","unlocated"]}}},{"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/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/score-camimproved-visual-explanations-via","slug":"score-camimproved-visual-explanations-via","title":"Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networks","date":"2019-10-03","arxiv_id":"1910.01279","repositories_listed":9,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/score-camimproved-visual-explanations-via#ran","syntology_url":"https://syntology.ai/paper/1910.01279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01279"}},"official":{"repos":["haofanwang/Score-CAM"],"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/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/deep-variational-information-bottleneck","slug":"deep-variational-information-bottleneck","title":"Deep Variational Information Bottleneck","date":"2016-12-01","arxiv_id":"1612.00410","repositories_listed":9,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"6 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-variational-information-bottleneck#ran","syntology_url":"https://syntology.ai/paper/1612.00410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.00410"}},"official":null}},{"url":"/paper/provable-defenses-against-adversarial","slug":"provable-defenses-against-adversarial","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","date":"2017-11-02","arxiv_id":"1711.00851","repositories_listed":8,"syntology":{"n":44,"n_ran":21,"n_constructed":15,"n_ran_checked":19,"n_instrument":2,"n_unverified":23,"n_honours":1,"n_violates":1,"n_no_contract":17,"n_pointer_only":2,"phrase":"21 ran (of which 15 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 1 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 23 unverified","sample_list":"/paper/provable-defenses-against-adversarial#ran","syntology_url":"https://syntology.ai/paper/1711.00851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.00851"}},"official":{"repos":["locuslab/convex_adversarial"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/boosting-adversarial-attacks-with-momentum","slug":"boosting-adversarial-attacks-with-momentum","title":"Boosting Adversarial Attacks with Momentum","date":"2017-10-17","arxiv_id":"1710.06081","repositories_listed":7,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boosting-adversarial-attacks-with-momentum#ran","syntology_url":"https://syntology.ai/paper/1710.06081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.06081"}},"official":{"repos":["dongyp13/Non-Targeted-Adversarial-Attacks","dongyp13/Targeted-Adversarial-Attack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/foolbox-a-python-toolbox-to-benchmark-the","slug":"foolbox-a-python-toolbox-to-benchmark-the","title":"Foolbox: A Python toolbox to benchmark the robustness of machine learning models","date":"2017-07-13","arxiv_id":"1707.04131","repositories_listed":7,"syntology":null},{"url":"/paper/beta-crown-efficient-bound-propagation-with","slug":"beta-crown-efficient-bound-propagation-with","title":"Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification","date":"2021-03-11","arxiv_id":"2103.06624","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beta-crown-efficient-bound-propagation-with#ran","syntology_url":"https://syntology.ai/paper/2103.06624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06624"}},"official":{"repos":["KaidiXu/Beta-CROWN","eth-sri/eran"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["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/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/trasw-tracklet-switch-adversarial-attacks","slug":"trasw-tracklet-switch-adversarial-attacks","title":"Tracklet-Switch Adversarial Attack against Pedestrian Multi-Object Tracking Trackers","date":"2021-11-17","arxiv_id":"2111.08954","repositories_listed":5,"syntology":null},{"url":"/paper/disrupting-deepfakes-adversarial-attacks","slug":"disrupting-deepfakes-adversarial-attacks","title":"Disrupting Deepfakes: Adversarial Attacks Against Conditional Image Translation Networks and Facial Manipulation Systems","date":"2020-03-03","arxiv_id":"2003.01279","repositories_listed":5,"syntology":null},{"url":"/paper/real-world-attack-on-mtcnn-face-detection","slug":"real-world-attack-on-mtcnn-face-detection","title":"Real-world adversarial attack on MTCNN face detection system","date":"2019-10-14","arxiv_id":"1910.06261","repositories_listed":5,"syntology":null},{"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/local-gradients-smoothing-defense-against","slug":"local-gradients-smoothing-defense-against","title":"Local Gradients Smoothing: Defense against localized adversarial attacks","date":"2018-07-03","arxiv_id":"1807.01216","repositories_listed":5,"syntology":null},{"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/understanding-the-vulnerability-of-skeleton","slug":"understanding-the-vulnerability-of-skeleton","title":"Understanding the Vulnerability of Skeleton-based Human Activity Recognition via Black-box Attack","date":"2022-11-21","arxiv_id":"2211.11312","repositories_listed":4,"syntology":null},{"url":"/paper/patch-wise-attack-for-fooling-deep-neural","slug":"patch-wise-attack-for-fooling-deep-neural","title":"Patch-wise Attack for Fooling Deep Neural Network","date":"2020-07-14","arxiv_id":"2007.06765","repositories_listed":4,"syntology":null},{"url":"/paper/bert-attack-adversarial-attack-against-bert","slug":"bert-attack-adversarial-attack-against-bert","title":"BERT-ATTACK: Adversarial Attack Against BERT Using BERT","date":"2020-04-21","arxiv_id":"2004.09984","repositories_listed":4,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bert-attack-adversarial-attack-against-bert#ran","syntology_url":"https://syntology.ai/paper/2004.09984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09984"}},"official":{"repos":["LinyangLee/BERT-Attack","QData/TextAttack"],"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":["found_in_text","unlocated"]}}},{"url":"/paper/advhat-real-world-adversarial-attack-on","slug":"advhat-real-world-adversarial-attack-on","title":"AdvHat: Real-world adversarial attack on ArcFace Face ID system","date":"2019-08-23","arxiv_id":"1908.08705","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/advhat-real-world-adversarial-attack-on#ran","syntology_url":"https://syntology.ai/paper/1908.08705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08705"}},"official":{"repos":["papermsucode/advhat"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["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/distributionally-adversarial-attack","slug":"distributionally-adversarial-attack","title":"Distributionally Adversarial Attack","date":"2018-08-16","arxiv_id":"1808.05537","repositories_listed":4,"syntology":null},{"url":"/paper/learn-to-pay-attention","slug":"learn-to-pay-attention","title":"Learn To Pay Attention","date":"2018-04-06","arxiv_id":"1804.02391","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/boosting-the-transferability-of-adversarial-2","slug":"boosting-the-transferability-of-adversarial-2","title":"Boosting the Transferability of Adversarial Attacks with Reverse Adversarial Perturbation","date":"2022-10-12","arxiv_id":"2210.05968","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/boosting-the-transferability-of-adversarial-2#ran","syntology_url":"https://syntology.ai/paper/2210.05968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05968"}},"official":{"repos":["sclbd/transfer_attack_rap","Alan-Qin/Transfer_attack_RAP"],"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/adversarial-laser-spot-robust-and-covert","slug":"adversarial-laser-spot-robust-and-covert","title":"Adversarial Laser Spot: Robust and Covert Physical-World Attack to DNNs","date":"2022-06-02","arxiv_id":"2206.01034","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-neural-network-analysis-with-sum-of","slug":"efficient-neural-network-analysis-with-sum-of","title":"Efficient Neural Network Analysis with Sum-of-Infeasibilities","date":"2022-03-19","arxiv_id":"2203.11201","repositories_listed":3,"syntology":null},{"url":"/paper/on-improving-adversarial-transferability-of","slug":"on-improving-adversarial-transferability-of","title":"On Improving Adversarial Transferability of Vision Transformers","date":"2021-06-08","arxiv_id":"2106.04169","repositories_listed":3,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/on-improving-adversarial-transferability-of#ran","syntology_url":"https://syntology.ai/paper/2106.04169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04169"}},"official":null}},{"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/spectraldefense-detecting-adversarial-attacks","slug":"spectraldefense-detecting-adversarial-attacks","title":"SpectralDefense: Detecting Adversarial Attacks on CNNs in the Fourier Domain","date":"2021-03-04","arxiv_id":"2103.03000","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/spectraldefense-detecting-adversarial-attacks#ran","syntology_url":"https://syntology.ai/paper/2103.03000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03000"}},"official":{"repos":["paulaharder/SpectralAdversarialDefense"],"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/adversarial-attacks-and-defenses-on-graphs-a","slug":"adversarial-attacks-and-defenses-on-graphs-a","title":"Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studies","date":"2020-03-02","arxiv_id":"2003.00653","repositories_listed":3,"syntology":null},{"url":"/paper/adversarial-ranking-attack-and-defense","slug":"adversarial-ranking-attack-and-defense","title":"Adversarial Ranking Attack and Defense","date":"2020-02-26","arxiv_id":"2002.11293","repositories_listed":3,"syntology":null},{"url":"/paper/advcodec-towards-a-unified-framework-for-1","slug":"advcodec-towards-a-unified-framework-for-1","title":"T3: Tree-Autoencoder Constrained Adversarial Text Generation for Targeted Attack","date":"2019-12-22","arxiv_id":"1912.10375","repositories_listed":3,"syntology":null},{"url":"/paper/adversarial-attacks-and-defenses-in-images","slug":"adversarial-attacks-and-defenses-in-images","title":"Adversarial Attacks and Defenses in Images, Graphs and Text: A Review","date":"2019-09-17","arxiv_id":"1909.08072","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/adversarial-attacks-and-defenses-in-images#ran","syntology_url":"https://syntology.ai/paper/1909.08072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08072"}},"official":null}},{"url":"/paper/nesterov-accelerated-gradient-and-scale","slug":"nesterov-accelerated-gradient-and-scale","title":"Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks","date":"2019-08-17","arxiv_id":"1908.06281","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/nesterov-accelerated-gradient-and-scale#ran","syntology_url":"https://syntology.ai/paper/1908.06281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06281"}},"official":{"repos":["JHL-HUST/SI-NI-FGSM"],"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/natural-adversarial-examples","slug":"natural-adversarial-examples","title":"Natural Adversarial Examples","date":"2019-07-16","arxiv_id":"1907.07174","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/natural-adversarial-examples#ran","syntology_url":"https://syntology.ai/paper/1907.07174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07174"}},"official":{"repos":["hendrycks/natural-adv-examples"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/boundary-attack-query-efficient-decision","slug":"boundary-attack-query-efficient-decision","title":"HopSkipJumpAttack: A Query-Efficient Decision-Based Attack","date":"2019-04-03","arxiv_id":"1904.02144","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boundary-attack-query-efficient-decision#ran","syntology_url":"https://syntology.ai/paper/1904.02144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02144"}},"official":{"repos":["Jianbo-Lab/BAPP","Jianbo-Lab/HSJA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/shapeshifter-robust-physical-adversarial","slug":"shapeshifter-robust-physical-adversarial","title":"ShapeShifter: Robust Physical Adversarial Attack on Faster R-CNN Object Detector","date":"2018-04-16","arxiv_id":"1804.05810","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/shapeshifter-robust-physical-adversarial#ran","syntology_url":"https://syntology.ai/paper/1804.05810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05810"}},"official":{"repos":["shangtse/robust-physical-attack"],"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/deflecting-adversarial-attacks-with-pixel","slug":"deflecting-adversarial-attacks-with-pixel","title":"Deflecting Adversarial Attacks with Pixel Deflection","date":"2018-01-26","arxiv_id":"1801.08926","repositories_listed":3,"syntology":null},{"url":"/paper/generalizable-data-free-objective-for","slug":"generalizable-data-free-objective-for","title":"Generalizable Data-free Objective for Crafting Universal Adversarial Perturbations","date":"2018-01-24","arxiv_id":"1801.08092","repositories_listed":3,"syntology":null},{"url":"/paper/deepfool-a-simple-and-accurate-method-to-fool","slug":"deepfool-a-simple-and-accurate-method-to-fool","title":"DeepFool: a simple and accurate method to fool deep neural networks","date":"2015-11-14","arxiv_id":"1511.04599","repositories_listed":3,"syntology":null},{"url":"/paper/adversarial-semantic-and-label-perturbation","slug":"adversarial-semantic-and-label-perturbation","title":"Adversarial Semantic and Label Perturbation Attack for Pedestrian Attribute Recognition","date":"2025-05-29","arxiv_id":"2505.23313","repositories_listed":2,"syntology":null},{"url":"/paper/bot-breaking-long-thought-processes-of-o1","slug":"bot-breaking-long-thought-processes-of-o1","title":"To Think or Not to Think: Exploring the Unthinking Vulnerability in Large Reasoning Models","date":"2025-02-16","arxiv_id":"2502.12202","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bot-breaking-long-thought-processes-of-o1#ran","syntology_url":"https://syntology.ai/paper/2502.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.12202"}},"official":{"repos":["zihao-ai/bot","zihao-ai/unthinking_vulnerability"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-aligned-adversarial-evolution","slug":"semantic-aligned-adversarial-evolution","title":"Semantic-Aligned Adversarial Evolution Triangle for High-Transferability Vision-Language Attack","date":"2024-11-04","arxiv_id":"2411.02669","repositories_listed":2,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":0,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 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; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/semantic-aligned-adversarial-evolution#ran","syntology_url":"https://syntology.ai/paper/2411.02669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02669"}},"official":{"repos":["jiaxiaojunqaq/sa-aet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/rethinking-the-threat-and-accessibility-of","slug":"rethinking-the-threat-and-accessibility-of","title":"Rethinking the Threat and Accessibility of Adversarial Attacks against Face Recognition Systems","date":"2024-07-11","arxiv_id":"2407.08514","repositories_listed":2,"syntology":null},{"url":"/paper/diffam-diffusion-based-adversarial-makeup","slug":"diffam-diffusion-based-adversarial-makeup","title":"DiffAM: Diffusion-based Adversarial Makeup Transfer for Facial Privacy Protection","date":"2024-05-16","arxiv_id":"2405.09882","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":4,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":14,"phrase":"12 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; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/diffam-diffusion-based-adversarial-makeup#ran","syntology_url":"https://syntology.ai/paper/2405.09882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09882"}},"official":{"repos":["hanssuny/diffam"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/epsilon-mesh-attack-a-surface-based","slug":"epsilon-mesh-attack-a-surface-based","title":"epsilon-Mesh Attack: A Surface-based Adversarial Point Cloud Attack for Facial Expression Recognition","date":"2024-03-11","arxiv_id":"2403.06661","repositories_listed":2,"syntology":null},{"url":"/paper/accuracy-of-textfooler-black-box-adversarial","slug":"accuracy-of-textfooler-black-box-adversarial","title":"Accuracy of TextFooler black box adversarial attacks on 01 loss sign activation neural network ensemble","date":"2024-02-12","arxiv_id":"2402.07347","repositories_listed":2,"syntology":null},{"url":"/paper/signsgd-with-federated-defense-harnessing","slug":"signsgd-with-federated-defense-harnessing","title":"SignSGD with Federated Defense: Harnessing Adversarial Attacks through Gradient Sign Decoding","date":"2024-02-02","arxiv_id":"2402.01340","repositories_listed":2,"syntology":null},{"url":"/paper/l-autoda-leveraging-large-language-models-for","slug":"l-autoda-leveraging-large-language-models-for","title":"L-AutoDA: Leveraging Large Language Models for Automated Decision-based Adversarial Attacks","date":"2024-01-27","arxiv_id":"2401.15335","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l-autoda-leveraging-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2401.15335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15335"}},"official":{"repos":["pgg3/L-AutoDA"],"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/artwork-protection-against-neural-style","slug":"artwork-protection-against-neural-style","title":"Artwork Protection Against Neural Style Transfer Using Locally Adaptive Adversarial Color Attack","date":"2024-01-18","arxiv_id":"2401.09673","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/understanding-and-improving-adversarial","slug":"understanding-and-improving-adversarial","title":"Targeted Attack Improves Protection against Unauthorized Diffusion Customization","date":"2023-10-07","arxiv_id":"2310.04687","repositories_listed":2,"syntology":{"n":24,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":3,"n_no_contract":9,"n_pointer_only":16,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 3 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/understanding-and-improving-adversarial#ran","syntology_url":"https://syntology.ai/paper/2310.04687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04687"}},"official":{"repos":["psyker-team/mist-v2","caradryanliang/improvedadvdm"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":8,"ran_from_kinds":["community","official"]}}},{"url":"/paper/structure-invariant-transformation-for-better","slug":"structure-invariant-transformation-for-better","title":"Structure Invariant Transformation for better Adversarial Transferability","date":"2023-09-26","arxiv_id":"2309.14700","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 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) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/structure-invariant-transformation-for-better#ran","syntology_url":"https://syntology.ai/paper/2309.14700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.14700"}},"official":{"repos":["xiaosen-wang/sit"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/frequency-domain-adversarial-training-for","slug":"frequency-domain-adversarial-training-for","title":"Frequency Domain Adversarial Training for Robust Volumetric Medical Segmentation","date":"2023-07-14","arxiv_id":"2307.07269","repositories_listed":2,"syntology":null},{"url":"/paper/logit-margin-matters-improving-transferable","slug":"logit-margin-matters-improving-transferable","title":"Logit Margin Matters: Improving Transferable Targeted Adversarial Attack by Logit Calibration","date":"2023-03-07","arxiv_id":"2303.03680","repositories_listed":2,"syntology":null},{"url":"/paper/meta-style-adversarial-training-for-cross","slug":"meta-style-adversarial-training-for-cross","title":"StyleAdv: Meta Style Adversarial Training for Cross-Domain Few-Shot Learning","date":"2023-02-18","arxiv_id":"2302.09309","repositories_listed":2,"syntology":null},{"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/boosting-adversarial-transferability-via-1","slug":"boosting-adversarial-transferability-via-1","title":"Boosting Adversarial Transferability via Gradient Relevance Attack","date":"2023-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tsfool-crafting-high-quality-adversarial-time","slug":"tsfool-crafting-high-quality-adversarial-time","title":"TSFool: Crafting Highly-Imperceptible Adversarial Time Series through Multi-Objective Attack","date":"2022-09-14","arxiv_id":"2209.06388","repositories_listed":2,"syntology":null},{"url":"/paper/generate-novel-and-robust-samples-from-data","slug":"generate-novel-and-robust-samples-from-data","title":"Generate synthetic samples from tabular data","date":"2022-09-12","arxiv_id":"2209.06113","repositories_listed":2,"syntology":null},{"url":"/paper/segpgd-an-effective-and-efficient-adversarial","slug":"segpgd-an-effective-and-efficient-adversarial","title":"SegPGD: An Effective and Efficient Adversarial Attack for Evaluating and Boosting Segmentation Robustness","date":"2022-07-25","arxiv_id":"2207.12391","repositories_listed":2,"syntology":null},{"url":"/paper/frequency-domain-model-augmentation-for","slug":"frequency-domain-model-augmentation-for","title":"Frequency Domain Model Augmentation for Adversarial Attack","date":"2022-07-12","arxiv_id":"2207.05382","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/frequency-domain-model-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2207.05382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05382"}},"official":{"repos":["yuyang-long/ssa"],"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/boosting-the-adversarial-transferability-of","slug":"boosting-the-adversarial-transferability-of","title":"Boosting the Adversarial Transferability of Surrogate Models with Dark Knowledge","date":"2022-06-16","arxiv_id":"2206.08316","repositories_listed":2,"syntology":null},{"url":"/paper/proximal-splitting-adversarial-attacks-for","slug":"proximal-splitting-adversarial-attacks-for","title":"Proximal Splitting Adversarial Attacks for Semantic Segmentation","date":"2022-06-14","arxiv_id":"2206.07179","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proximal-splitting-adversarial-attacks-for#ran","syntology_url":"https://syntology.ai/paper/2206.07179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07179"}},"official":{"repos":["jeromerony/alma_prox_segmentation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neurounlock-unlocking-the-architecture-of","slug":"neurounlock-unlocking-the-architecture-of","title":"NeuroUnlock: Unlocking the Architecture of Obfuscated Deep Neural Networks","date":"2022-06-01","arxiv_id":"2206.00402","repositories_listed":2,"syntology":null},{"url":"/paper/transferable-adversarial-attack-based-on-1","slug":"transferable-adversarial-attack-based-on-1","title":"Transferable Adversarial Attack based on Integrated Gradients","date":"2022-05-26","arxiv_id":"2205.13152","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/transferable-adversarial-attack-based-on-1#ran","syntology_url":"https://syntology.ai/paper/2205.13152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13152"}},"official":{"repos":["yihuang2016/TAIG"],"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/an-integrated-auto-encoder-block-switching-1","slug":"an-integrated-auto-encoder-block-switching-1","title":"An integrated Auto Encoder-Block Switching defense approach to prevent adversarial attacks","date":"2022-03-11","arxiv_id":"2203.10930","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-image-transformations-for-transfer","slug":"adaptive-image-transformations-for-transfer","title":"Adaptive Image Transformations for Transfer-based Adversarial Attack","date":"2021-11-27","arxiv_id":"2111.13844","repositories_listed":2,"syntology":null},{"url":"/paper/training-meta-surrogate-model-for","slug":"training-meta-surrogate-model-for","title":"Training Meta-Surrogate Model for Transferable Adversarial Attack","date":"2021-09-05","arxiv_id":"2109.01983","repositories_listed":2,"syntology":null},{"url":"/paper/small-in-distribution-changes-in-3d","slug":"small-in-distribution-changes-in-3d","title":"In-distribution adversarial attacks on object recognition models using gradient-free search","date":"2021-06-30","arxiv_id":"2106.16198","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/small-in-distribution-changes-in-3d#ran","syntology_url":"https://syntology.ai/paper/2106.16198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16198"}},"official":{"repos":["spandan-madan/in_distribution_adversarial_examples","in-dist-adversarials/in_distribution_adversarial_examples"],"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-attack-on-graph-neural-networks","slug":"adversarial-attack-on-graph-neural-networks","title":"Adversarial Attack on Graph Neural Networks as An Influence Maximization Problem","date":"2021-06-21","arxiv_id":"2106.10785","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/adversarial-attack-on-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.10785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10785"}},"official":{"repos":["TheaperDeng/GNN-Attack-InfMax"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transferable-sparse-adversarial-attack","slug":"transferable-sparse-adversarial-attack","title":"Transferable Sparse Adversarial Attack","date":"2021-05-31","arxiv_id":"2105.14727","repositories_listed":2,"syntology":null},{"url":"/paper/staircase-sign-method-for-boosting","slug":"staircase-sign-method-for-boosting","title":"Staircase Sign Method for Boosting Adversarial Attacks","date":"2021-04-20","arxiv_id":"2104.09722","repositories_listed":2,"syntology":null},{"url":"/paper/improving-robustness-of-deep-reinforcement","slug":"improving-robustness-of-deep-reinforcement","title":"Improving Robustness of Deep Reinforcement Learning Agents: Environment Attack based on the Critic Network","date":"2021-04-07","arxiv_id":"2104.03154","repositories_listed":2,"syntology":null},{"url":"/paper/practical-relative-order-attack-in-deep","slug":"practical-relative-order-attack-in-deep","title":"Practical Relative Order Attack in Deep Ranking","date":"2021-03-09","arxiv_id":"2103.05248","repositories_listed":2,"syntology":null},{"url":"/paper/targeted-attack-against-deep-neural-networks-1","slug":"targeted-attack-against-deep-neural-networks-1","title":"Targeted Attack against Deep Neural Networks via Flipping Limited Weight Bits","date":"2021-02-21","arxiv_id":"2102.10496","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/targeted-attack-against-deep-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2102.10496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10496"}},"official":{"repos":["jiawangbai/TA-LBF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-reinforcement-learning-on-state-1","slug":"robust-reinforcement-learning-on-state-1","title":"Robust Reinforcement Learning on State Observations with Learned Optimal Adversary","date":"2021-01-21","arxiv_id":"2101.08452","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"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) · 5 unverified","sample_list":"/paper/robust-reinforcement-learning-on-state-1#ran","syntology_url":"https://syntology.ai/paper/2101.08452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08452"}},"official":{"repos":["huanzhang12/ATLA_robust_RL"],"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/deep-feature-space-trojan-attack-of-neural","slug":"deep-feature-space-trojan-attack-of-neural","title":"Deep Feature Space Trojan Attack of Neural Networks by Controlled Detoxification","date":"2020-12-21","arxiv_id":"2012.11212","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/deep-feature-space-trojan-attack-of-neural#ran","syntology_url":"https://syntology.ai/paper/2012.11212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.11212"}},"official":{"repos":["Megum1/DFST"],"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/augmented-lagrangian-adversarial-attacks","slug":"augmented-lagrangian-adversarial-attacks","title":"Augmented Lagrangian Adversarial Attacks","date":"2020-11-24","arxiv_id":"2011.11857","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/augmented-lagrangian-adversarial-attacks#ran","syntology_url":"https://syntology.ai/paper/2011.11857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11857"}},"official":{"repos":["jeromerony/augmented_lagrangian_adversarial_attacks"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/foolhd-fooling-speaker-identification-by","slug":"foolhd-fooling-speaker-identification-by","title":"FoolHD: Fooling speaker identification by Highly imperceptible adversarial Disturbances","date":"2020-11-17","arxiv_id":"2011.08483","repositories_listed":2,"syntology":null},{"url":"/paper/maximum-mean-discrepancy-is-aware-of","slug":"maximum-mean-discrepancy-is-aware-of","title":"Maximum Mean Discrepancy Test is Aware of Adversarial Attacks","date":"2020-10-22","arxiv_id":"2010.11415","repositories_listed":2,"syntology":null},{"url":"/paper/generalizing-universal-adversarial-attacks","slug":"generalizing-universal-adversarial-attacks","title":"Generalizing Universal Adversarial Attacks Beyond Additive Perturbations","date":"2020-10-15","arxiv_id":"2010.07788","repositories_listed":2,"syntology":{"n":11,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/generalizing-universal-adversarial-attacks#ran","syntology_url":"https://syntology.ai/paper/2010.07788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07788"}},"official":{"repos":["TrustAI/GUAP"],"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/an-adversarial-attack-against-stacked-capsule","slug":"an-adversarial-attack-against-stacked-capsule","title":"An Evasion Attack against Stacked Capsule Autoencoder","date":"2020-10-14","arxiv_id":"2010.07230","repositories_listed":2,"syntology":null},{"url":"/paper/towards-resistant-audio-adversarial-examples","slug":"towards-resistant-audio-adversarial-examples","title":"Towards Resistant Audio Adversarial Examples","date":"2020-10-14","arxiv_id":"2010.07190","repositories_listed":2,"syntology":null},{"url":"/paper/robust-deep-reinforcement-learning-through","slug":"robust-deep-reinforcement-learning-through","title":"Robust Deep Reinforcement Learning through Adversarial Loss","date":"2020-08-05","arxiv_id":"2008.01976","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-deep-reinforcement-learning-through#ran","syntology_url":"https://syntology.ai/paper/2008.01976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.01976"}},"official":{"repos":["tuomaso/radial_rl","tuomaso/radial_rl_v2"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-privacy-preserving-filter","slug":"adversarial-privacy-preserving-filter","title":"Adversarial Privacy-preserving Filter","date":"2020-07-25","arxiv_id":"2007.12861","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-privacy-preserving-filter#ran","syntology_url":"https://syntology.ai/paper/2007.12861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12861"}},"official":{"repos":["adversarial-for-goodness/APF","ACM-MM-2020-Submission/Submission123"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}}],"syntology_records":52,"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":1,"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-attack-on-cifar-10","since_archive":"/sota/adversarial-attack-on-cifar-10#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":206,"papers_where_code_ran_first_page":"/task/adversarial-attack/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":19,"url":"/task/adversarial-attack/papers/2","json":"/task/adversarial-attack/papers/2.json","rows":100},{"order":"archive","page":3,"of":19,"url":"/task/adversarial-attack/papers/3","json":"/task/adversarial-attack/papers/3.json","rows":100},{"order":"archive","page":4,"of":19,"url":"/task/adversarial-attack/papers/4","json":"/task/adversarial-attack/papers/4.json","rows":100},{"order":"archive","page":5,"of":19,"url":"/task/adversarial-attack/papers/5","json":"/task/adversarial-attack/papers/5.json","rows":100},{"order":"archive","page":6,"of":19,"url":"/task/adversarial-attack/papers/6","json":"/task/adversarial-attack/papers/6.json","rows":100},{"order":"archive","page":7,"of":19,"url":"/task/adversarial-attack/papers/7","json":"/task/adversarial-attack/papers/7.json","rows":100},{"order":"archive","page":8,"of":19,"url":"/task/adversarial-attack/papers/8","json":"/task/adversarial-attack/papers/8.json","rows":100},{"order":"archive","page":9,"of":19,"url":"/task/adversarial-attack/papers/9","json":"/task/adversarial-attack/papers/9.json","rows":100},{"order":"archive","page":10,"of":19,"url":"/task/adversarial-attack/papers/10","json":"/task/adversarial-attack/papers/10.json","rows":100},{"order":"archive","page":11,"of":19,"url":"/task/adversarial-attack/papers/11","json":"/task/adversarial-attack/papers/11.json","rows":100},{"order":"archive","page":12,"of":19,"url":"/task/adversarial-attack/papers/12","json":"/task/adversarial-attack/papers/12.json","rows":100},{"order":"archive","page":13,"of":19,"url":"/task/adversarial-attack/papers/13","json":"/task/adversarial-attack/papers/13.json","rows":100},{"order":"archive","page":14,"of":19,"url":"/task/adversarial-attack/papers/14","json":"/task/adversarial-attack/papers/14.json","rows":100},{"order":"archive","page":15,"of":19,"url":"/task/adversarial-attack/papers/15","json":"/task/adversarial-attack/papers/15.json","rows":100},{"order":"archive","page":16,"of":19,"url":"/task/adversarial-attack/papers/16","json":"/task/adversarial-attack/papers/16.json","rows":100},{"order":"archive","page":17,"of":19,"url":"/task/adversarial-attack/papers/17","json":"/task/adversarial-attack/papers/17.json","rows":100},{"order":"archive","page":18,"of":19,"url":"/task/adversarial-attack/papers/18","json":"/task/adversarial-attack/papers/18.json","rows":100},{"order":"archive","page":19,"of":19,"url":"/task/adversarial-attack/papers/19","json":"/task/adversarial-attack/papers/19.json","rows":8},{"order":"ran","page":1,"of":3,"url":"/task/adversarial-attack/papers/ran/1","json":"/task/adversarial-attack/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/adversarial-attack/papers/ran/2","json":"/task/adversarial-attack/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/adversarial-attack/papers/ran/3","json":"/task/adversarial-attack/papers/ran/3.json","rows":6}],"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":"99bcf890cbea3ee534f3f5d46173e39db506f9793827a9acdc57a0a498cb875e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}