TL;DR
This paper reviews the use of neural networks in dataless optimization, focusing on different architectures and their applications in data-scarce scientific and engineering problems.
Contribution
It categorizes dataless neural network approaches into architecture-agnostic and architecture-specific methods, clarifying their distinctions and potential.
Findings
Neural networks can be applied to optimization without training data.
Different neural architectures are suited for various problem types.
Dataless neural methods are promising for data-scarce scientific applications.
Abstract
This paper surveys studies on the use of neural networks for optimization in the training-data-free setting. Specifically, we examine the dataless application of neural network architectures in optimization by re-parameterizing problems using fully connected (or MLP), convolutional, graph, and quadratic neural networks. Although MLPs have been used to solve linear programs a few decades ago, this approach has recently gained increasing attention due to its promising results across diverse applications, including those based on combinatorial optimization, inverse problems, and partial differential equations. The motivation for this setting stems from two key (possibly over-lapping) factors: (i) data-driven learning approaches are still underdeveloped and have yet to demonstrate strong results, as seen in combinatorial optimization, and (ii) the availability of training data is inherently…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
