Randomized Prediction Games for Adversarial Machine Learning
Samuel Rota Bul\`o, Battista Biggio, Ignazio Pillai, Marcello, Pelillo, Fabio Roli

TL;DR
This paper introduces a novel randomized prediction game framework for adversarial machine learning, enhancing security by modeling both classifier and attacker strategies as probabilistic, leading to better attack detection and false alarm trade-offs.
Contribution
It proposes a non-cooperative game-theoretic model with randomized strategies for both classifier and attacker, addressing limitations of deterministic approaches in adversarial settings.
Findings
Improved attack detection and false alarm trade-offs.
Effective against unseen attack strategies.
Applicable to malware, spam, and digit recognition.
Abstract
In spam and malware detection, attackers exploit randomization to obfuscate malicious data and increase their chances of evading detection at test time; e.g., malware code is typically obfuscated using random strings or byte sequences to hide known exploits. Interestingly, randomization has also been proposed to improve security of learning algorithms against evasion attacks, as it results in hiding information about the classifier to the attacker. Recent work has proposed game-theoretical formulations to learn secure classifiers, by simulating different evasion attacks and modifying the classification function accordingly. However, both the classification function and the simulated data manipulations have been modeled in a deterministic manner, without accounting for any form of randomization. In this work, we overcome this limitation by proposing a randomized prediction game, namely,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
