A Dynamic-Adversarial Mining Approach to the Security of Machine Learning
Tegjyot Singh Sethi, Mehmed Kantardzic, Lingyu Lyua, Jiashun Chen

TL;DR
This paper introduces a dynamic, adversarial-aware approach to machine learning security, emphasizing detection and recovery from attacks in evolving environments, addressing gaps in existing static models.
Contribution
It proposes a novel feature importance hiding method to improve classifier resilience against sophisticated adversaries in dynamic settings.
Findings
Empirical analysis shows vulnerabilities of existing static models.
The feature importance hiding approach enhances attack detection.
The method enables classifiers to recover from adversarial attacks.
Abstract
Operating in a dynamic real world environment requires a forward thinking and adversarial aware design for classifiers, beyond fitting the model to the training data. In such scenarios, it is necessary to make classifiers - a) harder to evade, b) easier to detect changes in the data distribution over time, and c) be able to retrain and recover from model degradation. While most works in the security of machine learning has concentrated on the evasion resistance (a) problem, there is little work in the areas of reacting to attacks (b and c). Additionally, while streaming data research concentrates on the ability to react to changes to the data distribution, they often take an adversarial agnostic view of the security problem. This makes them vulnerable to adversarial activity, which is aimed towards evading the concept drift detection mechanism itself. In this paper, we analyze the…
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.
