Model-based feature selection for neural networks: A mixed-integer programming approach
Not on the map. Why?
Abstract (arXiv)
In this work, we develop a novel input feature selection framework for ReLU-based deep neural networks (DNNs), which builds upon a mixed-integer optimization approach. While the method is generally applicable to various classification tasks, we focus on finding input features for image classification for clarity of presentation. The idea is to use a trained DNN, or an ensemble of trained DNNs, to identify the salient input features. The input feature selection is formulated as a sequence of mixed-integer linear programming (MILP) problems that find sets of sparse inputs that maximize the classification confidence of each category. These ''inverse'' problems are regularized by the number of inputs selected for each category and by distribution constraints. Numerical results on the well-known MNIST and FashionMNIST datasets show that the proposed input feature selection allows us to drastically reduce the size of the input to ~15% while maintaining a good classification accuracy. This allows us to design DNNs with significantly fewer connections, reducing computational effort and producing DNNs that are more robust towards adversarial attacks.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 37 references that are in the map. First posted on arXiv 20 Feb 2023.
Builds on
21 of 37 references.
References · 21
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2019Green AIcited by 620
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
- 2017An approach to reachability analysis for feed-forward ReLU neural networkscited by 126
- 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
- 2019Survey of Dropout Methods for Deep Neural Networkscited by 44
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2021Partition-based formulations for mixed-integer optimization of trained ReLU neural networkscited by 39
9 more
- 2020Lossless Compression of Deep Neural Networkscited by 34
- 2022OMLT: Optimization & Machine Learning Toolkitcited by 34
- 2019ReLU Networks as Surrogate Models in Mixed-Integer Linear Programscited by 33
- 2019Feature Selection and Feature Extraction in Pattern Analysis: A Literature Reviewcited by 15
- 2021Between steps: Intermediate relaxations between big-M and convex hull formulationscited by 11
- 2022Optimizing Objective Functions from Trained ReLU Neural Networks via Samplingcited by 11
- 2021Scaling the Convex Barrier with Sparse Dual Algorithmscited by 10
- 2021Modeling Design and Control Problems Involving Neural Network Surrogatescited by 8
- 2022P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraintscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.