Robusta: Robust AutoML for Feature Selection via Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Several AutoML approaches have been proposed to automate the machine learning (ML) process, such as searching for the ML model architectures and hyper-parameters. However, these AutoML pipelines only focus on improving the learning accuracy of benign samples while ignoring the ML model robustness under adversarial attacks. As ML systems are increasingly being used in a variety of mission-critical applications, improving the robustness of ML systems has become of utmost importance. In this paper, we propose the first robust AutoML framework, Robusta--based on reinforcement learning (RL)--to perform feature selection, aiming to select features that lead to both accurate and robust ML systems. We show that a variation of the 0-1 robust loss can be directly optimized via an RL-based combinatorial search in the feature selection scenario. In addition, we employ heuristics to accelerate the search procedure based on feature scoring metrics, which are mutual information scores, tree-based classifiers feature importance scores, F scores, and Integrated Gradient (IG) scores, as well as their combinations. We conduct extensive experiments and show that the proposed framework is able to improve the model robustness by up to 22% while maintaining competitive accuracy on benign samples compared with other feature selection methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 15 Jan 2021.
Builds on
19 of 31 references.
References · 19
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
- 2018Robustness May Be at Odds with Accuracycited by 873
- 2017Feature Squeezing: Detecting Adversarial Examples in Deep Neural Networkscited by 484
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
- 2018Parametric Noise Injection: Trainable Randomness to Improve Deep Neural Network Robustness against Adversarial Attackcited by 123
- 2019Adversarial Examples Are a Natural Consequence of Test Error in Noisecited by 114
7 more
- 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2017Feature Engineering for Predictive Modeling using Reinforcement Learningcited by 78
- 2019Adversarial camera stickers: A physical camera-based attack on deep learning systemscited by 69
- 2017Improving Robustness of ML Classifiers against Realizable Evasion Attacks Using Conserved Featurescited by 18
- 2018Defense Against the Dark Arts: An overview of adversarial example security research and future research directionscited by 11
- 2020Robust binary classification with the 01 losscited by 1
Built on by
Not cited yet.