{"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/papers/3","list_of":"/task/adversarial-robustness","task":"Adversarial Robustness","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":18,"rows_per_page":100,"rows":[201,300],"of":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":205,"every_run_a_failure_of_syntologys_instrument":56,"listed_with_a_run_with_no_instrument_failure":205,"listed_every_run_a_failure_of_syntologys_instrument":56,"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"},"first_page":"/task/adversarial-robustness","prev":"/task/adversarial-robustness/papers/2","next":"/task/adversarial-robustness/papers/4","papers":[{"url":"/paper/are-large-language-models-really-bias-free","slug":"are-large-language-models-really-bias-free","title":"Are Large Language Models Really Bias-Free? Jailbreak Prompts for Assessing Adversarial Robustness to Bias Elicitation","date":"2024-07-11","arxiv_id":"2407.08441","repositories_listed":1,"syntology":null},{"url":"/paper/ho-fmn-hyperparameter-optimization-for-fast","slug":"ho-fmn-hyperparameter-optimization-for-fast","title":"HO-FMN: Hyperparameter Optimization for Fast Minimum-Norm Attacks","date":"2024-07-11","arxiv_id":"2407.08806","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-of-vaes-across","slug":"adversarial-robustness-of-vaes-across","title":"Adversarial Robustness of VAEs across Intersectional Subgroups","date":"2024-07-04","arxiv_id":"2407.03864","repositories_listed":1,"syntology":null},{"url":"/paper/trackpgd-a-white-box-attack-using-binary","slug":"trackpgd-a-white-box-attack-using-binary","title":"TrackPGD: Efficient Adversarial Attack using Object Binary Masks against Robust Transformer Trackers","date":"2024-07-04","arxiv_id":"2407.03946","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-based-adversarial-purification-for-2","slug":"diffusion-based-adversarial-purification-for-2","title":"Diffusion-based Adversarial Purification for Intrusion Detection","date":"2024-06-25","arxiv_id":"2406.17606","repositories_listed":1,"syntology":null},{"url":"/paper/treatment-of-statistical-estimation-problems","slug":"treatment-of-statistical-estimation-problems","title":"Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness","date":"2024-06-25","arxiv_id":"2406.17830","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/treatment-of-statistical-estimation-problems#ran","syntology_url":"https://syntology.ai/paper/2406.17830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17830"}},"official":{"repos":["vvoracek/rs_conf_seq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deciphering-the-definition-of-adversarial","slug":"deciphering-the-definition-of-adversarial","title":"Deciphering the Definition of Adversarial Robustness for post-hoc OOD Detectors","date":"2024-06-21","arxiv_id":"2406.15104","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/deciphering-the-definition-of-adversarial#ran","syntology_url":"https://syntology.ai/paper/2406.15104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15104"}},"official":{"repos":["adverml/advopenood"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explainable-ai-security-exploring-robustness","slug":"explainable-ai-security-exploring-robustness","title":"Understanding the Robustness of Graph Neural Networks against Adversarial Attacks","date":"2024-06-20","arxiv_id":"2406.13920","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-multimodal-agents","slug":"adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","arxiv_id":"2406.12814","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/adversarial-attacks-on-multimodal-agents#ran","syntology_url":"https://syntology.ai/paper/2406.12814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12814"}},"official":{"repos":["chenwu98/agent-attack"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/adversaries-with-incentives-a-strategic","slug":"adversaries-with-incentives-a-strategic","title":"Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness","date":"2024-06-17","arxiv_id":"2406.11458","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via-5","slug":"improving-adversarial-robustness-via-5","title":"Improving Adversarial Robustness via Decoupled Visual Representation Masking","date":"2024-06-16","arxiv_id":"2406.10933","repositories_listed":1,"syntology":null},{"url":"/paper/kgpa-robustness-evaluation-for-large-language","slug":"kgpa-robustness-evaluation-for-large-language","title":"KGPA: Robustness Evaluation for Large Language Models via Cross-Domain Knowledge Graphs","date":"2024-06-16","arxiv_id":"2406.10802","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-randomized-smoothing-certifying","slug":"adaptive-randomized-smoothing-certifying","title":"Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences","date":"2024-06-14","arxiv_id":"2406.10427","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/adaptive-randomized-smoothing-certifying#ran","syntology_url":"https://syntology.ai/paper/2406.10427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10427"}},"official":{"repos":["ubc-systopia/adaptive-randomized-smoothing"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-evaluating-the-robustness-of-visual","slug":"towards-evaluating-the-robustness-of-visual","title":"Towards Evaluating the Robustness of Visual State Space Models","date":"2024-06-13","arxiv_id":"2406.09407","repositories_listed":1,"syntology":null},{"url":"/paper/on-evaluating-adversarial-robustness-of","slug":"on-evaluating-adversarial-robustness-of","title":"On Evaluating Adversarial Robustness of Volumetric Medical Segmentation Models","date":"2024-06-12","arxiv_id":"2406.08486","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-adversarial-training-of","slug":"self-supervised-adversarial-training-of","title":"Self-supervised Adversarial Training of Monocular Depth Estimation against Physical-World Attacks","date":"2024-06-09","arxiv_id":"2406.05857","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/self-supervised-adversarial-training-of#ran","syntology_url":"https://syntology.ai/paper/2406.05857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05857"}},"official":{"repos":["Bob-cheng/DepthModelHardening"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-adversarial-robustness-of-deep-1","slug":"exploring-adversarial-robustness-of-deep-1","title":"Exploring Adversarial Robustness of Deep State Space Models","date":"2024-06-08","arxiv_id":"2406.05532","repositories_listed":1,"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/exploring-adversarial-robustness-of-deep-1#ran","syntology_url":"https://syntology.ai/paper/2406.05532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05532"}},"official":{"repos":["biqing-qi/exploring-adversarial-robustness-of-deep-state-space-models"],"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/large-language-model-assisted-adversarial","slug":"large-language-model-assisted-adversarial","title":"Large Language Model Assisted Adversarial Robustness Neural Architecture Search","date":"2024-06-08","arxiv_id":"2406.05433","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-study-on-adversarial-attacks","slug":"reproducibility-study-on-adversarial-attacks","title":"Reproducibility Study on Adversarial Attacks Against Robust Transformer Trackers","date":"2024-06-03","arxiv_id":"2406.01765","repositories_listed":1,"syntology":null},{"url":"/paper/constrained-adaptive-attack-effective","slug":"constrained-adaptive-attack-effective","title":"Constrained Adaptive Attack: Effective Adversarial Attack Against Deep Neural Networks for Tabular Data","date":"2024-06-02","arxiv_id":"2406.00775","repositories_listed":1,"syntology":null},{"url":"/paper/robust-entropy-search-for-safe-efficient","slug":"robust-entropy-search-for-safe-efficient","title":"Robust Entropy Search for Safe Efficient Bayesian Optimization","date":"2024-05-29","arxiv_id":"2405.19059","repositories_listed":1,"syntology":null},{"url":"/paper/towards-unified-robustness-against-both","slug":"towards-unified-robustness-against-both","title":"Towards Unified Robustness Against Both Backdoor and Adversarial Attacks","date":"2024-05-28","arxiv_id":"2405.17929","repositories_listed":1,"syntology":null},{"url":"/paper/white-box-multimodal-jailbreaks-against-large","slug":"white-box-multimodal-jailbreaks-against-large","title":"White-box Multimodal Jailbreaks Against Large Vision-Language Models","date":"2024-05-28","arxiv_id":"2405.17894","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/white-box-multimodal-jailbreaks-against-large#ran","syntology_url":"https://syntology.ai/paper/2405.17894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17894"}},"official":{"repos":["roywang021/UMK"],"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"]}}},{"url":"/paper/spectral-regularization-for-adversarially","slug":"spectral-regularization-for-adversarially","title":"Spectral regularization for adversarially-robust representation learning","date":"2024-05-27","arxiv_id":"2405.17181","repositories_listed":1,"syntology":null},{"url":"/paper/the-uncanny-valley-exploring-adversarial","slug":"the-uncanny-valley-exploring-adversarial","title":"The Uncanny Valley: Exploring Adversarial Robustness from a Flatness Perspective","date":"2024-05-27","arxiv_id":"2405.16918","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/the-uncanny-valley-exploring-adversarial#ran","syntology_url":"https://syntology.ai/paper/2405.16918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16918"}},"official":null}},{"url":"/paper/evaluating-the-adversarial-robustness-of-1","slug":"evaluating-the-adversarial-robustness-of-1","title":"Evaluating and Safeguarding the Adversarial Robustness of Retrieval-Based In-Context Learning","date":"2024-05-24","arxiv_id":"2405.15984","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/evaluating-the-adversarial-robustness-of-1#ran","syntology_url":"https://syntology.ai/paper/2405.15984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15984"}},"official":{"repos":["simonucl/adv-retreival-icl"],"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/adversarial-robustness-for-visual-grounding","slug":"adversarial-robustness-for-visual-grounding","title":"Adversarial Robustness for Visual Grounding of Multimodal Large Language Models","date":"2024-05-16","arxiv_id":"2405.09981","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-for-visual-grounding#ran","syntology_url":"https://syntology.ai/paper/2405.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09981"}},"official":{"repos":["KuofengGao/MLLM-Grounding-Robustness"],"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/the-pitfalls-and-promise-of-conformal","slug":"the-pitfalls-and-promise-of-conformal","title":"The Pitfalls and Promise of Conformal Inference Under Adversarial Attacks","date":"2024-05-14","arxiv_id":"2405.08886","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-pitfalls-and-promise-of-conformal#ran","syntology_url":"https://syntology.ai/paper/2405.08886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08886"}},"official":{"repos":["ziquanliu/ICML2024-AT-UR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/raid-a-shared-benchmark-for-robust-evaluation","slug":"raid-a-shared-benchmark-for-robust-evaluation","title":"RAID: A Shared Benchmark for Robust Evaluation of Machine-Generated Text Detectors","date":"2024-05-13","arxiv_id":"2405.07940","repositories_listed":1,"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":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/raid-a-shared-benchmark-for-robust-evaluation#ran","syntology_url":"https://syntology.ai/paper/2405.07940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07940"}},"official":{"repos":["liamdugan/raid"],"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/impact-of-architectural-modifications-on-deep","slug":"impact-of-architectural-modifications-on-deep","title":"Impact of Architectural Modifications on Deep Learning Adversarial Robustness","date":"2024-05-03","arxiv_id":"2405.01934","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-the-adversarial-robustness-of","slug":"revisiting-the-adversarial-robustness-of","title":"Revisiting the Adversarial Robustness of Vision Language Models: a Multimodal Perspective","date":"2024-04-30","arxiv_id":"2404.19287","repositories_listed":1,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":12,"n_instrument":6,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-the-adversarial-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2404.19287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19287"}},"official":{"repos":["ellezwq/mmcoa"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/bounding-the-expected-robustness-of-graph","slug":"bounding-the-expected-robustness-of-graph","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","date":"2024-04-27","arxiv_id":"2404.17947","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/bounding-the-expected-robustness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2404.17947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17947"}},"official":{"repos":["sennadir/gcorn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cauchy-schwarz-divergence-information","slug":"cauchy-schwarz-divergence-information","title":"Cauchy-Schwarz Divergence Information Bottleneck for Regression","date":"2024-04-27","arxiv_id":"2404.17951","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cauchy-schwarz-divergence-information#ran","syntology_url":"https://syntology.ai/paper/2404.17951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17951"}},"official":{"repos":["sjyucnel/cauchy-schwarz-information-bottleneck"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robust-recommendation-a-review-and-an","slug":"towards-robust-recommendation-a-review-and-an","title":"Towards Robust Recommendation: A Review and an Adversarial Robustness Evaluation Library","date":"2024-04-27","arxiv_id":"2404.17844","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-of-deep-learning-based-1","slug":"adversarial-robustness-of-deep-learning-based-1","title":"Adversarial Robustness of Deep Learning-Based Malware Detectors via (De)Randomized Smoothing","date":"2024-04-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-adversarial-examples-generation","slug":"efficiently-adversarial-examples-generation","title":"Efficient Generation of Targeted and Transferable Adversarial Examples for Vision-Language Models Via Diffusion Models","date":"2024-04-16","arxiv_id":"2404.10335","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficiently-adversarial-examples-generation#ran","syntology_url":"https://syntology.ai/paper/2404.10335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10335"}},"official":{"repos":["gq-max/advdiffvlm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spamdam-towards-privacy-preserving-and","slug":"spamdam-towards-privacy-preserving-and","title":"SpamDam: Towards Privacy-Preserving and Adversary-Resistant SMS Spam Detection","date":"2024-04-15","arxiv_id":"2404.09481","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-limits-via-scaling-law","slug":"adversarial-robustness-limits-via-scaling-law","title":"Adversarial Robustness Limits via Scaling-Law and Human-Alignment Studies","date":"2024-04-14","arxiv_id":"2404.09349","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-limits-via-scaling-law#ran","syntology_url":"https://syntology.ai/paper/2404.09349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.09349"}},"official":{"repos":["bbartoldson/adversarial-robustness-limits"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/eliminating-catastrophic-overfitting-via-1","slug":"eliminating-catastrophic-overfitting-via-1","title":"Eliminating Catastrophic Overfitting Via Abnormal Adversarial Examples Regularization","date":"2024-04-11","arxiv_id":"2404.08154","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/eliminating-catastrophic-overfitting-via-1#ran","syntology_url":"https://syntology.ai/paper/2404.08154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08154"}},"official":{"repos":["tmllab/2023_neurips_aaer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-adversarial-training-and-the-1-nearest","slug":"on-adversarial-training-and-the-1-nearest","title":"On adversarial training and the 1 Nearest Neighbor classifier","date":"2024-04-09","arxiv_id":"2404.06313","repositories_listed":1,"syntology":null},{"url":"/paper/badpart-unified-black-box-adversarial-patch","slug":"badpart-unified-black-box-adversarial-patch","title":"BadPart: Unified Black-box Adversarial Patch Attacks against Pixel-wise Regression Tasks","date":"2024-04-01","arxiv_id":"2404.00924","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"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) · 1 unverified","sample_list":"/paper/badpart-unified-black-box-adversarial-patch#ran","syntology_url":"https://syntology.ai/paper/2404.00924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00924"}},"official":{"repos":["bob-cheng/badpart"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/boosting-adversarial-training-via-fisher-rao","slug":"boosting-adversarial-training-via-fisher-rao","title":"Boosting Adversarial Training via Fisher-Rao Norm-based Regularization","date":"2024-03-26","arxiv_id":"2403.17520","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/boosting-adversarial-training-via-fisher-rao#ran","syntology_url":"https://syntology.ai/paper/2403.17520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17520"}},"official":{"repos":["trustai/loat"],"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/an-embarrassingly-simple-defense-against","slug":"an-embarrassingly-simple-defense-against","title":"Towards Adversarial Robustness And Backdoor Mitigation in SSL","date":"2024-03-23","arxiv_id":"2403.15918","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-adversarial-prompt-learning-on","slug":"few-shot-adversarial-prompt-learning-on","title":"Few-Shot Adversarial Prompt Learning on Vision-Language Models","date":"2024-03-21","arxiv_id":"2403.14774","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/few-shot-adversarial-prompt-learning-on#ran","syntology_url":"https://syntology.ai/paper/2403.14774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14774"}},"official":{"repos":["lionel-w2/fap"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dd-robustbench-an-adversarial-robustness","slug":"dd-robustbench-an-adversarial-robustness","title":"DD-RobustBench: An Adversarial Robustness Benchmark for Dataset Distillation","date":"2024-03-20","arxiv_id":"2403.13322","repositories_listed":1,"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/dd-robustbench-an-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2403.13322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13322"}},"official":{"repos":["fredwu-hust/dd-robustbench"],"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/defense-against-adversarial-attacks-on-no","slug":"defense-against-adversarial-attacks-on-no","title":"Defense Against Adversarial Attacks on No-Reference Image Quality Models with Gradient Norm Regularization","date":"2024-03-18","arxiv_id":"2403.11397","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/defense-against-adversarial-attacks-on-no#ran","syntology_url":"https://syntology.ai/paper/2403.11397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11397"}},"official":{"repos":["yangid/defenseiqa-nt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-overfitting-does-matter-test-time","slug":"robust-overfitting-does-matter-test-time","title":"Robust Overfitting Does Matter: Test-Time Adversarial Purification With FGSM","date":"2024-03-18","arxiv_id":"2403.11448","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-robustness-of-visual-state","slug":"understanding-robustness-of-visual-state","title":"Understanding Robustness of Visual State Space Models for Image Classification","date":"2024-03-16","arxiv_id":"2403.10935","repositories_listed":1,"syntology":null},{"url":"/paper/towards-adversarially-robust-dataset","slug":"towards-adversarially-robust-dataset","title":"Towards Adversarially Robust Dataset Distillation by Curvature Regularization","date":"2024-03-15","arxiv_id":"2403.10045","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-adversarially-robust-dataset#ran","syntology_url":"https://syntology.ai/paper/2403.10045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10045"}},"official":{"repos":["yumozi/guard"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/peeraid-improving-adversarial-distillation","slug":"peeraid-improving-adversarial-distillation","title":"PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutor","date":"2024-03-11","arxiv_id":"2403.06668","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":1,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/peeraid-improving-adversarial-distillation#ran","syntology_url":"https://syntology.ai/paper/2403.06668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06668"}},"official":{"repos":["jaewonalive/peeraid"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/speech-robust-bench-a-robustness-benchmark","slug":"speech-robust-bench-a-robustness-benchmark","title":"Speech Robust Bench: A Robustness Benchmark For Speech Recognition","date":"2024-03-08","arxiv_id":"2403.07937","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/speech-robust-bench-a-robustness-benchmark#ran","syntology_url":"https://syntology.ai/paper/2403.07937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07937"}},"official":{"repos":["ahmedshah1494/speech_robust_bench"],"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":["found_in_text","official"]}}},{"url":"/paper/df-rap-a-robust-adversarial-perturbation-for","slug":"df-rap-a-robust-adversarial-perturbation-for","title":"DF-RAP: A Robust Adversarial Perturbation for Defending against Deepfakes in Real-world Social Network Scenarios","date":"2024-03-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/one-prompt-word-is-enough-to-boost","slug":"one-prompt-word-is-enough-to-boost","title":"One Prompt Word is Enough to Boost Adversarial Robustness for Pre-trained Vision-Language Models","date":"2024-03-04","arxiv_id":"2403.01849","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/one-prompt-word-is-enough-to-boost#ran","syntology_url":"https://syntology.ai/paper/2403.01849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01849"}},"official":{"repos":["treelli/apt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/spectrum-extraction-and-clipping-for","slug":"spectrum-extraction-and-clipping-for","title":"Spectrum Extraction and Clipping for Implicitly Linear Layers","date":"2024-02-25","arxiv_id":"2402.16017","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-duality-between-sharpness-aware","slug":"on-the-duality-between-sharpness-aware","title":"On the Duality Between Sharpness-Aware Minimization and Adversarial Training","date":"2024-02-23","arxiv_id":"2402.15152","repositories_listed":1,"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":8,"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/on-the-duality-between-sharpness-aware#ran","syntology_url":"https://syntology.ai/paper/2402.15152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15152"}},"official":{"repos":["weizeming/sam_at"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/stop-reasoning-when-multimodal-llms-with","slug":"stop-reasoning-when-multimodal-llms-with","title":"Stop Reasoning! When Multimodal LLM with Chain-of-Thought Reasoning Meets Adversarial Image","date":"2024-02-22","arxiv_id":"2402.14899","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stop-reasoning-when-multimodal-llms-with#ran","syntology_url":"https://syntology.ai/paper/2402.14899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14899"}},"official":{"repos":["aipenguin/stopreasoning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/is-llm-as-a-judge-robust-investigating","slug":"is-llm-as-a-judge-robust-investigating","title":"Is LLM-as-a-Judge Robust? Investigating Universal Adversarial Attacks on Zero-shot LLM Assessment","date":"2024-02-21","arxiv_id":"2402.14016","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 4 unverified","sample_list":"/paper/is-llm-as-a-judge-robust-investigating#ran","syntology_url":"https://syntology.ai/paper/2402.14016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14016"}},"official":{"repos":["rainavyas/attack-comparative-assessment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-curious-case-of-searching-for-the","slug":"a-curious-case-of-searching-for-the","title":"A Curious Case of Searching for the Correlation between Training Data and Adversarial Robustness of Transformer Textual Models","date":"2024-02-18","arxiv_id":"2402.11469","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-adversarial-robustness-of-low-dose","slug":"evaluating-adversarial-robustness-of-low-dose","title":"Evaluating Adversarial Robustness of Low dose CT Recovery","date":"2024-02-18","arxiv_id":"2402.11557","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-texture-bias-of-deep-neural-networks","slug":"reducing-texture-bias-of-deep-neural-networks","title":"Reducing Texture Bias of Deep Neural Networks via Edge Enhancing Diffusion","date":"2024-02-14","arxiv_id":"2402.09530","repositories_listed":1,"syntology":null},{"url":"/paper/soft-prompt-threats-attacking-safety","slug":"soft-prompt-threats-attacking-safety","title":"Soft Prompt Threats: Attacking Safety Alignment and Unlearning in Open-Source LLMs through the Embedding Space","date":"2024-02-14","arxiv_id":"2402.09063","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/soft-prompt-threats-attacking-safety#ran","syntology_url":"https://syntology.ai/paper/2402.09063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09063"}},"official":{"repos":["schwinnl/llm_embedding_attack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/two-tales-of-single-phase-contrastive-hebbian","slug":"two-tales-of-single-phase-contrastive-hebbian","title":"Two Tales of Single-Phase Contrastive Hebbian Learning","date":"2024-02-13","arxiv_id":"2402.08573","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/two-tales-of-single-phase-contrastive-hebbian#ran","syntology_url":"https://syntology.ai/paper/2402.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08573"}},"official":{"repos":["Rasmuskh/dualprop_icml_2024"],"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":["official"]}}},{"url":"/paper/tighter-bounds-on-the-information-bottleneck","slug":"tighter-bounds-on-the-information-bottleneck","title":"Tighter Bounds on the Information Bottleneck with Application to Deep Learning","date":"2024-02-12","arxiv_id":"2402.07639","repositories_listed":1,"syntology":null},{"url":"/paper/ramp-boosting-adversarial-robustness-against","slug":"ramp-boosting-adversarial-robustness-against","title":"RAMP: Boosting Adversarial Robustness Against Multiple $l_p$ Perturbations for Universal Robustness","date":"2024-02-09","arxiv_id":"2402.06827","repositories_listed":1,"syntology":null},{"url":"/paper/is-adversarial-training-with-compressed","slug":"is-adversarial-training-with-compressed","title":"Is Adversarial Training with Compressed Datasets Effective?","date":"2024-02-08","arxiv_id":"2402.05675","repositories_listed":1,"syntology":null},{"url":"/paper/mixednuts-training-free-accuracy-robustness","slug":"mixednuts-training-free-accuracy-robustness","title":"MixedNUTS: Training-Free Accuracy-Robustness Balance via Nonlinearly Mixed Classifiers","date":"2024-02-03","arxiv_id":"2402.02263","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixednuts-training-free-accuracy-robustness#ran","syntology_url":"https://syntology.ai/paper/2402.02263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02263"}},"official":{"repos":["Bai-YT/MixedNUTS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mitigating-feature-gap-for-adversarial","slug":"mitigating-feature-gap-for-adversarial","title":"AFD: Mitigating Feature Gap for Adversarial Robustness by Feature Disentanglement","date":"2024-01-26","arxiv_id":"2401.14707","repositories_listed":1,"syntology":null},{"url":"/paper/a-systematic-approach-to-robustness-modelling","slug":"a-systematic-approach-to-robustness-modelling","title":"A Training Rate and Survival Heuristic for Inference and Robustness Evaluation (TRASHFIRE)","date":"2024-01-24","arxiv_id":"2401.13751","repositories_listed":1,"syntology":null},{"url":"/paper/the-effect-of-intrinsic-dataset-properties-on","slug":"the-effect-of-intrinsic-dataset-properties-on","title":"The Effect of Intrinsic Dataset Properties on Generalization: Unraveling Learning Differences Between Natural and Medical Images","date":"2024-01-16","arxiv_id":"2401.08865","repositories_listed":1,"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":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/the-effect-of-intrinsic-dataset-properties-on#ran","syntology_url":"https://syntology.ai/paper/2401.08865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.08865"}},"official":{"repos":["mazurowski-lab/intrinsic-properties"],"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/pre-trained-model-guided-fine-tuning-for-zero","slug":"pre-trained-model-guided-fine-tuning-for-zero","title":"Pre-trained Model Guided Fine-Tuning for Zero-Shot Adversarial Robustness","date":"2024-01-09","arxiv_id":"2401.04350","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"8 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pre-trained-model-guided-fine-tuning-for-zero#ran","syntology_url":"https://syntology.ai/paper/2401.04350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04350"}},"official":{"repos":["serendipity1122/pre-trained-model-guided-fine-tuning-for-zero-shot-adversarial-robustness"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dense-hopfield-networks-in-the-teacher","slug":"dense-hopfield-networks-in-the-teacher","title":"Dense Hopfield Networks in the Teacher-Student Setting","date":"2024-01-08","arxiv_id":"2401.04191","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-subsampling-in-the-presence-of-an","slug":"data-driven-subsampling-in-the-presence-of-an","title":"Data-Driven Subsampling in the Presence of an Adversarial Actor","date":"2024-01-07","arxiv_id":"2401.03488","repositories_listed":1,"syntology":null},{"url":"/paper/towards-adversarial-robustness-verification","slug":"towards-adversarial-robustness-verification","title":"Towards adversarial robustness verification of no-reference image-and video-quality metrics","date":"2023-12-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lrs-enhancing-adversarial-transferability","slug":"lrs-enhancing-adversarial-transferability","title":"LRS: Enhancing Adversarial Transferability through Lipschitz Regularized Surrogate","date":"2023-12-20","arxiv_id":"2312.13118","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-compute-is-not-all-you-need-for","slug":"scaling-compute-is-not-all-you-need-for","title":"Scaling Compute Is Not All You Need for Adversarial Robustness","date":"2023-12-20","arxiv_id":"2312.13131","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/scaling-compute-is-not-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2312.13131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13131"}},"official":{"repos":["dedeswim/timm-adv-training"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-ultimate-combo-boosting-adversarial","slug":"the-ultimate-combo-boosting-adversarial","title":"The Ultimate Combo: Boosting Adversarial Example Transferability by Composing Data Augmentations","date":"2023-12-18","arxiv_id":"2312.11309","repositories_listed":1,"syntology":null},{"url":"/paper/rerogcrl-representation-based-robustness-in","slug":"rerogcrl-representation-based-robustness-in","title":"ReRoGCRL: Representation-based Robustness in Goal-Conditioned Reinforcement Learning","date":"2023-12-12","arxiv_id":"2312.07392","repositories_listed":1,"syntology":null},{"url":"/paper/initialization-matters-for-adversarial","slug":"initialization-matters-for-adversarial","title":"Initialization Matters for Adversarial Transfer Learning","date":"2023-12-10","arxiv_id":"2312.05716","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robust-fairness-via","slug":"improving-adversarial-robust-fairness-via","title":"Improving Adversarial Robust Fairness via Anti-Bias Soft Label Distillation","date":"2023-12-09","arxiv_id":"2312.05508","repositories_listed":1,"syntology":null},{"url":"/paper/mimir-masked-image-modeling-for-mutual","slug":"mimir-masked-image-modeling-for-mutual","title":"MIMIR: Masked Image Modeling for Mutual Information-based Adversarial Robustness","date":"2023-12-08","arxiv_id":"2312.04960","repositories_listed":1,"syntology":null},{"url":"/paper/roast-robustifying-language-models-via","slug":"roast-robustifying-language-models-via","title":"RoAST: Robustifying Language Models via Adversarial Perturbation with Selective Training","date":"2023-12-07","arxiv_id":"2312.04032","repositories_listed":1,"syntology":null},{"url":"/paper/class-incremental-learning-for-adversarial","slug":"class-incremental-learning-for-adversarial","title":"Enhancing Robustness in Incremental Learning with Adversarial Training","date":"2023-12-06","arxiv_id":"2312.03289","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robust-memory-based-continual","slug":"adversarial-robust-memory-based-continual","title":"Adversarial Robust Memory-Based Continual Learner","date":"2023-11-29","arxiv_id":"2311.17608","repositories_listed":1,"syntology":null},{"url":"/paper/how-many-unicorns-are-in-this-image-a-safety","slug":"how-many-unicorns-are-in-this-image-a-safety","title":"How Many Unicorns Are in This Image? A Safety Evaluation Benchmark for Vision LLMs","date":"2023-11-27","arxiv_id":"2311.16101","repositories_listed":1,"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":2,"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/how-many-unicorns-are-in-this-image-a-safety#ran","syntology_url":"https://syntology.ai/paper/2311.16101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.16101"}},"official":{"repos":["ucsc-vlaa/vllm-safety-benchmark"],"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/robust-graph-neural-networks-via-unbiased","slug":"robust-graph-neural-networks-via-unbiased","title":"Robust Graph Neural Networks via Unbiased Aggregation","date":"2023-11-25","arxiv_id":"2311.14934","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":2,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"11 ran (of which 2 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-graph-neural-networks-via-unbiased#ran","syntology_url":"https://syntology.ai/paper/2311.14934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14934"}},"official":{"repos":["chris-hzc/rung"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":2,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/training-robust-and-generalizable-quantum","slug":"training-robust-and-generalizable-quantum","title":"Training robust and generalizable quantum models","date":"2023-11-20","arxiv_id":"2311.11871","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-prompt-tuning-for-vision-language","slug":"adversarial-prompt-tuning-for-vision-language","title":"Adversarial Prompt Tuning for Vision-Language Models","date":"2023-11-19","arxiv_id":"2311.11261","repositories_listed":1,"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":1,"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/adversarial-prompt-tuning-for-vision-language#ran","syntology_url":"https://syntology.ai/paper/2311.11261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.11261"}},"official":{"repos":["jiamingzhang94/adversarial-prompt-tuning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-robust-spiking-neural-networks","slug":"adversarially-robust-spiking-neural-networks","title":"Adversarially Robust Spiking Neural Networks Through Conversion","date":"2023-11-15","arxiv_id":"2311.09266","repositories_listed":1,"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":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/adversarially-robust-spiking-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2311.09266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09266"}},"official":{"repos":["igitugraz/robustsnnconversion"],"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/deep-anytime-valid-hypothesis-testing","slug":"deep-anytime-valid-hypothesis-testing","title":"Deep anytime-valid hypothesis testing","date":"2023-10-30","arxiv_id":"2310.19384","repositories_listed":1,"syntology":null},{"url":"/paper/detection-defenses-an-empty-promise-against","slug":"detection-defenses-an-empty-promise-against","title":"Detection Defenses: An Empty Promise against Adversarial Patch Attacks on Optical Flow","date":"2023-10-26","arxiv_id":"2310.17403","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-diffusion-denoised-smoothing-1","slug":"multi-scale-diffusion-denoised-smoothing-1","title":"Multi-scale Diffusion Denoised Smoothing","date":"2023-10-25","arxiv_id":"2310.16779","repositories_listed":1,"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/multi-scale-diffusion-denoised-smoothing-1#ran","syntology_url":"https://syntology.ai/paper/2310.16779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16779"}},"official":{"repos":["jh-jeong/smoothing-multiscale"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","slug":"deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","arxiv_id":"2310.15653","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/deceptive-fairness-attacks-on-graphs-via-meta#ran","syntology_url":"https://syntology.ai/paper/2310.15653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15653"}},"official":{"repos":["jiank2/fate"],"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":["official"]}}},{"url":"/paper/semantic-aware-adversarial-training-for-1","slug":"semantic-aware-adversarial-training-for-1","title":"Semantic-Aware Adversarial Training for Reliable Deep Hashing Retrieval","date":"2023-10-23","arxiv_id":"2310.14637","repositories_listed":1,"syntology":null},{"url":"/paper/irad-implicit-representation-driven-image","slug":"irad-implicit-representation-driven-image","title":"IRAD: Implicit Representation-driven Image Resampling against Adversarial Attacks","date":"2023-10-18","arxiv_id":"2310.11890","repositories_listed":1,"syntology":null},{"url":"/paper/to-generate-or-not-safety-driven-unlearned","slug":"to-generate-or-not-safety-driven-unlearned","title":"To Generate or Not? Safety-Driven Unlearned Diffusion Models Are Still Easy To Generate Unsafe Images ... For Now","date":"2023-10-18","arxiv_id":"2310.11868","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 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) · 0 unverified","sample_list":"/paper/to-generate-or-not-safety-driven-unlearned#ran","syntology_url":"https://syntology.ai/paper/2310.11868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11868"}},"official":{"repos":["optml-group/diffusion-mu-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"]}}},{"url":"/paper/improving-fast-minimum-norm-attacks-with","slug":"improving-fast-minimum-norm-attacks-with","title":"Improving Fast Minimum-Norm Attacks with Hyperparameter Optimization","date":"2023-10-12","arxiv_id":"2310.08177","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-in-graph-neural-1","slug":"adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","arxiv_id":"2310.06396","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"13 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-robustness-in-graph-neural-1#ran","syntology_url":"https://syntology.ai/paper/2310.06396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06396"}},"official":{"repos":["zknus/neurips-2023-hang-robustness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/comparing-the-robustness-of-modern-no","slug":"comparing-the-robustness-of-modern-no","title":"Comparing the Robustness of Modern No-Reference Image- and Video-Quality Metrics to Adversarial Attacks","date":"2023-10-10","arxiv_id":"2310.06958","repositories_listed":1,"syntology":null},{"url":"/paper/vlattack-multimodal-adversarial-attacks-on","slug":"vlattack-multimodal-adversarial-attacks-on","title":"VLATTACK: Multimodal Adversarial Attacks on Vision-Language Tasks via Pre-trained Models","date":"2023-10-07","arxiv_id":"2310.04655","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/vlattack-multimodal-adversarial-attacks-on#ran","syntology_url":"https://syntology.ai/paper/2310.04655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04655"}},"official":{"repos":["ericyinyzy/vlattack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-representation-learning-via-asymmetric","slug":"robust-representation-learning-via-asymmetric","title":"Enhancing Robust Representation in Adversarial Training: Alignment and Exclusion Criteria","date":"2023-10-05","arxiv_id":"2310.03358","repositories_listed":1,"syntology":null}],"record_sha256":"807b69c2dfb379efb47f48ec0bcca07b8bc1f604541d858b812442676f67027d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}