Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate
Not on the map. Why?
Abstract (arXiv)
In constraint learning, we use a neural network as a surrogate for part of the constraints or of the objective function of an optimization model. However, the tractability of the resulting model is heavily influenced by the size of the neural network used as a surrogate. One way to obtain a more tractable surrogate is by pruning the neural network first. In this work, we consider how to approach the setting in which the neural network is actually a given: how can we solve an optimization model embedding a large and predetermined neural network? We propose surrogating the neural network itself by pruning it, which leads to a sparse and more tractable optimization model, for which we hope to still obtain good solutions with respect to the original neural network. For network verification and function maximization models, that indeed leads to better solutions within a time limit, especially -- and surprisingly -- if we skip the standard retraining step known as finetuning. Hence, a pruned network with worse inference for lack of finetuning can be a better surrogate.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 87 of its 151 references that are in the map. First posted on arXiv 4 May 2025.
Builds on
87 of 151 references.
References · 87
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
38 more
- 2020What is the State of Neural Network Pruning?cited by 583
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2014On the Number of Linear Regions of Deep Neural Networkscited by 381
- 2016On the Expressive Power of Deep Neural Networkscited by 306
- 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 257
- 2013Predicting Parameters in Deep Learningcited by 224
- 2019Algorithms for Verifying Deep Neural Networkscited by 221
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2019Complexity of Linear Regions in Deep Networkscited by 167
- 2020Characterising Bias in Compressed Modelscited by 167
- 2017Bounding and Counting Linear Regions of Deep Neural Networkscited by 161
- 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 161
- 2017An approach to reachability analysis for feed-forward ReLU neural networkscited by 127
- 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 122
- 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
- 2017Maximum Resilience of Artificial Neural Networkscited by 97
- 2013On the number of response regions of deep feed forward networks with piece-wise linear activationscited by 94
- 2015Representation Benefits of Deep Feedforward Networkscited by 86
- 2019Reverse-Engineering Deep ReLU Networkscited by 83
- 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
- 2018Training for Faster Adversarial Robustness Verification via Inducing ReLU Stabilitycited by 67
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2020Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routingcited by 61
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2021Towards Lower Bounds on the Depth of ReLU Neural Networkscited by 56
- 2020Certified Monotonic Neural Networkscited by 51
- 2022Pruning has a disparate impact on model accuracycited by 44
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2023Fast as CHITA: Neural Network Pruning with Combinatorial Optimizationcited by 40
- 2021Partition-based formulations for mixed-integer optimization of trained ReLU neural networkscited by 39
- 2023When Deep Learning Meets Polyhedral Theory: A Surveycited by 39
- 2021Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sumscited by 37
- 2023Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopescited by 36
- 2020On transversality of bent hyperplane arrangements and the topological expressiveness of ReLU neural networkscited by 35
- 2022OMLT: Optimization & Machine Learning Toolkitcited by 35
50 most cited of 87 All 87 (JSON)
Built on by
Not cited yet.