AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical Applications with Categorical Inputs
Not on the map. Why?
Abstract (arXiv)
Machine Learning-as-a-Service systems (MLaaS) have been largely developed for cybersecurity-critical applications, such as detecting network intrusions and fake news campaigns. Despite effectiveness, their robustness against adversarial attacks is one of the key trust concerns for MLaaS deployment. We are thus motivated to assess the adversarial robustness of the Machine Learning models residing at the core of these security-critical applications with categorical inputs. Previous research efforts on accessing model robustness against manipulation of categorical inputs are specific to use cases and heavily depend on domain knowledge, or require white-box access to the target ML model. Such limitations prevent the robustness assessment from being as a domain-agnostic service provided to various real-world applications. We propose a provably optimal yet computationally highly efficient adversarial robustness assessment protocol for a wide band of ML-driven cybersecurity-critical applications. We demonstrate the use of the domain-agnostic robustness assessment method with substantial experimental study on fake news detection and intrusion detection problems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 13 Dec 2022.
Builds on
29 of 42 references.
References · 29
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
- 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 376
- 2017"Liar, Liar Pants on Fire": A New Benchmark Dataset for Fake News Detectioncited by 361
- 2018Adversarial Example Generation with Syntactically Controlled Paraphrase Networkscited by 282
- 2018FakeNewsNet: A Data Repository with News Content, Social Context and Spatialtemporal Information for Studying Fake News on Social Mediacited by 281
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2021Adversarial GLUE: A Multi-Task Benchmark for Robustness Evaluation of Language Modelscited by 227
17 more
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2018Adversarial Attacks on Node Embeddings via Graph Poisoningcited by 109
- 2018TESSERACT: Eliminating Experimental Bias in Malware Classification across Space and Timecited by 108
- 2020Exactly Computing the Local Lipschitz Constant of ReLU Networkscited by 102
- 2019Sparse and Imperceivable Adversarial Attackscited by 95
- 2016Robustness of classifiers: from adversarial to random noisecited by 87
- 2020Robustness Verification for Transformerscited by 76
- 2021User Preference-aware Fake News Detectioncited by 76
- 2019Certifiable Robustness to Graph Perturbationscited by 62
- 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
- 2020Generating Natural Language Attacks in a Hard Label Black Box Settingcited by 50
- 2018Greedy Attack and Gumbel Attack: Generating Adversarial Examples for Discrete Datacited by 37
- 2018Theoretical Analysis of Adversarial Learning: A Minimax Approachcited by 31
- 2017Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?cited by 12
- 2019Adversarial attacks against Fact Extraction and VERificationcited by 11
- 2019ATTACK2VEC: Leveraging Temporal Word Embeddings to Understand the Evolution of Cyberattackscited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.