Learning Security Classifiers with Verified Global Robustness Properties

Abstract

Many recent works have proposed methods to train classifiers with local robustness properties, which can provably eliminate classes of evasion attacks for most inputs, but not all inputs. Since data distribution shift is very common in security applications, e.g., often observed for malware detection, local robustness cannot guarantee that the property holds for unseen inputs at the time of deploying the classifier. Therefore, it is more desirable to enforce global robustness properties that hold for all inputs, which is strictly stronger than local robustness. In this paper, we present a framework and tools for training classifiers that satisfy global robustness properties. We define new notions of global robustness that are more suitable for security classifiers. We design a novel booster-fixer training framework to enforce global robustness properties. We structure our classifier as an ensemble of logic rules and design a new verifier to verify the properties. In our training algorithm, the booster increases the classifier's capacity, and the fixer enforces verified global robustness properties following counterexample guided inductive synthesis. We show that we can train classifiers to satisfy different global robustness properties for three security datasets, and even multiple properties at the same time, with modest impact on the classifier's performance. For example, we train a Twitter spam account classifier to satisfy five global robustness properties, with 5.4% decrease in true positive rate, and 0.1% increase in false positive rate, compared to a baseline XGBoost model that doesn't satisfy any property.

ACM Conference on Computer and Communications Security (CCS) 2021 Best Paper Award Runner-Up

References in corpus (12)

• Predictive learning via rule ensembles
• Certified Adversarial Robustness via Randomized Smoothing
• An approach to reachability analysis for feed-forward ReLU neural networks
• Training robust neural networks using Lipschitz bounds
• Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study
• Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers
• Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothing
• Globally-Robust Neural Networks
• SoK: Certified Robustness for Deep Neural Networks
• Scaling Polyhedral Neural Network Verification on GPUs
• Universal Lipschitz Approximation in Bounded Depth Neural Networks
• Fast Training of Provably Robust Neural Networks by SingleProp