mlsanityData to 7 Oct 2026

Fast Design Space Exploration of Nonlinear Systems: Part I

arXiv 2104.01747 ↗First posted 5 Apr 2021cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

System design tools are often only available as input-output blackboxes: for a given design as input they compute an output representing system behavior. Blackboxes are intended to be run in the forward direction. This paper presents a new method of solving the inverse design problem namely, given requirements or constraints on output, find an input that also optimizes an objective function. This problem is challenging for several reasons. First, blackboxes are not designed to be run in reverse. Second, inputs and outputs can be discrete and continuous. Third, finding designs concurrently satisfying a set of requirements is hard because designs satisfying individual requirements may conflict with each other. Fourth, blackbox evaluations can be expensive. Finally, blackboxes can sometimes fail to produce an output. This paper presents CNMA, a new method of solving the inverse problem that overcomes these challenges. CNMA tries to sample only the part of the design space relevant to solving the problem, leveraging the power of neural networks, Mixed Integer Linear Programs, and a new learning-from-failure feedback loop. The paper also presents a parallel version of CNMA that improves the efficiency and quality of solutions over the sequential version, and tries to steer it away from local optima. CNMA's performance is evaluated against conventional optimization methods for seven nonlinear design problems of 8 (two problems), 10, 15, 36 and 60 real-valued dimensions and one with 186 binary dimensions. Conventional methods evaluated are off-the-shelf implementations of Bayesian Optimization with Gaussian Processes, Nelder Mead and Random Search. The first two do not solve problems that are high-dimensional, have discrete and continuous variables or whose blackboxes can fail to return values. CNMA solves all problems, and surpasses the performance of conventional methods by up to 87%.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 63 references that are in the map. First posted on arXiv 5 Apr 2021.

Builds on

11 of 63 references.

References · 11

  1. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
  2. 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
  3. 2014Robots that can adapt like animalscited by 203
  4. 2017Batched Large-scale Bayesian Optimization in High-dimensional Spacescited by 116
  5. 2020Scalable Constrained Bayesian Optimizationcited by 84
  6. 2015A General Framework for Constrained Bayesian Optimization using Information-based Searchcited by 50
  7. 2016Parallel Bayesian Global Optimization of Expensive Functionscited by 43
  8. 2019ReLU Networks as Surrogate Models in Mixed-Integer Linear Programscited by 33
  9. 2016Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangiancited by 29
  10. 2019Mixed-Variable Bayesian Optimizationcited by 29
  11. 2019SCANN: Synthesis of Compact and Accurate Neural Networkscited by 11

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.