{"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/9","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":9,"pages_in_order":18,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/adversarial-robustness/papers/10","papers":[{"url":null,"slug":"a-flat-minima-perspective-on-understanding","title":"A Flat Minima Perspective on Understanding Augmentations and Model Robustness","date":"2025-05-30","arxiv_id":"2505.24592","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-unlearning-via-sparse-autoencoder","title":"Model Unlearning via Sparse Autoencoder Subspace Guided Projections","date":"2025-05-30","arxiv_id":"2505.24428","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-scaling-of-robustness-and","title":"On the Scaling of Robustness and Effectiveness in Dense Retrieval","date":"2025-05-30","arxiv_id":"2505.24279","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-butterfly-effect-in-pathology-exploring","title":"The Butterfly Effect in Pathology: Exploring Security in Pathology Foundation Models","date":"2025-05-30","arxiv_id":"2505.24141","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-classical-deep-neural-networks-weakly","title":"Are classical deep neural networks weakly adversarially robust?","date":"2025-05-28","arxiv_id":"2506.02016","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-do-diffusion-models-improve-adversarial","title":"How Do Diffusion Models Improve Adversarial Robustness?","date":"2025-05-28","arxiv_id":"2505.22839","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-time-series-foundation-models-deployment","title":"Are Time-Series Foundation Models Deployment-Ready? A Systematic Study of Adversarial Robustness Across Domains","date":"2025-05-26","arxiv_id":"2505.19397","repositories_listed":0,"syntology":null},{"url":null,"slug":"erasing-concepts-steering-generations-a","title":"Erasing Concepts, Steering Generations: A Comprehensive Survey of Concept Suppression","date":"2025-05-26","arxiv_id":"2505.19398","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-reinforcement-learning-in-4","title":"Multi-Agent Reinforcement Learning in Cybersecurity: From Fundamentals to Applications","date":"2025-05-26","arxiv_id":"2505.19837","repositories_listed":0,"syntology":null},{"url":null,"slug":"your-classifier-can-do-more-towards-bridging","title":"Your Classifier Can Do More: Towards Bridging the Gaps in Classification, Robustness, and Generation","date":"2025-05-26","arxiv_id":"2505.19459","repositories_listed":0,"syntology":null},{"url":null,"slug":"curvature-dynamic-black-box-attack-revisiting","title":"Curvature Dynamic Black-box Attack: revisiting adversarial robustness via dynamic curvature estimation","date":"2025-05-25","arxiv_id":"2505.19194","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-adversarial-robustness-of-vision","title":"Enhancing Adversarial Robustness of Vision Language Models via Adversarial Mixture Prompt Tuning","date":"2025-05-23","arxiv_id":"2505.17509","repositories_listed":0,"syntology":null},{"url":null,"slug":"experimental-robustness-benchmark-of-quantum","title":"Experimental robustness benchmark of quantum neural network on a superconducting quantum processor","date":"2025-05-22","arxiv_id":"2505.16714","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-classification-evaluating-diffusion","title":"Beyond Classification: Evaluating Diffusion Denoised Smoothing for Security-Utility Trade off","date":"2025-05-21","arxiv_id":"2505.15594","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-adversarial-low-rank-fine-tuning-of","title":"Few-Shot Adversarial Low-Rank Fine-Tuning of Vision-Language Models","date":"2025-05-21","arxiv_id":"2505.15130","repositories_listed":0,"syntology":null},{"url":null,"slug":"lessons-from-defending-gemini-against","title":"Lessons from Defending Gemini Against Indirect Prompt Injections","date":"2025-05-20","arxiv_id":"2505.14534","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-systems-for-democracy-toward","title":"Recommender Systems for Democracy: Toward Adversarial Robustness in Voting Advice Applications","date":"2025-05-19","arxiv_id":"2505.13329","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-for-unified-multi","title":"Adversarial Robustness for Unified Multi-Modal Encoders via Efficient Calibration","date":"2025-05-17","arxiv_id":"2505.11895","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11413","title":"CARES: Comprehensive Evaluation of Safety and Adversarial Robustness in Medical LLMs","date":"2025-05-16","arxiv_id":"2505.11413","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-robust-spiking-neural-networks-1","title":"Adversarially Robust Spiking Neural Networks with Sparse Connectivity","date":"2025-05-16","arxiv_id":"2505.15833","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamical-low-rank-compression-of-neural","title":"Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks","date":"2025-05-12","arxiv_id":"2505.08022","repositories_listed":0,"syntology":null},{"url":null,"slug":"unpacking-robustness-in-inflectional","title":"Unpacking Robustness in Inflectional Languages: Adversarial Evaluation and Mechanistic Insights","date":"2025-05-08","arxiv_id":"2505.07856","repositories_listed":0,"syntology":null},{"url":null,"slug":"alma-aggregated-lipschitz-maximization-attack","title":"ALMA: Aggregated Lipschitz Maximization Attack on Auto-encoders","date":"2025-05-06","arxiv_id":"2505.03646","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-support-vector-regression-for-robust","title":"Quantum Support Vector Regression for Robust Anomaly Detection","date":"2025-05-02","arxiv_id":"2505.01012","repositories_listed":0,"syntology":null},{"url":null,"slug":"aixamine-llm-safety-and-security-simplified","title":"aiXamine: Simplified LLM Safety and Security","date":"2025-04-21","arxiv_id":"2504.14985","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-adversarial-training-with-weak-to-strong","title":"Fast Adversarial Training with Weak-to-Strong Spatial-Temporal Consistency in the Frequency Domain on Videos","date":"2025-04-21","arxiv_id":"2504.14921","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-large-language-models-for-enhanced","title":"Multimodal Large Language Models for Enhanced Traffic Safety: A Comprehensive Review and Future Trends","date":"2025-04-21","arxiv_id":"2504.16134","repositories_listed":0,"syntology":null},{"url":null,"slug":"hydra-an-agentic-reasoning-approach-for","title":"Hydra: An Agentic Reasoning Approach for Enhancing Adversarial Robustness and Mitigating Hallucinations in Vision-Language Models","date":"2025-04-19","arxiv_id":"2504.14395","repositories_listed":0,"syntology":null},{"url":null,"slug":"rdi-an-adversarial-robustness-evaluation","title":"RDI: An adversarial robustness evaluation metric for deep neural networks based on model statistical features","date":"2025-04-16","arxiv_id":"2504.18556","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-enhance-downstream-adversarial","title":"How to Enhance Downstream Adversarial Robustness (almost) without Touching the Pre-Trained Foundation Model?","date":"2025-04-15","arxiv_id":"2504.10850","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sword-of-damocles-in-vits-computational","title":"The Sword of Damocles in ViTs: Computational Redundancy Amplifies Adversarial Transferability","date":"2025-04-15","arxiv_id":"2504.10804","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-worst-case-online-classification-vc","title":"Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks","date":"2025-04-14","arxiv_id":"2504.10598","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-examples-in-environment","title":"Adversarial Examples in Environment Perception for Automated Driving (Review)","date":"2025-04-11","arxiv_id":"2504.08414","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-spiking-neural-network-local-learning","title":"Toward Spiking Neural Network Local Learning Modules Resistant to Adversarial Attacks","date":"2025-04-11","arxiv_id":"2504.08897","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-domain-based-taxonomy-of-jailbreak","title":"A Domain-Based Taxonomy of Jailbreak Vulnerabilities in Large Language Models","date":"2025-04-07","arxiv_id":"2504.04976","repositories_listed":0,"syntology":null},{"url":null,"slug":"secure-diagnostics-adversarial-robustness","title":"Secure Diagnostics: Adversarial Robustness Meets Clinical Interpretability","date":"2025-04-07","arxiv_id":"2504.05483","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-is-better-than-one-efficient-ensemble","title":"Two is Better than One: Efficient Ensemble Defense for Robust and Compact Models","date":"2025-04-07","arxiv_id":"2504.04747","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-on-adversarial-robustness-of","title":"A Study on Adversarial Robustness of Discriminative Prototypical Learning","date":"2025-04-03","arxiv_id":"2504.03782","repositories_listed":0,"syntology":null},{"url":null,"slug":"adpo-enhancing-the-adversarial-robustness-of","title":"AdPO: Enhancing the Adversarial Robustness of Large Vision-Language Models with Preference Optimization","date":"2025-04-02","arxiv_id":"2504.01735","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-unsupervised-domain-adaptation-for-3d","title":"Robust Unsupervised Domain Adaptation for 3D Point Cloud Segmentation Under Source Adversarial Attacks","date":"2025-04-02","arxiv_id":"2504.01659","repositories_listed":0,"syntology":null},{"url":null,"slug":"atp-adaptive-threshold-pruning-for-efficient","title":"ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks","date":"2025-03-26","arxiv_id":"2503.21815","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-constant-meets-condition-number","title":"Lipschitz Constant Meets Condition Number: Learning Robust and Compact Deep Neural Networks","date":"2025-03-26","arxiv_id":"2503.20454","repositories_listed":0,"syntology":null},{"url":null,"slug":"stop-walking-in-circles-bailing-out-early-in","title":"Stop Walking in Circles! Bailing Out Early in Projected Gradient Descent","date":"2025-03-25","arxiv_id":"2503.19347","repositories_listed":0,"syntology":null},{"url":null,"slug":"masks-and-mimicry-strategic-obfuscation-and","title":"Masks and Mimicry: Strategic Obfuscation and Impersonation Attacks on Authorship Verification","date":"2025-03-24","arxiv_id":"2503.19099","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-is-dataset-cartography-ineffective-using","title":"When is dataset cartography ineffective? Using training dynamics does not improve robustness against Adversarial SQuAD","date":"2025-03-24","arxiv_id":"2503.18290","repositories_listed":0,"syntology":null},{"url":null,"slug":"principal-eigenvalue-regularization-for","title":"Principal Eigenvalue Regularization for Improved Worst-Class Certified Robustness of Smoothed Classifiers","date":"2025-03-21","arxiv_id":"2503.17172","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-of-deep-learning-classification-to","title":"Robustness of deep learning classification to adversarial input on GPUs: asynchronous parallel accumulation is a source of vulnerability","date":"2025-03-21","arxiv_id":"2503.17173","repositories_listed":0,"syntology":null},{"url":null,"slug":"narrowing-class-wise-robustness-gaps-in","title":"Narrowing Class-Wise Robustness Gaps in Adversarial Training","date":"2025-03-20","arxiv_id":"2503.16179","repositories_listed":0,"syntology":null},{"url":null,"slug":"mmdt-decoding-the-trustworthiness-and-safety","title":"MMDT: Decoding the Trustworthiness and Safety of Multimodal Foundation Models","date":"2025-03-19","arxiv_id":"2503.14827","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-robustness-tradeoff-in-fine-tuning","title":"On the Robustness Tradeoff in Fine-Tuning","date":"2025-03-19","arxiv_id":"2503.14836","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-of-adversarial-robustness-in","title":"Survey of Adversarial Robustness in Multimodal Large Language Models","date":"2025-03-18","arxiv_id":"2503.13962","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-role-of-randomization-in","title":"Unveiling the Role of Randomization in Multiclass Adversarial Classification: Insights from Graph Theory","date":"2025-03-18","arxiv_id":"2503.14299","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-based-region-adversarial-prompt","title":"Evolution-based Region Adversarial Prompt Learning for Robustness Enhancement in Vision-Language Models","date":"2025-03-17","arxiv_id":"2503.12874","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-dataset-distillation-by-matching","title":"Robust Dataset Distillation by Matching Adversarial Trajectories","date":"2025-03-15","arxiv_id":"2503.12069","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantitative-analysis-of-deeply-quantized","title":"Quantitative Analysis of Deeply Quantized Tiny Neural Networks Robust to Adversarial Attacks","date":"2025-03-12","arxiv_id":"2503.08973","repositories_listed":0,"syntology":null},{"url":null,"slug":"life-cycle-routing-vulnerabilities-of-llm","title":"Life-Cycle Routing Vulnerabilities of LLM Router","date":"2025-03-09","arxiv_id":"2503.08704","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-tailed-adversarial-training-with-self","title":"Long-tailed Adversarial Training with Self-Distillation","date":"2025-03-09","arxiv_id":"2503.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"mmard-improving-the-min-max-optimization","title":"MMARD: Improving the Min-Max Optimization Process in Adversarial Robustness Distillation","date":"2025-03-09","arxiv_id":"2503.06559","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-discriminative-self","title":"Adversarial Robustness of Discriminative Self-Supervised Learning in Vision","date":"2025-03-08","arxiv_id":"2503.06361","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-adversarial-transferability-between","title":"Exploring Adversarial Transferability between Kolmogorov-arnold Networks","date":"2025-03-08","arxiv_id":"2503.06276","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-in-parameter-space","title":"Adversarial Robustness in Parameter-Space Classifiers","date":"2025-02-27","arxiv_id":"2502.20314","repositories_listed":0,"syntology":null},{"url":null,"slug":"emoti-attack-zero-perturbation-adversarial","title":"Emoti-Attack: Zero-Perturbation Adversarial Attacks on NLP Systems via Emoji Sequences","date":"2025-02-24","arxiv_id":"2502.17392","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-certificates-for-adversarially","title":"Generalization Certificates for Adversarially Robust Bayesian Linear Regression","date":"2025-02-20","arxiv_id":"2502.14298","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-robustness-in-deep-learning-a","title":"Probabilistic Robustness in Deep Learning: A Concise yet Comprehensive Guide","date":"2025-02-20","arxiv_id":"2502.14833","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-alignment-for-llms-requires","title":"Adversarial Alignment for LLMs Requires Simpler, Reproducible, and More Measurable Objectives","date":"2025-02-17","arxiv_id":"2502.11910","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-audio-visual-adversarial","title":"Rethinking Audio-Visual Adversarial Vulnerability from Temporal and Modality Perspectives","date":"2025-02-17","arxiv_id":"2502.11858","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-promise-for-assurance-of","title":"On the Promise for Assurance of Differentiable Neurosymbolic Reasoning Paradigms","date":"2025-02-13","arxiv_id":"2502.08932","repositories_listed":0,"syntology":null},{"url":null,"slug":"general-coded-computing-adversarial-settings","title":"General Coded Computing: Adversarial Settings","date":"2025-02-12","arxiv_id":"2502.08058","repositories_listed":0,"syntology":null},{"url":null,"slug":"roma-robust-malware-attribution-via-byte","title":"RoMA: Robust Malware Attribution via Byte-level Adversarial Training with Global Perturbations and Adversarial Consistency Regularization","date":"2025-02-11","arxiv_id":"2502.07492","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-explainable-deep-reinforcement","title":"A Survey on Explainable Deep Reinforcement Learning","date":"2025-02-08","arxiv_id":"2502.06869","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-robust-td-learning-with","title":"Adversarially-Robust TD Learning with Markovian Data: Finite-Time Rates and Fundamental Limits","date":"2025-02-07","arxiv_id":"2502.04662","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-contextual-manifold-alignment","title":"Hierarchical Contextual Manifold Alignment for Structuring Latent Representations in Large Language Models","date":"2025-02-06","arxiv_id":"2502.03766","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-adversarial-robustness-via-phase","title":"Improving Adversarial Robustness via Phase and Amplitude-aware Prompting","date":"2025-02-06","arxiv_id":"2502.03758","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-robustness-and-accuracy-in-mixture","title":"Optimizing Robustness and Accuracy in Mixture of Experts: A Dual-Model Approach","date":"2025-02-05","arxiv_id":"2502.06832","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-for-collaborative","title":"Uncertainty Quantification for Collaborative Object Detection Under Adversarial Attacks","date":"2025-02-04","arxiv_id":"2502.02537","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-in-two-stage-learning","title":"Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees","date":"2025-02-03","arxiv_id":"2502.01027","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-adversarial-robustness-and","title":"Boosting Adversarial Robustness and Generalization with Structural Prior","date":"2025-02-02","arxiv_id":"2502.00834","repositories_listed":0,"syntology":null},{"url":null,"slug":"secpe-secure-prompt-ensembling-for-private","title":"SecPE: Secure Prompt Ensembling for Private and Robust Large Language Models","date":"2025-02-02","arxiv_id":"2502.00847","repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-inference-time-compute-for","title":"Trading Inference-Time Compute for Adversarial Robustness","date":"2025-01-31","arxiv_id":"2501.18841","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-signatures-of-adversaries-in","title":"Topological Signatures of Adversaries in Multimodal Alignments","date":"2025-01-29","arxiv_id":"2501.18006","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-masked-autoencoder-purifier-with","title":"Adversarial Masked Autoencoder Purifier with Defense Transferability","date":"2025-01-28","arxiv_id":"2501.16904","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-partitioned-quantum","title":"Adversarial Robustness of Partitioned Quantum Classifiers","date":"2025-01-28","arxiv_id":"2502.20403","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-privacy-model-for-classical-learned-bloom","title":"Adversarially Robust Bloom Filters: Privacy, Reductions, and Open Problems","date":"2025-01-27","arxiv_id":"2501.15751","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-trained-model-guided-mixture-knowledge","title":"Pre-trained Model Guided Mixture Knowledge Distillation for Adversarial Federated Learning","date":"2025-01-25","arxiv_id":"2501.15257","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-implementation-errors-in-recent","title":"A Note on Implementation Errors in Recent Adaptive Attacks Against Multi-Resolution Self-Ensembles","date":"2025-01-24","arxiv_id":"2501.14496","repositories_listed":0,"syntology":null},{"url":null,"slug":"defending-against-adversarial-malware-attacks","title":"Defending against Adversarial Malware Attacks on ML-based Android Malware Detection Systems","date":"2025-01-23","arxiv_id":"2501.13782","repositories_listed":0,"syntology":null},{"url":null,"slug":"framework-for-progressive-knowledge-fusion-in","title":"Framework for Progressive Knowledge Fusion in Large Language Models Through Structured Conceptual Redundancy Analysis","date":"2025-01-23","arxiv_id":"2501.13999","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-margin-based-replacement-for-cross-entropy","title":"A margin-based replacement for cross-entropy loss","date":"2025-01-21","arxiv_id":"2501.12191","repositories_listed":0,"syntology":null},{"url":null,"slug":"with-great-backbones-comes-great-adversarial","title":"With Great Backbones Comes Great Adversarial Transferability","date":"2025-01-21","arxiv_id":"2501.12275","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-visual-defense-adversarial-pre","title":"Double Visual Defense: Adversarial Pre-training and Instruction Tuning for Improving Vision-Language Model Robustness","date":"2025-01-16","arxiv_id":"2501.09446","repositories_listed":0,"syntology":null},{"url":null,"slug":"i-can-find-you-in-seconds-leveraging-large","title":"I Can Find You in Seconds! Leveraging Large Language Models for Code Authorship Attribution","date":"2025-01-14","arxiv_id":"2501.08165","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-adversarial-robustness-of-benjamini","title":"On the Adversarial Robustness of Benjamini Hochberg","date":"2025-01-06","arxiv_id":"2501.03402","repositories_listed":0,"syntology":null},{"url":null,"slug":"rerouting-llm-routers","title":"Rerouting LLM Routers","date":"2025-01-03","arxiv_id":"2501.01818","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-and-accurate-stability","title":"Towards Robust and Accurate Stability Estimation of Local Surrogate Models in Text-based Explainable AI","date":"2025-01-03","arxiv_id":"2501.02042","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-zero-shot-adversarial-robustness-of","title":"On the Zero-shot Adversarial Robustness of Vision-Language Models: A Truly Zero-shot and Training-free Approach","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-the-adversarial-robustness-of","title":"Rethinking the Adversarial Robustness of Multi-Exit Neural Networks in an Attack-Defense Game","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robustblack-challenging-black-box-adversarial","title":"RobustBlack: Challenging Black-Box Adversarial Attacks on State-of-the-Art Defenses","date":"2024-12-30","arxiv_id":"2412.20987","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-adversarial-robustness-of-language-models","title":"On Adversarial Robustness of Language Models in Transfer Learning","date":"2024-12-29","arxiv_id":"2501.00066","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-adversarial-ensemble-with-causal","title":"A Robust Adversarial Ensemble with Causal (Feature Interaction) Interpretations for Image Classification","date":"2024-12-28","arxiv_id":"2412.20025","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-for-deep-learning","title":"Adversarial Robustness for Deep Learning-based Wildfire Prediction Models","date":"2024-12-28","arxiv_id":"2412.20006","repositories_listed":0,"syntology":null}],"record_sha256":"9b3d5ce216fe9b864d6382cb0ec7352607146ecff29bc75675a9d1cfac79de6e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}