mlsanityData to 7 Oct 2026

Modeling Design and Control Problems Involving Neural Network Surrogates

arXiv 2111.10489 ↗First posted 20 Nov 2021math.OC cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

We consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 29 of its 64 references that are in the map. First posted on arXiv 20 Nov 2021.

Builds on

29 of 64 references.

References · 29

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2013Intriguing properties of neural networkscited by 5,114
  5. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  6. 2016Adversarial examples in the physical worldcited by 1,762
  7. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  8. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  9. 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
  10. 2014Qualitatively characterizing neural network optimization problemscited by 186
  11. 2017Searching for Activation Functionscited by 158
  12. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
17 more
  1. 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
  2. 2017Maximum Resilience of Artificial Neural Networkscited by 97
  3. 2013On the number of response regions of deep feed forward networks with piece-wise linear activationscited by 94
  4. 2019Conservative set valued fields, automatic differentiation, stochastic gradient method and deep learningcited by 71
  5. 2020Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routingcited by 61
  6. 2015JuMP: A Modeling Language for Mathematical Optimizationcited by 49
  7. 2021Partition-based formulations for mixed-integer optimization of trained ReLU neural networkscited by 39
  8. 2019ReLU Networks as Surrogate Models in Mixed-Integer Linear Programscited by 33
  9. 2018Global Deterministic Optimization with Artificial Neural Networks Embeddedcited by 32
  10. 2019JANOS: An Integrated Predictive and Prescriptive Modeling Frameworkcited by 27
  11. 2017Convergent Block Coordinate Descent for Training Tikhonov Regularized Deep Neural Networkscited by 26
  12. 2018Empirical Bounds on Linear Regions of Deep Rectifier Networkscited by 23
  13. 2019CAQL: Continuous Action Q-Learningcited by 22
  14. 2021Constrained Discrete Black-Box Optimization using Mixed-Integer Programmingcited by 16
  15. 2018Combinatorial Attacks on Binarized Neural Networkscited by 11
  16. 2020An Outer-approximation Guided Optimization Approach for Constrained Neural Network Inverse Problemscited by 2
  17. 2019MaLTESE: Large-Scale Simulation-Driven Machine Learning for Transient Driving Cyclescited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 0; 2026: 2.

8 papers.