{"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/13","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":13,"pages_in_order":18,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/adversarial-robustness/papers/14","papers":[{"url":null,"slug":"delving-into-the-adversarial-robustness-of","title":"Delving into the Adversarial Robustness of Federated Learning","date":"2023-02-19","arxiv_id":"2302.09479","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-noise-injection-based-training-scheme","title":"A Novel Noise Injection-based Training Scheme for Better Model Robustness","date":"2023-02-17","arxiv_id":"2302.10802","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-contrastive-distillation-with","title":"Adversarial Contrastive Distillation with Adaptive Denoising","date":"2023-02-17","arxiv_id":"2302.08764","repositories_listed":0,"syntology":null},{"url":null,"slug":"function-composition-in-trustworthy-machine","title":"Function Composition in Trustworthy Machine Learning: Implementation Choices, Insights, and Questions","date":"2023-02-17","arxiv_id":"2302.09190","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-equality-in-machine-learning","title":"Measuring Equality in Machine Learning Security Defenses: A Case Study in Speech Recognition","date":"2023-02-17","arxiv_id":"2302.08973","repositories_listed":0,"syntology":null},{"url":null,"slug":"xplorenas-explore-adversarially-robust","title":"XploreNAS: Explore Adversarially Robust & Hardware-efficient Neural Architectures for Non-ideal Xbars","date":"2023-02-15","arxiv_id":"2302.07769","repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-robustness-certificates-exploiting","title":"Collective Robustness Certificates: Exploiting Interdependence in Graph Neural Networks","date":"2023-02-06","arxiv_id":"2302.02829","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperbolic-contrastive-learning","title":"Hyperbolic Contrastive Learning","date":"2023-02-02","arxiv_id":"2302.01409","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-robustness-of-prompt-based-semantic","title":"On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex","date":"2023-01-30","arxiv_id":"2301.12868","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-adversarial-realism-and-robust","title":"Towards Adversarial Realism and Robust Learning for IoT Intrusion Detection and Classification","date":"2023-01-30","arxiv_id":"2301.13122","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-optimization-with-robustness","title":"Certifiably Robust Reinforcement Learning through Model-Based Abstract Interpretation","date":"2023-01-26","arxiv_id":"2301.11374","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-unrestricted-adversarial-training","title":"Provable Unrestricted Adversarial Training without Compromise with Generalizability","date":"2023-01-22","arxiv_id":"2301.09069","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-shifted-adversarial-training","title":"Phase-shifted Adversarial Training","date":"2023-01-12","arxiv_id":"2301.04785","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-adversarial-robustness-and-the-use-of","title":"On adversarial robustness and the use of Wasserstein ascent-descent dynamics to enforce it","date":"2023-01-09","arxiv_id":"2301.03662","repositories_listed":0,"syntology":null},{"url":null,"slug":"guidance-through-surrogate-towards-a-generic","title":"Guidance Through Surrogate: Towards a Generic Diagnostic Attack","date":"2022-12-30","arxiv_id":"2212.14875","repositories_listed":0,"syntology":null},{"url":null,"slug":"frequency-regularization-for-improving","title":"Frequency Regularization for Improving Adversarial Robustness","date":"2022-12-24","arxiv_id":"2212.12732","repositories_listed":0,"syntology":null},{"url":null,"slug":"in-and-out-of-domain-text-adversarial","title":"In and Out-of-Domain Text Adversarial Robustness via Label Smoothing","date":"2022-12-20","arxiv_id":"2212.10258","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-the-adversarial-robustness-of","title":"Estimating the Adversarial Robustness of Attributions in Text with Transformers","date":"2022-12-18","arxiv_id":"2212.09155","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-evaluating-adversarial-robustness-of-chest","title":"On Evaluating Adversarial Robustness of Chest X-ray Classification: Pitfalls and Best Practices","date":"2022-12-15","arxiv_id":"2212.08130","repositories_listed":0,"syntology":null},{"url":null,"slug":"2212-13989","title":"AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical Applications with Categorical Inputs","date":"2022-12-13","arxiv_id":"2212.13989","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-robust-video-perception-by","title":"Adversarially Robust Video Perception by Seeing Motion","date":"2022-12-13","arxiv_id":"2212.07815","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-implies-privacy-in-statistical","title":"Robustness Implies Privacy in Statistical Estimation","date":"2022-12-09","arxiv_id":"2212.05015","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-quantum-adversarial-robustness-by","title":"Enhancing Quantum Adversarial Robustness by Randomized Encodings","date":"2022-12-05","arxiv_id":"2212.02531","repositories_listed":0,"syntology":null},{"url":null,"slug":"cstar-towards-compact-and-structured-deep","title":"CSTAR: Towards Compact and STructured Deep Neural Networks with Adversarial Robustness","date":"2022-12-04","arxiv_id":"2212.01957","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-policy-iteration-for-zero-sum","title":"Smoothing Policy Iteration for Zero-sum Markov Games","date":"2022-12-03","arxiv_id":"2212.01623","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-and-improving-jacobian-and","title":"Generalizing and Improving Jacobian and Hessian Regularization","date":"2022-12-01","arxiv_id":"2212.00311","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-training-procedure","title":"Deep Learning Training Procedure Augmentations","date":"2022-11-25","arxiv_id":"2211.14395","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-robust-generalization-by-direct-pac","title":"Improving Robust Generalization by Direct PAC-Bayesian Bound Minimization","date":"2022-11-22","arxiv_id":"2211.12624","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-greener-solutions-for-steering-angle","title":"Enhancing Accuracy and Robustness of Steering Angle Prediction with Attention Mechanism","date":"2022-11-21","arxiv_id":"2211.11133","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-adversarial-robustness-of-deep-vision","title":"Towards Adversarial Robustness of Deep Vision Algorithms","date":"2022-11-19","arxiv_id":"2211.10670","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizable-deepfake-detection-with-phase","title":"Generalizable Deepfake Detection with Phase-Based Motion Analysis","date":"2022-11-17","arxiv_id":"2211.09363","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-optimizers-can-learn","title":"Differentially Private Optimizers Can Learn Adversarially Robust Models","date":"2022-11-16","arxiv_id":"2211.08942","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-interpretability-via-regularization","title":"Improving Interpretability via Regularization of Neural Activation Sensitivity","date":"2022-11-16","arxiv_id":"2211.08686","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-adversarial-perturbation-by-50","title":"Accelerating Adversarial Perturbation by 50% with Semi-backward Propagation","date":"2022-11-09","arxiv_id":"2211.04973","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-fraudster-detection-contributes-to-robust","title":"Towards Adversarially Robust Recommendation from Adaptive Fraudster Detection","date":"2022-11-08","arxiv_id":"2211.11534","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-adversarial-robustness-to","title":"Improving Adversarial Robustness to Sensitivity and Invariance Attacks with Deep Metric Learning","date":"2022-11-04","arxiv_id":"2211.02468","repositories_listed":0,"syntology":null},{"url":null,"slug":"physically-adversarial-attacks-and-defenses","title":"Visually Adversarial Attacks and Defenses in the Physical World: A Survey","date":"2022-11-03","arxiv_id":"2211.01671","repositories_listed":0,"syntology":null},{"url":null,"slug":"densepure-understanding-diffusion-models","title":"DensePure: Understanding Diffusion Models towards Adversarial Robustness","date":"2022-11-01","arxiv_id":"2211.00322","repositories_listed":0,"syntology":null},{"url":null,"slug":"scoring-black-box-models-for-adversarial","title":"Scoring Black-Box Models for Adversarial Robustness","date":"2022-10-31","arxiv_id":"2210.17140","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-hyperspectral-adversarial","title":"Improving Hyperspectral Adversarial Robustness Under Multiple Attacks","date":"2022-10-28","arxiv_id":"2210.16346","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-reliable-neural-specifications","title":"Towards Reliable Neural Specifications","date":"2022-10-28","arxiv_id":"2210.16114","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-test-time-defense-with-the-manifold","title":"Adversarial Purification with the Manifold Hypothesis","date":"2022-10-26","arxiv_id":"2210.14404","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-text-representation-learning","title":"Disentangled Text Representation Learning with Information-Theoretic Perspective for Adversarial Robustness","date":"2022-10-26","arxiv_id":"2210.14957","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-information-bottleneck-boosts","title":"Causal Information Bottleneck Boosts Adversarial Robustness of Deep Neural Network","date":"2022-10-25","arxiv_id":"2210.14229","repositories_listed":0,"syntology":null},{"url":null,"slug":"focusedcleaner-sanitizing-poisoned-graphs-for","title":"FocusedCleaner: Sanitizing Poisoned Graphs for Robust GNN-based Node Classification","date":"2022-10-25","arxiv_id":"2210.13815","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-representation-learning-from","title":"Multi-view Representation Learning from Malware to Defend Against Adversarial Variants","date":"2022-10-25","arxiv_id":"2210.15429","repositories_listed":0,"syntology":null},{"url":null,"slug":"nash-equilibria-and-pitfalls-of-adversarial","title":"Nash Equilibria and Pitfalls of Adversarial Training in Adversarial Robustness Games","date":"2022-10-23","arxiv_id":"2210.12606","repositories_listed":0,"syntology":null},{"url":null,"slug":"chaos-theory-and-adversarial-robustness","title":"Chaos Theory and Adversarial Robustness","date":"2022-10-20","arxiv_id":"2210.13235","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sample-reweighting-for-accuracy-and","title":"Learning Sample Reweighting for Accuracy and Adversarial Robustness","date":"2022-10-20","arxiv_id":"2210.11513","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-transferable-robust-representation","title":"Learning Transferable Adversarial Robust Representations via Multi-view Consistency","date":"2022-10-19","arxiv_id":"2210.10485","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-adversarial-robustness-of-mixture-of","title":"On the Adversarial Robustness of Mixture of Experts","date":"2022-10-19","arxiv_id":"2210.10253","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-adversarial-robustness-by-1","title":"Improving Adversarial Robustness by Contrastive Guided Diffusion Process","date":"2022-10-18","arxiv_id":"2210.09643","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-adversarial-robustness-from-the","title":"Boosting Adversarial Robustness From The Perspective of Effective Margin Regularization","date":"2022-10-11","arxiv_id":"2210.05118","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetry-subgroup-defense-against-adversarial","title":"Symmetry Defense Against CNN Adversarial Perturbation Attacks","date":"2022-10-08","arxiv_id":"2210.04087","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-adversarial-robustness-of-deep-image","title":"On Adversarial Robustness of Deep Image Deblurring","date":"2022-10-05","arxiv_id":"2210.02502","repositories_listed":0,"syntology":null},{"url":null,"slug":"strength-adaptive-adversarial-training","title":"Strength-Adaptive Adversarial Training","date":"2022-10-04","arxiv_id":"2210.01288","repositories_listed":0,"syntology":null},{"url":null,"slug":"push-pull-characterizing-the-adversarial","title":"Push-Pull: Characterizing the Adversarial Robustness for Audio-Visual Active Speaker Detection","date":"2022-10-03","arxiv_id":"2210.00753","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-tightness-of-linear-relaxation-based","title":"On the tightness of linear relaxation based robustness certification methods","date":"2022-10-01","arxiv_id":"2210.00178","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizability-of-adversarial-robustness","title":"Generalizability of Adversarial Robustness Under Distribution Shifts","date":"2022-09-29","arxiv_id":"2209.15042","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-robust-active-learning-by-joint","title":"Fair Robust Active Learning by Joint Inconsistency","date":"2022-09-22","arxiv_id":"2209.10729","repositories_listed":0,"syntology":null},{"url":null,"slug":"audit-and-improve-robustness-of-private","title":"Audit and Improve Robustness of Private Neural Networks on Encrypted Data","date":"2022-09-20","arxiv_id":"2209.09996","repositories_listed":0,"syntology":null},{"url":null,"slug":"advdo-realistic-adversarial-attacks-for","title":"AdvDO: Realistic Adversarial Attacks for Trajectory Prediction","date":"2022-09-19","arxiv_id":"2209.08744","repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-tradeoffs-between-adversarial-and","title":"Explicit Tradeoffs between Adversarial and Natural Distributional Robustness","date":"2022-09-15","arxiv_id":"2209.07592","repositories_listed":0,"syntology":null},{"url":null,"slug":"finetuning-pretrained-vision-language-models","title":"Correlation Information Bottleneck: Towards Adapting Pretrained Multimodal Models for Robust Visual Question Answering","date":"2022-09-14","arxiv_id":"2209.06954","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-interplay-of-adversarial-robustness","title":"On the interplay of adversarial robustness and architecture components: patches, convolution and attention","date":"2022-09-14","arxiv_id":"2209.06953","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-transferable-feature-extractors","title":"Robust Transferable Feature Extractors: Learning to Defend Pre-Trained Networks Against White Box Adversaries","date":"2022-09-14","arxiv_id":"2209.06931","repositories_listed":0,"syntology":null},{"url":null,"slug":"fade-enabling-large-scale-federated","title":"FADE: Enabling Federated Adversarial Training on Heterogeneous Resource-Constrained Edge Devices","date":"2022-09-08","arxiv_id":"2209.03839","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-for-tabular-data","title":"Adversarial Robustness for Tabular Data through Cost and Utility Awareness","date":"2022-08-27","arxiv_id":"2208.13058","repositories_listed":0,"syntology":null},{"url":null,"slug":"funcfooler-a-practical-black-box-attack","title":"FuncFooler: A Practical Black-box Attack Against Learning-based Binary Code Similarity Detection Methods","date":"2022-08-26","arxiv_id":"2208.14191","repositories_listed":0,"syntology":null},{"url":null,"slug":"ghn-q-parameter-prediction-for-unseen","title":"GHN-Q: Parameter Prediction for Unseen Quantized Convolutional Architectures via Graph Hypernetworks","date":"2022-08-26","arxiv_id":"2208.12489","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-difficulty-and-better-robustness-a","title":"Lower Difficulty and Better Robustness: A Bregman Divergence Perspective for Adversarial Training","date":"2022-08-26","arxiv_id":"2208.12511","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-architectures-matter-on-the","title":"Multi-Scale Architectures Matter: On the Adversarial Robustness of Flow-based Lossless Compression","date":"2022-08-26","arxiv_id":"2208.12716","repositories_listed":0,"syntology":null},{"url":null,"slug":"shortcut-learning-of-large-language-models-in","title":"Shortcut Learning of Large Language Models in Natural Language Understanding","date":"2022-08-25","arxiv_id":"2208.11857","repositories_listed":0,"syntology":null},{"url":null,"slug":"barrel-bottleneck-attention-for-adversarial","title":"BARReL: Bottleneck Attention for Adversarial Robustness in Vision-Based Reinforcement Learning","date":"2022-08-22","arxiv_id":"2208.10481","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-knowledge-distillation-via-dropout","title":"Self-Knowledge Distillation via Dropout","date":"2022-08-11","arxiv_id":"2208.05642","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-adversarial-robustness-transfers-from-pre","title":"On Transfer of Adversarial Robustness from Pretraining to Downstream Tasks","date":"2022-08-07","arxiv_id":"2208.03835","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-current-research-on-adversarial-robustness","title":"Is current research on adversarial robustness addressing the right problem?","date":"2022-07-31","arxiv_id":"2208.00539","repositories_listed":0,"syntology":null},{"url":null,"slug":"pro-tuning-unified-prompt-tuning-for-vision","title":"Pro-tuning: Unified Prompt Tuning for Vision Tasks","date":"2022-07-28","arxiv_id":"2207.14381","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-transparent-ai-a-survey-on","title":"Toward Transparent AI: A Survey on Interpreting the Inner Structures of Deep Neural Networks","date":"2022-07-27","arxiv_id":"2207.13243","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-higher-adversarial-susceptibility-of","title":"Contrastive Self-Supervised Learning Leads to Higher Adversarial Susceptibility","date":"2022-07-22","arxiv_id":"2207.10862","repositories_listed":0,"syntology":null},{"url":null,"slug":"augrmixat-a-data-processing-and-training","title":"AugRmixAT: A Data Processing and Training Method for Improving Multiple Robustness and Generalization Performance","date":"2022-07-21","arxiv_id":"2207.10290","repositories_listed":0,"syntology":null},{"url":null,"slug":"switching-one-versus-the-rest-loss-to","title":"One-vs-the-Rest Loss to Focus on Important Samples in Adversarial Training","date":"2022-07-21","arxiv_id":"2207.10283","repositories_listed":0,"syntology":null},{"url":null,"slug":"illusionary-attacks-on-sequential-decision","title":"Illusory Attacks: Information-Theoretic Detectability Matters in Adversarial Attacks","date":"2022-07-20","arxiv_id":"2207.10170","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-assessment-of","title":"Adversarial Robustness Assessment of NeuroEvolution Approaches","date":"2022-07-12","arxiv_id":"2207.05451","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-fidelity-evolutionary-multiobjective","title":"Bi-fidelity Evolutionary Multiobjective Search for Adversarially Robust Deep Neural Architectures","date":"2022-07-12","arxiv_id":"2207.05321","repositories_listed":0,"syntology":null},{"url":null,"slug":"certified-adversarial-robustness-via-1","title":"Certified Adversarial Robustness via Anisotropic Randomized Smoothing","date":"2022-07-12","arxiv_id":"2207.05327","repositories_listed":0,"syntology":null},{"url":null,"slug":"rush-robust-contrastive-learning-via","title":"RUSH: Robust Contrastive Learning via Randomized Smoothing","date":"2022-07-11","arxiv_id":"2207.05127","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relationship-between-adversarial","title":"On the Relationship Between Adversarial Robustness and Decision Region in Deep Neural Network","date":"2022-07-07","arxiv_id":"2207.03400","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-visual-dialog","title":"Adversarial Robustness of Visual Dialog","date":"2022-07-06","arxiv_id":"2207.02639","repositories_listed":0,"syntology":null},{"url":null,"slug":"increasing-confidence-in-adversarial","title":"Increasing Confidence in Adversarial Robustness Evaluations","date":"2022-06-28","arxiv_id":"2206.13991","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-deep-neural","title":"Adversarial Robustness of Deep Neural Networks: A Survey from a Formal Verification Perspective","date":"2022-06-24","arxiv_id":"2206.12227","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-of-explanation-methods-for-nlp","title":"Robustness of Explanation Methods for NLP Models","date":"2022-06-24","arxiv_id":"2206.12284","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-is-at-odds-with-lazy","title":"Adversarial Robustness is at Odds with Lazy Training","date":"2022-06-18","arxiv_id":"2207.00411","repositories_listed":0,"syntology":null},{"url":null,"slug":"existence-and-minimax-theorems-for","title":"Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classification","date":"2022-06-18","arxiv_id":"2206.09098","repositories_listed":0,"syntology":null},{"url":null,"slug":"queried-unlabeled-data-improves-and","title":"Queried Unlabeled Data Improves and Robustifies Class-Incremental Learning","date":"2022-06-15","arxiv_id":"2206.07842","repositories_listed":0,"syntology":null},{"url":null,"slug":"we-cannot-guarantee-safety-the-undecidability","title":"Fundamental Limits in Formal Verification of Message-Passing Neural Networks","date":"2022-06-10","arxiv_id":"2206.05070","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-adversarial-training-to-improve","title":"Adaptive Adversarial Training to Improve Adversarial Robustness of DNNs for Medical Image Segmentation and Detection","date":"2022-06-02","arxiv_id":"2206.01736","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-bayesian-neural-subnetwork","title":"Sequential Bayesian Neural Subnetwork Ensembles","date":"2022-06-01","arxiv_id":"2206.00794","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-robust-way-to-stack-and-bag-the-local","title":"The robust way to stack and bag: the local Lipschitz way","date":"2022-06-01","arxiv_id":"2206.00513","repositories_listed":0,"syntology":null},{"url":null,"slug":"exposing-fine-grained-adversarial","title":"Exposing Fine-Grained Adversarial Vulnerability of Face Anti-Spoofing Models","date":"2022-05-30","arxiv_id":"2205.14851","repositories_listed":0,"syntology":null}],"record_sha256":"eb588d855f5d1e43ccb6d0d197f25325dc839b3ee521a22874e914a6117c5648","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}