{"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/6","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":6,"pages_in_order":18,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/adversarial-robustness/papers/7","papers":[{"url":"/paper/a-robust-backpropagation-free-framework-for","slug":"a-robust-backpropagation-free-framework-for","title":"A Robust Backpropagation-Free Framework for Images","date":"2022-06-03","arxiv_id":"2206.01820","repositories_listed":1,"syntology":null},{"url":"/paper/calfat-calibrated-federated-adversarial","slug":"calfat-calibrated-federated-adversarial","title":"CalFAT: Calibrated Federated Adversarial Training with Label Skewness","date":"2022-05-30","arxiv_id":"2205.14926","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/calfat-calibrated-federated-adversarial#ran","syntology_url":"https://syntology.ai/paper/2205.14926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14926"}},"official":{"repos":["cc233/calfat"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-constraints-in-feature-space","slug":"domain-constraints-in-feature-space","title":"Level Up with ML Vulnerability Identification: Leveraging Domain Constraints in Feature Space for Robust Android Malware Detection","date":"2022-05-30","arxiv_id":"2205.15128","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-adversarial-training","slug":"collaborative-adversarial-training","title":"Squeeze Training for Adversarial Robustness","date":"2022-05-23","arxiv_id":"2205.11156","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/collaborative-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2205.11156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11156"}},"official":{"repos":["qizhangli/st-at"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-distribution-aware-testing-of","slug":"hierarchical-distribution-aware-testing-of","title":"Hierarchical Distribution-Aware Testing of Deep Learning","date":"2022-05-17","arxiv_id":"2205.08589","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-membership-inference-through","slug":"evaluating-membership-inference-through","title":"Evaluating Membership Inference Through Adversarial Robustness","date":"2022-05-14","arxiv_id":"2205.06986","repositories_listed":1,"syntology":null},{"url":"/paper/sibylvariant-transformations-for-robust-text","slug":"sibylvariant-transformations-for-robust-text","title":"Sibylvariant Transformations for Robust Text Classification","date":"2022-05-10","arxiv_id":"2205.05137","repositories_listed":1,"syntology":null},{"url":"/paper/towards-theoretical-analysis-of","slug":"towards-theoretical-analysis-of","title":"Towards Theoretical Analysis of Transformation Complexity of ReLU DNNs","date":"2022-05-04","arxiv_id":"2205.01940","repositories_listed":1,"syntology":null},{"url":"/paper/engineering-flexible-machine-learning-systems","slug":"engineering-flexible-machine-learning-systems","title":"Engineering flexible machine learning systems by traversing functionally-invariant paths","date":"2022-04-30","arxiv_id":"2205.00334","repositories_listed":1,"syntology":null},{"url":"/paper/distilling-robust-and-non-robust-features-in-1","slug":"distilling-robust-and-non-robust-features-in-1","title":"Distilling Robust and Non-Robust Features in Adversarial Examples by Information Bottleneck","date":"2022-04-06","arxiv_id":"2204.02735","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"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, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distilling-robust-and-non-robust-features-in-1#ran","syntology_url":"https://syntology.ai/paper/2204.02735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02735"}},"official":{"repos":["ByungKwanLee/Adversarial-Information-Bottleneck"],"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"]}}},{"url":"/paper/masking-adversarial-damage-finding","slug":"masking-adversarial-damage-finding","title":"Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Network","date":"2022-04-06","arxiv_id":"2204.02738","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/masking-adversarial-damage-finding#ran","syntology_url":"https://syntology.ai/paper/2204.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02738"}},"official":{"repos":["ByungKwanLee/Masking-Adversarial-Damage"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-through-the-lens-of-1","slug":"adversarial-robustness-through-the-lens-of-1","title":"Adversarial Robustness through the Lens of Convolutional Filters","date":"2022-04-05","arxiv_id":"2204.02481","repositories_listed":1,"syntology":null},{"url":"/paper/skelevision-towards-adversarial-resiliency-of","slug":"skelevision-towards-adversarial-resiliency-of","title":"SkeleVision: Towards Adversarial Resiliency of Person Tracking with Multi-Task Learning","date":"2022-04-02","arxiv_id":"2204.00734","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-robustify-black-box-ml-models-a-zeroth-1","slug":"how-to-robustify-black-box-ml-models-a-zeroth-1","title":"How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective","date":"2022-03-27","arxiv_id":"2203.14195","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/how-to-robustify-black-box-ml-models-a-zeroth-1#ran","syntology_url":"https://syntology.ai/paper/2203.14195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14195"}},"official":{"repos":["damon-demon/black-box-defense"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-perturbation-constrained-adversarial-attack","slug":"a-perturbation-constrained-adversarial-attack","title":"A Perturbation-Constrained Adversarial Attack for Evaluating the Robustness of Optical Flow","date":"2022-03-24","arxiv_id":"2203.13214","repositories_listed":1,"syntology":null},{"url":"/paper/provable-adversarial-robustness-for","slug":"provable-adversarial-robustness-for","title":"Provable Adversarial Robustness for Fractional Lp Threat Models","date":"2022-03-16","arxiv_id":"2203.08945","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-through-cognitive-dissociation","slug":"robustness-through-cognitive-dissociation","title":"Robustness through Cognitive Dissociation Mitigation in Contrastive Adversarial Training","date":"2022-03-16","arxiv_id":"2203.08959","repositories_listed":1,"syntology":null},{"url":"/paper/practical-evaluation-of-adversarial","slug":"practical-evaluation-of-adversarial","title":"Practical Evaluation of Adversarial Robustness via Adaptive Auto Attack","date":"2022-03-10","arxiv_id":"2203.05154","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/practical-evaluation-of-adversarial#ran","syntology_url":"https://syntology.ai/paper/2203.05154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05154"}},"official":{"repos":["liuye6666/adaptive_auto_attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/joint-rotational-invariance-and-adversarial","slug":"joint-rotational-invariance-and-adversarial","title":"Joint rotational invariance and adversarial training of a dual-stream Transformer yields state of the art Brain-Score for Area V4","date":"2022-03-08","arxiv_id":"2203.06649","repositories_listed":1,"syntology":null},{"url":"/paper/imagenet-patch-a-dataset-for-benchmarking","slug":"imagenet-patch-a-dataset-for-benchmarking","title":"ImageNet-Patch: A Dataset for Benchmarking Machine Learning Robustness against Adversarial Patches","date":"2022-03-07","arxiv_id":"2203.04412","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-of-neural-statistical","slug":"adversarial-robustness-of-neural-statistical","title":"Adversarial Robustness of Neural-Statistical Features in Detection of Generative Transformers","date":"2022-03-02","arxiv_id":"2203.07983","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-verification-of-deep-neural","slug":"neuro-symbolic-verification-of-deep-neural","title":"Neuro-Symbolic Verification of Deep Neural Networks","date":"2022-03-02","arxiv_id":"2203.00938","repositories_listed":1,"syntology":null},{"url":"/paper/global-local-regularization-via","slug":"global-local-regularization-via","title":"Global-Local Regularization Via Distributional Robustness","date":"2022-03-01","arxiv_id":"2203.00553","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-the-adversarial-robustness-of","slug":"evaluating-the-adversarial-robustness-of","title":"Evaluating the Adversarial Robustness of Adaptive Test-time Defenses","date":"2022-02-28","arxiv_id":"2202.13711","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evaluating-the-adversarial-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2202.13711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13711"}},"official":{"repos":["fra31/evaluating-adaptive-test-time-defenses"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/understanding-adversarial-robustness-from","slug":"understanding-adversarial-robustness-from","title":"Understanding Adversarial Robustness from Feature Maps of Convolutional Layers","date":"2022-02-25","arxiv_id":"2202.12435","repositories_listed":1,"syntology":null},{"url":"/paper/improving-robustness-of-convolutional-neural","slug":"improving-robustness-of-convolutional-neural","title":"Improving Robustness of Convolutional Neural Networks Using Element-Wise Activation Scaling","date":"2022-02-24","arxiv_id":"2202.11898","repositories_listed":1,"syntology":null},{"url":"/paper/transferring-adversarial-robustness-through","slug":"transferring-adversarial-robustness-through","title":"Transferring Adversarial Robustness Through Robust Representation Matching","date":"2022-02-21","arxiv_id":"2202.09994","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":0,"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/transferring-adversarial-robustness-through#ran","syntology_url":"https://syntology.ai/paper/2202.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09994"}},"official":{"repos":["ethos-lab/robust-representation-matching"],"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/exploring-adversarially-robust-training-for","slug":"exploring-adversarially-robust-training-for","title":"Exploring Adversarially Robust Training for Unsupervised Domain Adaptation","date":"2022-02-18","arxiv_id":"2202.09300","repositories_listed":1,"syntology":null},{"url":"/paper/white-box-attacks-on-hate-speech-bert","slug":"white-box-attacks-on-hate-speech-bert","title":"White-Box Attacks on Hate-speech BERT Classifiers in German with Explicit and Implicit Character Level Defense","date":"2022-02-11","arxiv_id":"2202.05778","repositories_listed":1,"syntology":null},{"url":"/paper/towards-compositional-adversarial-robustness","slug":"towards-compositional-adversarial-robustness","title":"Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations","date":"2022-02-09","arxiv_id":"2202.04235","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-empirical-effectiveness-of-unrealistic","slug":"on-the-empirical-effectiveness-of-unrealistic","title":"On The Empirical Effectiveness of Unrealistic Adversarial Hardening Against Realistic Adversarial Attacks","date":"2022-02-07","arxiv_id":"2202.03277","repositories_listed":1,"syntology":null},{"url":"/paper/lyanet-a-lyapunov-framework-for-training","slug":"lyanet-a-lyapunov-framework-for-training","title":"LyaNet: A Lyapunov Framework for Training Neural ODEs","date":"2022-02-05","arxiv_id":"2202.02526","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lyanet-a-lyapunov-framework-for-training#ran","syntology_url":"https://syntology.ai/paper/2202.02526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02526"}},"official":{"repos":["ivandariojr/lyapunovlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-unreasonable-effectiveness-of-random-1","slug":"the-unreasonable-effectiveness-of-random-1","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","date":"2022-02-05","arxiv_id":"2202.02643","repositories_listed":1,"syntology":null},{"url":"/paper/finding-biological-plausibility-for-2","slug":"finding-biological-plausibility-for-2","title":"Finding Biological Plausibility for Adversarially Robust Features via Metameric Tasks","date":"2022-02-02","arxiv_id":"2202.00838","repositories_listed":1,"syntology":null},{"url":"/paper/smoothed-embeddings-for-certified-few-shot","slug":"smoothed-embeddings-for-certified-few-shot","title":"Smoothed Embeddings for Certified Few-Shot Learning","date":"2022-02-02","arxiv_id":"2202.01186","repositories_listed":1,"syntology":null},{"url":"/paper/rate-coding-or-direct-coding-which-one-is","slug":"rate-coding-or-direct-coding-which-one-is","title":"Rate Coding or Direct Coding: Which One is Better for Accurate, Robust, and Energy-efficient Spiking Neural Networks?","date":"2022-01-31","arxiv_id":"2202.03133","repositories_listed":1,"syntology":null},{"url":"/paper/garnet-reduced-rank-topology-learning-for","slug":"garnet-reduced-rank-topology-learning-for","title":"GARNET: Reduced-Rank Topology Learning for Robust and Scalable Graph Neural Networks","date":"2022-01-30","arxiv_id":"2201.12741","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/garnet-reduced-rank-topology-learning-for#ran","syntology_url":"https://syntology.ai/paper/2201.12741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12741"}},"official":{"repos":["cornell-zhang/garnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-corruption-and-adversarial","slug":"improving-corruption-and-adversarial","title":"Improving Robustness by Enhancing Weak Subnets","date":"2022-01-30","arxiv_id":"2201.12765","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-corruption-and-adversarial#ran","syntology_url":"https://syntology.ai/paper/2201.12765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12765"}},"official":{"repos":["guoyongcs/ews"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-vulnerability-of-powerful-near","slug":"adversarial-vulnerability-of-powerful-near","title":"Adversarial vulnerability of powerful near out-of-distribution detection","date":"2022-01-18","arxiv_id":"2201.07012","repositories_listed":1,"syntology":null},{"url":"/paper/augly-data-augmentations-for-robustness","slug":"augly-data-augmentations-for-robustness","title":"AugLy: Data Augmentations for Robustness","date":"2022-01-17","arxiv_id":"2201.06494","repositories_listed":1,"syntology":null},{"url":"/paper/on-adversarial-robustness-of-trajectory","slug":"on-adversarial-robustness-of-trajectory","title":"On Adversarial Robustness of Trajectory Prediction for Autonomous Vehicles","date":"2022-01-13","arxiv_id":"2201.05057","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":2,"n_ran_checked":5,"n_instrument":8,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":13,"phrase":"13 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-adversarial-robustness-of-trajectory#ran","syntology_url":"https://syntology.ai/paper/2201.05057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05057"}},"official":null}},{"url":"/paper/how-should-pre-trained-language-models-be-1","slug":"how-should-pre-trained-language-models-be-1","title":"How Should Pre-Trained Language Models Be Fine-Tuned Towards Adversarial Robustness?","date":"2021-12-22","arxiv_id":"2112.11668","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/how-should-pre-trained-language-models-be-1#ran","syntology_url":"https://syntology.ai/paper/2112.11668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11668"}},"official":{"repos":["dongxinshuai/rift-neurips2021"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-adversarial-robustness-of-causal","slug":"on-the-adversarial-robustness-of-causal","title":"On the Adversarial Robustness of Causal Algorithmic Recourse","date":"2021-12-21","arxiv_id":"2112.11313","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-and-improving-the-robustness-of","slug":"analyzing-and-improving-the-robustness-of","title":"Analyzing and Improving the Robustness of Tabular Classifiers using Counterfactual Explanations","date":"2021-12-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-king-is-naked-on-the-notion-of-robustness","slug":"the-king-is-naked-on-the-notion-of-robustness","title":"The King is Naked: on the Notion of Robustness for Natural Language Processing","date":"2021-12-13","arxiv_id":"2112.07605","repositories_listed":1,"syntology":null},{"url":"/paper/attacking-point-cloud-segmentation-with-color","slug":"attacking-point-cloud-segmentation-with-color","title":"On Adversarial Robustness of Point Cloud Semantic Segmentation","date":"2021-12-11","arxiv_id":"2112.05871","repositories_listed":1,"syntology":null},{"url":"/paper/segment-and-complete-defending-object","slug":"segment-and-complete-defending-object","title":"Segment and Complete: Defending Object Detectors against Adversarial Patch Attacks with Robust Patch Detection","date":"2021-12-08","arxiv_id":"2112.04532","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/segment-and-complete-defending-object#ran","syntology_url":"https://syntology.ai/paper/2112.04532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04532"}},"official":{"repos":["joellliu/segmentandcomplete"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/decision-based-black-box-attack-against","slug":"decision-based-black-box-attack-against","title":"Decision-based Black-box Attack Against Vision Transformers via Patch-wise Adversarial Removal","date":"2021-12-07","arxiv_id":"2112.03492","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-local-winner-takes-all-networks","slug":"stochastic-local-winner-takes-all-networks","title":"Stochastic Local Winner-Takes-All Networks Enable Profound Adversarial Robustness","date":"2021-12-05","arxiv_id":"2112.02671","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-local-winner-takes-all-networks#ran","syntology_url":"https://syntology.ai/paper/2112.02671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02671"}},"official":{"repos":["konpanousis/adversarial-lwta-autoattack"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-framework-for-adversarial-attack","slug":"a-unified-framework-for-adversarial-attack","title":"A Unified Framework for Adversarial Attack and Defense in Constrained Feature Space","date":"2021-12-02","arxiv_id":"2112.01156","repositories_listed":1,"syntology":null},{"url":"/paper/training-efficiency-and-robustness-in-deep","slug":"training-efficiency-and-robustness-in-deep","title":"Training Efficiency and Robustness in Deep Learning","date":"2021-12-02","arxiv_id":"2112.01423","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-graph-classifiers-via","slug":"adversarial-attacks-on-graph-classifiers-via","title":"Adversarial Attacks on Graph Classifiers via Bayesian Optimisation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-unified-game-theoretic-view-of","slug":"towards-a-unified-game-theoretic-view-of","title":"Towards a Unified Game-Theoretic View of Adversarial Perturbations and Robustness","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/excon-explanation-driven-supervised-1","slug":"excon-explanation-driven-supervised-1","title":"ExCon: Explanation-driven Supervised Contrastive Learning for Image Classification","date":"2021-11-28","arxiv_id":"2111.14271","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-effect-of-linearized-adversarial","slug":"clustering-effect-of-linearized-adversarial","title":"Clustering Effect of (Linearized) Adversarial Robust Models","date":"2021-11-25","arxiv_id":"2111.12922","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/clustering-effect-of-linearized-adversarial#ran","syntology_url":"https://syntology.ai/paper/2111.12922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12922"}},"official":{"repos":["bymavis/adv_weight_neurips2021"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-and-accurate-object-detection-via-self","slug":"robust-and-accurate-object-detection-via-self","title":"Robust and Accurate Object Detection via Self-Knowledge Distillation","date":"2021-11-14","arxiv_id":"2111.07239","repositories_listed":1,"syntology":null},{"url":"/paper/neural-population-geometry-reveals-the-role","slug":"neural-population-geometry-reveals-the-role","title":"Neural Population Geometry Reveals the Role of Stochasticity in Robust Perception","date":"2021-11-12","arxiv_id":"2111.06979","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/neural-population-geometry-reveals-the-role#ran","syntology_url":"https://syntology.ai/paper/2111.06979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06979"}},"official":{"repos":["chung-neuroai-lab/adversarial-manifolds"],"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/are-transformers-more-robust-than-cnns","slug":"are-transformers-more-robust-than-cnns","title":"Are Transformers More Robust Than CNNs?","date":"2021-11-10","arxiv_id":"2111.05464","repositories_listed":1,"syntology":null},{"url":"/paper/graph-robustness-benchmark-benchmarking-the","slug":"graph-robustness-benchmark-benchmarking-the","title":"Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning","date":"2021-11-08","arxiv_id":"2111.04314","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":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) · 0 unverified","sample_list":"/paper/graph-robustness-benchmark-benchmarking-the#ran","syntology_url":"https://syntology.ai/paper/2111.04314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04314"}},"official":{"repos":["thudm/grb"],"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/a-unified-game-theoretic-interpretation-of","slug":"a-unified-game-theoretic-interpretation-of","title":"A Unified Game-Theoretic Interpretation of Adversarial Robustness","date":"2021-11-05","arxiv_id":"2111.03536","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-graph-classification","slug":"adversarial-attacks-on-graph-classification","title":"Adversarial Attacks on Graph Classification via Bayesian Optimisation","date":"2021-11-04","arxiv_id":"2111.02842","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adversarial-attacks-on-graph-classification#ran","syntology_url":"https://syntology.ai/paper/2111.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02842"}},"official":{"repos":["xingchenwan/grabnel"],"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"]}}},{"url":"/paper/adversarial-glue-a-multi-task-benchmark-for","slug":"adversarial-glue-a-multi-task-benchmark-for","title":"Adversarial GLUE: A Multi-Task Benchmark for Robustness Evaluation of Language Models","date":"2021-11-04","arxiv_id":"2111.02840","repositories_listed":1,"syntology":null},{"url":"/paper/hypmix-hyperbolic-interpolative-data","slug":"hypmix-hyperbolic-interpolative-data","title":"HypMix: Hyperbolic Interpolative Data Augmentation","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/get-fooled-for-the-right-reason-improving","slug":"get-fooled-for-the-right-reason-improving","title":"Get Fooled for the Right Reason: Improving Adversarial Robustness through a Teacher-guided Curriculum Learning Approach","date":"2021-10-30","arxiv_id":"2111.00295","repositories_listed":1,"syntology":null},{"url":"/paper/holistic-deep-learning","slug":"holistic-deep-learning","title":"Holistic Deep Learning","date":"2021-10-29","arxiv_id":"2110.15829","repositories_listed":1,"syntology":null},{"url":"/paper/towards-evaluating-the-robustness-of-neural-2","slug":"towards-evaluating-the-robustness-of-neural-2","title":"Towards Evaluating the Robustness of Neural Networks Learned by Transduction","date":"2021-10-27","arxiv_id":"2110.14735","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/towards-evaluating-the-robustness-of-neural-2#ran","syntology_url":"https://syntology.ai/paper/2110.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14735"}},"official":{"repos":["jfc43/eval-transductive-robustness"],"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/adversarial-robustness-in-multi-task-learning","slug":"adversarial-robustness-in-multi-task-learning","title":"Adversarial Robustness in Multi-Task Learning: Promises and Illusions","date":"2021-10-26","arxiv_id":"2110.15053","repositories_listed":1,"syntology":null},{"url":"/paper/drawing-robust-scratch-tickets-subnetworks","slug":"drawing-robust-scratch-tickets-subnetworks","title":"Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks","date":"2021-10-26","arxiv_id":"2110.14068","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/drawing-robust-scratch-tickets-subnetworks#ran","syntology_url":"https://syntology.ai/paper/2110.14068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14068"}},"official":{"repos":["rice-eic/robust-scratch-ticket"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-for-latent-models","slug":"adversarial-robustness-for-latent-models","title":"Adversarial robustness for latent models: Revisiting the robust-standard accuracies tradeoff","date":"2021-10-22","arxiv_id":"2110.11950","repositories_listed":1,"syntology":null},{"url":"/paper/a-regularization-method-to-improve","slug":"a-regularization-method-to-improve","title":"A Regularization Method to Improve Adversarial Robustness of Neural Networks for ECG Signal Classification","date":"2021-10-19","arxiv_id":"2110.09759","repositories_listed":1,"syntology":null},{"url":"/paper/improving-robustness-using-generated-data","slug":"improving-robustness-using-generated-data","title":"Improving Robustness using Generated Data","date":"2021-10-18","arxiv_id":"2110.09468","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/improving-robustness-using-generated-data#ran","syntology_url":"https://syntology.ai/paper/2110.09468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09468"}},"official":null}},{"url":"/paper/adversarial-attacks-on-ml-defense-models","slug":"adversarial-attacks-on-ml-defense-models","title":"Adversarial Attacks on ML Defense Models Competition","date":"2021-10-15","arxiv_id":"2110.08042","repositories_listed":1,"syntology":null},{"url":"/paper/gated-information-bottleneck-for","slug":"gated-information-bottleneck-for","title":"Gated Information Bottleneck for Generalization in Sequential Environments","date":"2021-10-12","arxiv_id":"2110.06057","repositories_listed":1,"syntology":null},{"url":"/paper/explainability-aware-one-point-attack-for","slug":"explainability-aware-one-point-attack-for","title":"Explainability-Aware One Point Attack for Point Cloud Neural Networks","date":"2021-10-08","arxiv_id":"2110.04158","repositories_listed":1,"syntology":null},{"url":"/paper/neural-tangent-kernel-eigenvalues-accurately","slug":"neural-tangent-kernel-eigenvalues-accurately","title":"The Eigenlearning Framework: A Conservation Law Perspective on Kernel Regression and Wide Neural Networks","date":"2021-10-08","arxiv_id":"2110.03922","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-architectural-ingredients-of","slug":"exploring-architectural-ingredients-of","title":"Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networks","date":"2021-10-07","arxiv_id":"2110.03825","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-architectural-ingredients-of#ran","syntology_url":"https://syntology.ai/paper/2110.03825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03825"}},"official":{"repos":["HanxunH/RobustWRN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-comparison-of-vision","slug":"adversarial-robustness-comparison-of-vision","title":"Adversarial Robustness Comparison of Vision Transformer and MLP-Mixer to CNNs","date":"2021-10-06","arxiv_id":"2110.02797","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-verification-and","slug":"adversarial-robustness-verification-and","title":"Adversarial Robustness Verification and Attack Synthesis in Stochastic Systems","date":"2021-10-05","arxiv_id":"2110.02125","repositories_listed":1,"syntology":null},{"url":"/paper/two-souls-in-an-adversarial-image-towards","slug":"two-souls-in-an-adversarial-image-towards","title":"Two Souls in an Adversarial Image: Towards Universal Adversarial Example Detection using Multi-view Inconsistency","date":"2021-09-25","arxiv_id":"2109.12459","repositories_listed":1,"syntology":null},{"url":"/paper/cc-cert-a-probabilistic-approach-to-certify","slug":"cc-cert-a-probabilistic-approach-to-certify","title":"CC-Cert: A Probabilistic Approach to Certify General Robustness of Neural Networks","date":"2021-09-22","arxiv_id":"2109.10696","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-examples-for-evaluating-math-word","slug":"adversarial-examples-for-evaluating-math-word","title":"Adversarial Examples for Evaluating Math Word Problem Solvers","date":"2021-09-13","arxiv_id":"2109.05925","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-select-one-among-all-an-extensive","slug":"how-to-select-one-among-all-an-extensive","title":"How to Select One Among All? An Extensive Empirical Study Towards the Robustness of Knowledge Distillation in Natural Language Understanding","date":"2021-09-13","arxiv_id":"2109.05696","repositories_listed":1,"syntology":null},{"url":"/paper/robustart-benchmarking-robustness-on","slug":"robustart-benchmarking-robustness-on","title":"RobustART: Benchmarking Robustness on Architecture Design and Training Techniques","date":"2021-09-11","arxiv_id":"2109.05211","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robustart-benchmarking-robustness-on#ran","syntology_url":"https://syntology.ai/paper/2109.05211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05211"}},"official":null}},{"url":"/paper/a-hierarchical-assessment-of-adversarial","slug":"a-hierarchical-assessment-of-adversarial","title":"A Hierarchical Assessment of Adversarial Severity","date":"2021-08-26","arxiv_id":"2108.11785","repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-robust-one-class-novelty","slug":"adversarially-robust-one-class-novelty","title":"Adversarially Robust One-class Novelty Detection","date":"2021-08-25","arxiv_id":"2108.11168","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-real-world-super-resolution","slug":"generalized-real-world-super-resolution","title":"Generalized Real-World Super-Resolution through Adversarial Robustness","date":"2021-08-25","arxiv_id":"2108.11505","repositories_listed":1,"syntology":null},{"url":"/paper/advdrop-adversarial-attack-to-dnns-by","slug":"advdrop-adversarial-attack-to-dnns-by","title":"AdvDrop: Adversarial Attack to DNNs by Dropping Information","date":"2021-08-20","arxiv_id":"2108.09034","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/advdrop-adversarial-attack-to-dnns-by#ran","syntology_url":"https://syntology.ai/paper/2108.09034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09034"}},"official":{"repos":["rjduan/advdrop"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-in-the-face-of-adversaries","slug":"pruning-in-the-face-of-adversaries","title":"Pruning in the Face of Adversaries","date":"2021-08-19","arxiv_id":"2108.08560","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-adversarial-robustness","slug":"revisiting-adversarial-robustness","title":"Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Better","date":"2021-08-18","arxiv_id":"2108.07969","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2108.07969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07969"}},"official":{"repos":["zibojia/rslad"],"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/agkd-bml-defense-against-adversarial-attack","slug":"agkd-bml-defense-against-adversarial-attack","title":"AGKD-BML: Defense Against Adversarial Attack by Attention Guided Knowledge Distillation and Bi-directional Metric Learning","date":"2021-08-13","arxiv_id":"2108.06017","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agkd-bml-defense-against-adversarial-attack#ran","syntology_url":"https://syntology.ai/paper/2108.06017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06017"}},"official":{"repos":["hongw579/agkd-bml"],"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/householder-activations-for-provable","slug":"householder-activations-for-provable","title":"Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100","date":"2021-08-05","arxiv_id":"2108.04062","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/householder-activations-for-provable#ran","syntology_url":"https://syntology.ai/paper/2108.04062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04062"}},"official":{"repos":["singlasahil14/SOC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/advrush-searching-for-adversarially-robust","slug":"advrush-searching-for-adversarially-robust","title":"AdvRush: Searching for Adversarially Robust Neural Architectures","date":"2021-08-03","arxiv_id":"2108.01289","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/advrush-searching-for-adversarially-robust#ran","syntology_url":"https://syntology.ai/paper/2108.01289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01289"}},"official":null}},{"url":"/paper/enhancing-adversarial-robustness-via-test","slug":"enhancing-adversarial-robustness-via-test","title":"Enhancing Adversarial Robustness via Test-time Transformation Ensembling","date":"2021-07-29","arxiv_id":"2107.14110","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/enhancing-adversarial-robustness-via-test#ran","syntology_url":"https://syntology.ai/paper/2107.14110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.14110"}},"official":{"repos":["juancprzs/TTE"],"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/free-hyperbolic-neural-networks-with-limited","slug":"free-hyperbolic-neural-networks-with-limited","title":"Clipped Hyperbolic Classifiers Are Super-Hyperbolic Classifiers","date":"2021-07-23","arxiv_id":"2107.11472","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-scalable-adversarial-training-of","slug":"fast-and-scalable-adversarial-training-of","title":"Fast and Scalable Adversarial Training of Kernel SVM via Doubly Stochastic Gradients","date":"2021-07-21","arxiv_id":"2107.09937","repositories_listed":1,"syntology":null},{"url":"/paper/improving-model-robustness-with-latent-1","slug":"improving-model-robustness-with-latent-1","title":"Improving Model Robustness with Latent Distribution Locally and Globally","date":"2021-07-08","arxiv_id":"2107.04401","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-label-uncertainty-in","slug":"incorporating-label-uncertainty-in","title":"Understanding Intrinsic Robustness Using Label Uncertainty","date":"2021-07-07","arxiv_id":"2107.03250","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/incorporating-label-uncertainty-in#ran","syntology_url":"https://syntology.ai/paper/2107.03250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03250"}},"official":{"repos":["xiaozhanguva/intrinsic_rob_lu"],"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/rails-a-robust-adversarial-immune-inspired-1","slug":"rails-a-robust-adversarial-immune-inspired-1","title":"RAILS: A Robust Adversarial Immune-inspired Learning System","date":"2021-06-27","arxiv_id":"2107.02840","repositories_listed":1,"syntology":null},{"url":"/paper/long-term-cross-adversarial-training-a-robust","slug":"long-term-cross-adversarial-training-a-robust","title":"Long-term Cross Adversarial Training: A Robust Meta-learning Method for Few-shot Classification Tasks","date":"2021-06-22","arxiv_id":"2106.12900","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/long-term-cross-adversarial-training-a-robust#ran","syntology_url":"https://syntology.ai/paper/2106.12900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12900"}},"official":{"repos":["Gnomeek/Long-term-Cross-Adversarial-Training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-robustness-propagation-sharing","slug":"federated-robustness-propagation-sharing","title":"Federated Robustness Propagation: Sharing Robustness in Heterogeneous Federated Learning","date":"2021-06-18","arxiv_id":"2106.10196","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/federated-robustness-propagation-sharing#ran","syntology_url":"https://syntology.ai/paper/2106.10196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10196"}},"official":{"repos":["illidanlab/FedRBN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"82b9cd55759d57730e375ef55ea17154130b3befa8e9f18e95432471b4e9fbf2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}