Pith. sign in

REVIEW 3 cited by

MAB-Malware: A Reinforcement Learning Framework for Attacking Static Malware Classifiers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.03100 v3 pith:4L2DHC7Q submitted 2020-03-06 cs.CR

classification cs.CR
keywords learningadversarialblack-boxclassifierscommercialmalwareevasionframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modern commercial antivirus systems increasingly rely on machine learning to keep up with the rampant inflation of new malware. However, it is well-known that machine learning models are vulnerable to adversarial examples (AEs). Previous works have shown that ML malware classifiers are fragile to the white-box adversarial attacks. However, ML models used in commercial antivirus products are usually not available to attackers and only return hard classification labels. Therefore, it is more practical to evaluate the robustness of ML models and real-world AVs in a pure black-box manner. We propose a black-box Reinforcement Learning (RL) based framework to generate AEs for PE malware classifiers and AV engines. It regards the adversarial attack problem as a multi-armed bandit problem, which finds an optimal balance between exploiting the successful patterns and exploring more varieties. Compared to other frameworks, our improvements lie in three points. 1) Limiting the exploration space by modeling the generation process as a stateless process to avoid combination explosions. 2) Due to the critical role of payload in AE generation, we design to reuse the successful payload in modeling. 3) Minimizing the changes on AE samples to correctly assign the rewards in RL learning. It also helps identify the root cause of evasions. As a result, our framework has much higher black-box evasion rates than other off-the-shelf frameworks. Results show it has over 74\%--97\% evasion rate for two state-of-the-art ML detectors and over 32\%--48\% evasion rate for commercial AVs in a pure black-box setting. We also demonstrate that the transferability of adversarial attacks among ML-based classifiers is higher than the attack transferability between purely ML-based and commercial AVs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. EMBER2024 -- A Benchmark Dataset for Holistic Evaluation of Malware Classifiers

    cs.CR 2025-06 conditional novelty 7.0 of 10

    EMBER2024 provides a 3.2-million-file, six-format, seven-task malware benchmark with a dedicated challenge set of antivirus-evading samples.

  2. Empirical Analysis of Evasion and Poisoning Against Malware Data Drift Detection

    cs.CR 2026-08 conditional novelty 6.0 of 10

    Evasion and poisoning attacks against malware classifiers lose effectiveness against CADE-style data drift detectors because large perturbations push samples away from the region the detector considers normal.

  3. Latent Stability Analysis of Malware Representations Under Feature-Space Perturbations

    cs.CR 2026-07 conditional novelty 5.5 of 10

    Latent-stability metrics (LED and PINNFlow shifts) diagnose malware representation movement under feature-space probes, without beating full EMBER or PCA-64 on clean classification.

Pith tools