{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/adversarial-defense/papers/2","list_of":"/task/adversarial-defense","task":"Adversarial Defense","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":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":403,"counts":{"archive_papers_tagged":403,"with_a_code_link":216,"where_syntology_ran_a_sample":66,"not_listed_spam_title":0,"listed":403,"listed_where_code_ran":66,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":51,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":51,"listed_every_run_a_failure_of_syntologys_instrument":15,"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-defense","prev":"/task/adversarial-defense","next":"/task/adversarial-defense/papers/3","papers":[{"url":"/paper/constructing-semantics-aware-adversarial","slug":"constructing-semantics-aware-adversarial","title":"Constructing Semantics-Aware Adversarial Examples with a Probabilistic Perspective","date":"2023-06-01","arxiv_id":"2306.00353","repositories_listed":1,"syntology":null},{"url":"/paper/carso-counter-adversarial-recall-of-synthetic","slug":"carso-counter-adversarial-recall-of-synthetic","title":"Carefully Blending Adversarial Training, Purification, and Aggregation Improves Adversarial Robustness","date":"2023-05-25","arxiv_id":"2306.06081","repositories_listed":1,"syntology":null},{"url":"/paper/mist-towards-improved-adversarial-examples","slug":"mist-towards-improved-adversarial-examples","title":"Mist: Towards Improved Adversarial Examples for Diffusion Models","date":"2023-05-22","arxiv_id":"2305.12683","repositories_listed":1,"syntology":null},{"url":"/paper/masked-language-model-based-textual","slug":"masked-language-model-based-textual","title":"Masked Language Model Based Textual Adversarial Example Detection","date":"2023-04-18","arxiv_id":"2304.08767","repositories_listed":1,"syntology":null},{"url":"/paper/robust-mode-connectivity-oriented-adversarial","slug":"robust-mode-connectivity-oriented-adversarial","title":"Robust Mode Connectivity-Oriented Adversarial Defense: Enhancing Neural Network Robustness Against Diversified $\\ell_p$ Attacks","date":"2023-03-17","arxiv_id":"2303.10225","repositories_listed":1,"syntology":null},{"url":"/paper/among-us-adversarially-robust-collaborative","slug":"among-us-adversarially-robust-collaborative","title":"Among Us: Adversarially Robust Collaborative Perception by Consensus","date":"2023-03-16","arxiv_id":"2303.09495","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/among-us-adversarially-robust-collaborative#ran","syntology_url":"https://syntology.ai/paper/2303.09495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09495"}},"official":{"repos":["coperception/robosac"],"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/beyond-pretrained-features-noisy-image-1","slug":"beyond-pretrained-features-noisy-image-1","title":"Beyond Pretrained Features: Noisy Image Modeling Provides Adversarial Defense","date":"2023-02-02","arxiv_id":"2302.01056","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"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 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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/beyond-pretrained-features-noisy-image-1#ran","syntology_url":"https://syntology.ai/paper/2302.01056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01056"}},"official":{"repos":["youzunzhi/nim-advdef"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/anchor-based-adversarially-robust-zero-shot","slug":"anchor-based-adversarially-robust-zero-shot","title":"Language-Driven Anchors for Zero-Shot Adversarial Robustness","date":"2023-01-30","arxiv_id":"2301.13096","repositories_listed":1,"syntology":null},{"url":"/paper/textgrad-advancing-robustness-evaluation-in","slug":"textgrad-advancing-robustness-evaluation-in","title":"TextGrad: Advancing Robustness Evaluation in NLP by Gradient-Driven Optimization","date":"2022-12-19","arxiv_id":"2212.09254","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/textgrad-advancing-robustness-evaluation-in#ran","syntology_url":"https://syntology.ai/paper/2212.09254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09254"}},"official":{"repos":["ucsb-nlp-chang/textgrad"],"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/unfolding-local-growth-rate-estimates-for","slug":"unfolding-local-growth-rate-estimates-for","title":"Unfolding Local Growth Rate Estimates for (Almost) Perfect Adversarial Detection","date":"2022-12-13","arxiv_id":"2212.06776","repositories_listed":1,"syntology":null},{"url":"/paper/disco-adversarial-defense-with-local-implicit","slug":"disco-adversarial-defense-with-local-implicit","title":"DISCO: Adversarial Defense with Local Implicit Functions","date":"2022-12-11","arxiv_id":"2212.05630","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-learning-with-information-gain-1","slug":"bayesian-learning-with-information-gain-1","title":"Bayesian Learning with Information Gain Provably Bounds Risk for a Robust Adversarial Defense","date":"2022-12-05","arxiv_id":"2212.02003","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/bayesian-learning-with-information-gain-1#ran","syntology_url":"https://syntology.ai/paper/2212.02003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02003"}},"official":{"repos":["baogiadoan/IG-BNN"],"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/toward-robust-diagnosis-a-contour-attention","slug":"toward-robust-diagnosis-a-contour-attention","title":"Toward Robust Diagnosis: A Contour Attention Preserving Adversarial Defense for COVID-19 Detection","date":"2022-11-30","arxiv_id":"2211.16806","repositories_listed":1,"syntology":null},{"url":"/paper/game-theoretic-mixed-experts-for","slug":"game-theoretic-mixed-experts-for","title":"Game Theoretic Mixed Experts for Combinational Adversarial Machine Learning","date":"2022-11-26","arxiv_id":"2211.14669","repositories_listed":1,"syntology":null},{"url":"/paper/are-you-stealing-my-model-sample-correlation","slug":"are-you-stealing-my-model-sample-correlation","title":"Are You Stealing My Model? Sample Correlation for Fingerprinting Deep Neural Networks","date":"2022-10-21","arxiv_id":"2210.15427","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-adversarial-training-to-large","slug":"scaling-adversarial-training-to-large","title":"Scaling Adversarial Training to Large Perturbation Bounds","date":"2022-10-18","arxiv_id":"2210.09852","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scaling-adversarial-training-to-large#ran","syntology_url":"https://syntology.ai/paper/2210.09852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09852"}},"official":{"repos":["val-iisc/oaat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a2-efficient-automated-attacker-for-boosting","slug":"a2-efficient-automated-attacker-for-boosting","title":"A2: Efficient Automated Attacker for Boosting Adversarial Training","date":"2022-10-07","arxiv_id":"2210.03543","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"9 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a2-efficient-automated-attacker-for-boosting#ran","syntology_url":"https://syntology.ai/paper/2210.03543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03543"}},"official":{"repos":["alipay/A2-efficient-automated-attacker-for-boosting-adversarial-training"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-robust-prototypical-few-shot","slug":"adversarially-robust-prototypical-few-shot","title":"Adversarially Robust Prototypical Few-shot Segmentation with Neural-ODEs","date":"2022-10-07","arxiv_id":"2210.03429","repositories_listed":1,"syntology":null},{"url":"/paper/robust-node-classification-on-graphs-jointly","slug":"robust-node-classification-on-graphs-jointly","title":"Robust Node Classification on Graphs: Jointly from Bayesian Label Transition and Topology-based Label Propagation","date":"2022-08-21","arxiv_id":"2208.09779","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-via-mutual","slug":"improving-adversarial-robustness-via-mutual","title":"Improving Adversarial Robustness via Mutual Information Estimation","date":"2022-07-25","arxiv_id":"2207.12203","repositories_listed":1,"syntology":null},{"url":"/paper/decorrelative-network-architecture-for-robust","slug":"decorrelative-network-architecture-for-robust","title":"Decorrelative Network Architecture for Robust Electrocardiogram Classification","date":"2022-07-19","arxiv_id":"2207.09031","repositories_listed":1,"syntology":null},{"url":"/paper/defending-substitution-based-profile","slug":"defending-substitution-based-profile","title":"Defending Substitution-Based Profile Pollution Attacks on Sequential Recommenders","date":"2022-07-19","arxiv_id":"2207.11237","repositories_listed":1,"syntology":null},{"url":"/paper/threat-model-agnostic-adversarial-defense","slug":"threat-model-agnostic-adversarial-defense","title":"Threat Model-Agnostic Adversarial Defense using Diffusion Models","date":"2022-07-17","arxiv_id":"2207.08089","repositories_listed":1,"syntology":null},{"url":"/paper/perturbation-inactivation-based-adversarial","slug":"perturbation-inactivation-based-adversarial","title":"Perturbation Inactivation Based Adversarial Defense for Face Recognition","date":"2022-07-13","arxiv_id":"2207.06035","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-and-extensions-of-adversarial","slug":"analysis-and-extensions-of-adversarial","title":"Analysis and Extensions of Adversarial Training for Video Classification","date":"2022-06-16","arxiv_id":"2206.07953","repositories_listed":1,"syntology":null},{"url":"/paper/carla-gear-a-dataset-generator-for-a","slug":"carla-gear-a-dataset-generator-for-a","title":"CARLA-GeAR: a Dataset Generator for a Systematic Evaluation of Adversarial Robustness of Vision Models","date":"2022-06-09","arxiv_id":"2206.04365","repositories_listed":1,"syntology":null},{"url":"/paper/ebm-life-cycle-mcmc-strategies-for-synthesis-1","slug":"ebm-life-cycle-mcmc-strategies-for-synthesis-1","title":"EBM Life Cycle: MCMC Strategies for Synthesis, Defense, and Density Modeling","date":"2022-05-24","arxiv_id":"2205.12243","repositories_listed":1,"syntology":null},{"url":"/paper/detection-of-adversarial-examples-in-text","slug":"detection-of-adversarial-examples-in-text","title":"Detection of Adversarial Examples in Text Classification: Benchmark and Baseline via Robust Density Estimation","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-recoverable-adversarial-examples-a-new","slug":"self-recoverable-adversarial-examples-a-new","title":"Self-recoverable Adversarial Examples: A New Effective Protection Mechanism in Social Networks","date":"2022-04-26","arxiv_id":"2204.12050","repositories_listed":1,"syntology":null},{"url":"/paper/guard-graph-universal-adversarial-defense","slug":"guard-graph-universal-adversarial-defense","title":"GUARD: Graph Universal Adversarial Defense","date":"2022-04-20","arxiv_id":"2204.09803","repositories_listed":1,"syntology":null},{"url":"/paper/centralized-adversarial-learning-for-robust","slug":"centralized-adversarial-learning-for-robust","title":"CgAT: Center-Guided Adversarial Training for Deep Hashing-Based Retrieval","date":"2022-04-18","arxiv_id":"2204.10779","repositories_listed":1,"syntology":null},{"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/open-set-adversarial-defense-with-clean","slug":"open-set-adversarial-defense-with-clean","title":"Open-set Adversarial Defense with Clean-Adversarial Mutual Learning","date":"2022-02-12","arxiv_id":"2202.05953","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attack-and-defense-of-yolo","slug":"adversarial-attack-and-defense-of-yolo","title":"Adversarial Attack and Defense of YOLO Detectors in Autonomous Driving Scenarios","date":"2022-02-10","arxiv_id":"2202.04781","repositories_listed":1,"syntology":null},{"url":"/paper/layer-wise-regularized-adversarial-training","slug":"layer-wise-regularized-adversarial-training","title":"Layer-wise Regularized Adversarial Training using Layers Sustainability Analysis (LSA) framework","date":"2022-02-05","arxiv_id":"2202.02626","repositories_listed":1,"syntology":null},{"url":"/paper/super-efficient-super-resolution-for-fast","slug":"super-efficient-super-resolution-for-fast","title":"Super-Efficient Super Resolution for Fast Adversarial Defense at the Edge","date":"2021-12-29","arxiv_id":"2112.14340","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-modeling-against-adversarial-attacks","slug":"adaptive-modeling-against-adversarial-attacks","title":"Adaptive Modeling Against Adversarial Attacks","date":"2021-12-23","arxiv_id":"2112.12431","repositories_listed":1,"syntology":null},{"url":"/paper/all-you-need-is-raw-defending-against","slug":"all-you-need-is-raw-defending-against","title":"All You Need is RAW: Defending Against Adversarial Attacks with Camera Image Pipelines","date":"2021-12-16","arxiv_id":"2112.09219","repositories_listed":1,"syntology":null},{"url":"/paper/nomaro-defending-against-adversarial-attacks","slug":"nomaro-defending-against-adversarial-attacks","title":"NOMARO: Defending against Adversarial Attacks by NOMA-Inspired Reconstruction Operation","date":"2021-12-14","arxiv_id":null,"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/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/back-to-reality-leveraging-pattern-driven","slug":"back-to-reality-leveraging-pattern-driven","title":"LSA: Modeling Aspect Sentiment Coherency via Local Sentiment Aggregation","date":"2021-10-16","arxiv_id":"2110.08604","repositories_listed":1,"syntology":null},{"url":"/paper/game-theory-for-adversarial-attacks-and","slug":"game-theory-for-adversarial-attacks-and","title":"Game Theory for Adversarial Attacks and Defenses","date":"2021-10-08","arxiv_id":"2110.06166","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/modelling-adversarial-noise-for-adversarial","slug":"modelling-adversarial-noise-for-adversarial","title":"Modeling Adversarial Noise for Adversarial Training","date":"2021-09-21","arxiv_id":"2109.09901","repositories_listed":1,"syntology":null},{"url":"/paper/dropattack-a-masked-weight-adversarial","slug":"dropattack-a-masked-weight-adversarial","title":"DropAttack: A Masked Weight Adversarial Training Method to Improve Generalization of Neural Networks","date":"2021-08-29","arxiv_id":"2108.12805","repositories_listed":1,"syntology":null},{"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/voting-for-the-right-answer-adversarial","slug":"voting-for-the-right-answer-adversarial","title":"Voting for the right answer: Adversarial defense for speaker verification","date":"2021-06-15","arxiv_id":"2106.07868","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-via-fisher-rao","slug":"adversarial-robustness-via-fisher-rao","title":"Adversarial Robustness via Fisher-Rao Regularization","date":"2021-06-12","arxiv_id":"2106.06685","repositories_listed":1,"syntology":null},{"url":"/paper/salient-feature-extractor-for-adversarial","slug":"salient-feature-extractor-for-adversarial","title":"Salient Feature Extractor for Adversarial Defense on Deep Neural Networks","date":"2021-05-14","arxiv_id":"2105.06807","repositories_listed":1,"syntology":null},{"url":"/paper/the-art-of-defense-letting-networks-fool-the","slug":"the-art-of-defense-letting-networks-fool-the","title":"The art of defense: letting networks fool the attacker","date":"2021-04-07","arxiv_id":"2104.02963","repositories_listed":1,"syntology":null},{"url":"/paper/libre-a-practical-bayesian-approach-to","slug":"libre-a-practical-bayesian-approach-to","title":"LiBRe: A Practical Bayesian Approach to Adversarial Detection","date":"2021-03-27","arxiv_id":"2103.14835","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/libre-a-practical-bayesian-approach-to#ran","syntology_url":"https://syntology.ai/paper/2103.14835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.14835"}},"official":{"repos":["thudzj/ScalableBDL"],"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/learning-defense-transformers-for","slug":"learning-defense-transformers-for","title":"Learning Defense Transformers for Counterattacking Adversarial Examples","date":"2021-03-13","arxiv_id":"2103.07595","repositories_listed":1,"syntology":null},{"url":"/paper/sandwich-batch-normalization-1","slug":"sandwich-batch-normalization-1","title":"Sandwich Batch Normalization: A Drop-In Replacement for Feature Distribution Heterogeneity","date":"2021-02-22","arxiv_id":"2102.11382","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-data-augmentation-for-person-re","slug":"an-effective-data-augmentation-for-person-re","title":"Eliminate Deviation with Deviation for Data Augmentation and a General Multi-modal Data Learning Method","date":"2021-01-21","arxiv_id":"2101.08533","repositories_listed":1,"syntology":null},{"url":"/paper/defending-against-black-box-adversarial","slug":"defending-against-black-box-adversarial","title":"Defending against black-box adversarial attacks with gradient-free trained sign activation neural networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-adversarial-robustness-of-bayesian","slug":"towards-adversarial-robustness-of-bayesian","title":"Towards Adversarial Robustness of Bayesian Neural Network through Hierarchical Variational Inference","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-and-improving-generative-1","slug":"analyzing-and-improving-generative-1","title":"Learning Energy-Based Models With Adversarial Training","date":"2020-12-11","arxiv_id":"2012.06568","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-adversarial-attacks-and-defenses-on","slug":"geometric-adversarial-attacks-and-defenses-on","title":"Geometric Adversarial Attacks and Defenses on 3D Point Clouds","date":"2020-12-10","arxiv_id":"2012.05657","repositories_listed":1,"syntology":null},{"url":"/paper/guided-adversarial-attack-for-evaluating-and-1","slug":"guided-adversarial-attack-for-evaluating-and-1","title":"Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defenses","date":"2020-11-30","arxiv_id":"2011.14969","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-power-of-abstention-and-data-driven-1","slug":"on-the-power-of-abstention-and-data-driven-1","title":"An Analysis of Robustness of Non-Lipschitz Networks","date":"2020-10-13","arxiv_id":"2010.06154","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-power-of-abstention-and-data-driven-1#ran","syntology_url":"https://syntology.ai/paper/2010.06154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06154"}},"official":{"repos":["dravyanshsharma/adversarial-contrastive"],"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/adversarial-robustness-of-stabilized","slug":"adversarial-robustness-of-stabilized","title":"Adversarial Robustness of Stabilized NeuralODEs Might be from Obfuscated Gradients","date":"2020-09-28","arxiv_id":"2009.13145","repositories_listed":1,"syntology":null},{"url":"/paper/graph-adversarial-networks-protecting","slug":"graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","arxiv_id":"2009.13504","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 5 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) · 0 unverified","sample_list":"/paper/graph-adversarial-networks-protecting#ran","syntology_url":"https://syntology.ai/paper/2009.13504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13504"}},"official":{"repos":["liaopeiyuan/GAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stereopagnosia-fooling-stereo-networks-with","slug":"stereopagnosia-fooling-stereo-networks-with","title":"Stereopagnosia: Fooling Stereo Networks with Adversarial Perturbations","date":"2020-09-21","arxiv_id":"2009.10142","repositories_listed":1,"syntology":null},{"url":"/paper/open-set-adversarial-defense","slug":"open-set-adversarial-defense","title":"Open-set Adversarial Defense","date":"2020-09-02","arxiv_id":"2009.00814","repositories_listed":1,"syntology":null},{"url":"/paper/simaug-learning-robust-representations-from-1","slug":"simaug-learning-robust-representations-from-1","title":"SimAug: Learning Robust Representations from Simulation for Trajectory Prediction","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stylized-adversarial-defense","slug":"stylized-adversarial-defense","title":"Stylized Adversarial Defense","date":"2020-07-29","arxiv_id":"2007.14672","repositories_listed":1,"syntology":null},{"url":"/paper/multitask-learning-strengthens-adversarial","slug":"multitask-learning-strengthens-adversarial","title":"Multitask Learning Strengthens Adversarial Robustness","date":"2020-07-14","arxiv_id":"2007.07236","repositories_listed":1,"syntology":null},{"url":"/paper/boundary-thickness-and-robustness-in-learning","slug":"boundary-thickness-and-robustness-in-learning","title":"Boundary thickness and robustness in learning models","date":"2020-07-09","arxiv_id":"2007.05086","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/boundary-thickness-and-robustness-in-learning#ran","syntology_url":"https://syntology.ai/paper/2007.05086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05086"}},"official":{"repos":["nsfzyzz/boundary_thickness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-framework-for-analyzing-and","slug":"a-unified-framework-for-analyzing-and","title":"Can We Mitigate Backdoor Attack Using Adversarial Detection Methods?","date":"2020-06-26","arxiv_id":"2006.14871","repositories_listed":1,"syntology":null},{"url":"/paper/smooth-adversarial-training","slug":"smooth-adversarial-training","title":"Smooth Adversarial Training","date":"2020-06-25","arxiv_id":"2006.14536","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/smooth-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2006.14536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14536"}},"official":{"repos":["cihangxie/SmoothAdversarialTraining"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/defending-against-adversarial-attacks-on","slug":"defending-against-adversarial-attacks-on","title":"Defending against adversarial attacks on medical imaging AI system, classification or detection?","date":"2020-06-24","arxiv_id":"2006.13555","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-adversarial-perturbations-for","slug":"targeted-adversarial-perturbations-for","title":"Targeted Adversarial Perturbations for Monocular Depth Prediction","date":"2020-06-12","arxiv_id":"2006.08602","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-image-generation-and-training-for","slug":"adversarial-image-generation-and-training-for","title":"mFI-PSO: A Flexible and Effective Method in Adversarial Image Generation for Deep Neural Networks","date":"2020-06-05","arxiv_id":"2006.03243","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-security-adversarial-defense-using","slug":"stochastic-security-adversarial-defense-using","title":"Stochastic Security: Adversarial Defense Using Long-Run Dynamics of Energy-Based Models","date":"2020-05-27","arxiv_id":"2005.13525","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/stochastic-security-adversarial-defense-using#ran","syntology_url":"https://syntology.ai/paper/2005.13525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13525"}},"official":{"repos":["point0bar1/ebm-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/rain-robust-and-accurate-classification","slug":"rain-robust-and-accurate-classification","title":"RAIN: A Simple Approach for Robust and Accurate Image Classification Networks","date":"2020-04-24","arxiv_id":"2004.14798","repositories_listed":1,"syntology":null},{"url":"/paper/simaug-learning-robust-representations-from","slug":"simaug-learning-robust-representations-from","title":"SimAug: Learning Robust Representations from 3D Simulation for Pedestrian Trajectory Prediction in Unseen Cameras","date":"2020-04-04","arxiv_id":"2004.02022","repositories_listed":1,"syntology":null},{"url":"/paper/toward-adversarial-robustness-via-semi","slug":"toward-adversarial-robustness-via-semi","title":"Toward Adversarial Robustness via Semi-supervised Robust Training","date":"2020-03-16","arxiv_id":"2003.06974","repositories_listed":1,"syntology":null},{"url":"/paper/learn2perturb-an-end-to-end-feature","slug":"learn2perturb-an-end-to-end-feature","title":"Learn2Perturb: an End-to-end Feature Perturbation Learning to Improve Adversarial Robustness","date":"2020-03-02","arxiv_id":"2003.01090","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/learn2perturb-an-end-to-end-feature#ran","syntology_url":"https://syntology.ai/paper/2003.01090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01090"}},"official":null}},{"url":"/paper/certification-of-semantic-perturbations-via","slug":"certification-of-semantic-perturbations-via","title":"Certified Defense to Image Transformations via Randomized Smoothing","date":"2020-02-27","arxiv_id":"2002.12463","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/certification-of-semantic-perturbations-via#ran","syntology_url":"https://syntology.ai/paper/2002.12463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12463"}},"official":{"repos":["eth-sri/transformation-smoothing"],"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/parot-a-practical-framework-for-robust-deep","slug":"parot-a-practical-framework-for-robust-deep","title":"PaRoT: A Practical Framework for Robust Deep Neural Network Training","date":"2020-01-07","arxiv_id":"2001.02152","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/parot-a-practical-framework-for-robust-deep#ran","syntology_url":"https://syntology.ai/paper/2001.02152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02152"}},"official":{"repos":["fiveai/parot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/defensive-few-shot-adversarial-learning","slug":"defensive-few-shot-adversarial-learning","title":"Defensive Few-shot Learning","date":"2019-11-16","arxiv_id":"1911.06968","repositories_listed":1,"syntology":null},{"url":"/paper/graphdefense-towards-robust-graph","slug":"graphdefense-towards-robust-graph","title":"GraphDefense: Towards Robust Graph Convolutional Networks","date":"2019-11-11","arxiv_id":"1911.04429","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-defense-against-adversarial-images","slug":"a-new-defense-against-adversarial-images","title":"A New Defense Against Adversarial Images: Turning a Weakness into a Strength","date":"2019-10-16","arxiv_id":"1910.07629","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-defense-against-adversarial-images#ran","syntology_url":"https://syntology.ai/paper/1910.07629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07629"}},"official":{"repos":["s-huu/TurningWeaknessIntoStrength"],"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":["official"]}}},{"url":"/paper/adversarial-defense-via-learning-to-generate","slug":"adversarial-defense-via-learning-to-generate","title":"Adversarial Defense via Learning to Generate Diverse Attacks","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/natural-language-adversarial-attacks-and","slug":"natural-language-adversarial-attacks-and","title":"Natural Language Adversarial Defense through Synonym Encoding","date":"2019-09-15","arxiv_id":"1909.06723","repositories_listed":1,"syntology":null},{"url":"/paper/white-box-adversarial-defense-via-self","slug":"white-box-adversarial-defense-via-self","title":"White-Box Adversarial Defense via Self-Supervised Data Estimation","date":"2019-09-13","arxiv_id":"1909.06271","repositories_listed":1,"syntology":null},{"url":"/paper/gated-convolutional-networks-with-hybrid","slug":"gated-convolutional-networks-with-hybrid","title":"Gated Convolutional Networks with Hybrid Connectivity for Image Classification","date":"2019-08-26","arxiv_id":"1908.09699","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gated-convolutional-networks-with-hybrid#ran","syntology_url":"https://syntology.ai/paper/1908.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09699"}},"official":{"repos":["winycg/HCGNet"],"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":["official","unlocated"]}}},{"url":"/paper/adversarial-defense-by-suppressing-high","slug":"adversarial-defense-by-suppressing-high","title":"Adversarial Defense by Suppressing High-frequency Components","date":"2019-08-19","arxiv_id":"1908.06566","repositories_listed":1,"syntology":null},{"url":"/paper/defending-against-adversarial-attacks-through","slug":"defending-against-adversarial-attacks-through","title":"Defending Against Universal Attacks Through Selective Feature Regeneration","date":"2019-06-08","arxiv_id":"1906.03444","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-examples-for-non-parametric","slug":"adversarial-examples-for-non-parametric","title":"Robustness for Non-Parametric Classification: A Generic Attack and Defense","date":"2019-06-07","arxiv_id":"1906.03310","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/adversarial-examples-for-non-parametric#ran","syntology_url":"https://syntology.ai/paper/1906.03310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03310"}},"official":{"repos":["yangarbiter/adversarial-nonparametrics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/reliable-classification-explanations-via","slug":"reliable-classification-explanations-via","title":"Adversarial Explanations for Understanding Image Classification Decisions and Improved Neural Network Robustness","date":"2019-06-07","arxiv_id":"1906.02896","repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-direction-and-norm-for-efficient-1","slug":"decoupling-direction-and-norm-for-efficient-1","title":"Decoupling Direction and Norm for Efficient Gradient-Based L2 Adversarial Attacks and Defenses","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scaleable-input-gradient-regularization-for","slug":"scaleable-input-gradient-regularization-for","title":"Scaleable input gradient regularization for adversarial robustness","date":"2019-05-27","arxiv_id":"1905.11468","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/scaleable-input-gradient-regularization-for#ran","syntology_url":"https://syntology.ai/paper/1905.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11468"}},"official":{"repos":["cfinlay/tulip"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/resisting-adversarial-attacks-by-k-winners","slug":"resisting-adversarial-attacks-by-k-winners","title":"Enhancing Adversarial Defense by k-Winners-Take-All","date":"2019-05-25","arxiv_id":"1905.10510","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-risks-of-securing-machine-learning","slug":"privacy-risks-of-securing-machine-learning","title":"Privacy Risks of Securing Machine Learning Models against Adversarial Examples","date":"2019-05-24","arxiv_id":"1905.10291","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/privacy-risks-of-securing-machine-learning#ran","syntology_url":"https://syntology.ai/paper/1905.10291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10291"}},"official":{"repos":["inspire-group/privacy-vs-robustness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gotta-catch-em-all-using-concealed-trapdoors","slug":"gotta-catch-em-all-using-concealed-trapdoors","title":"Gotta Catch 'Em All: Using Honeypots to Catch Adversarial Attacks on Neural Networks","date":"2019-04-18","arxiv_id":"1904.08554","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-defense-by-restricting-the-hidden","slug":"adversarial-defense-by-restricting-the-hidden","title":"Adversarial Defense by Restricting the Hidden Space of Deep Neural Networks","date":"2019-04-01","arxiv_id":"1904.00887","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-defense-by-restricting-the-hidden#ran","syntology_url":"https://syntology.ai/paper/1904.00887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00887"}},"official":{"repos":["aamir-mustafa/pcl-adversarial-defense"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-provable-defense-for-deep-residual-networks","slug":"a-provable-defense-for-deep-residual-networks","title":"A Provable Defense for Deep Residual Networks","date":"2019-03-29","arxiv_id":"1903.12519","repositories_listed":1,"syntology":null},{"url":"/paper/fast-bayesian-uncertainty-estimation-of-batch","slug":"fast-bayesian-uncertainty-estimation-of-batch","title":"Fast Bayesian Uncertainty Estimation and Reduction of Batch Normalized Single Image Super-Resolution Network","date":"2019-03-22","arxiv_id":"1903.09410","repositories_listed":1,"syntology":null}],"record_sha256":"3fc93932df41d3c08baa5f60b8d4841921657f406c05841106943a37e697b3c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}