Pith. sign in

REVIEW 1 cited by

The limitation of neural nets for approximation and optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.12253 v1 pith:35EC4HEM submitted 2023-11-21 cs.LG math.OCstat.ML

classification cs.LGmath.OCstat.ML
keywords neuralmodelsnetworksoptimizationfunctionobjectiveregressionfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We are interested in assessing the use of neural networks as surrogate models to approximate and minimize objective functions in optimization problems. While neural networks are widely used for machine learning tasks such as classification and regression, their application in solving optimization problems has been limited. Our study begins by determining the best activation function for approximating the objective functions of popular nonlinear optimization test problems, and the evidence provided shows that~SiLU has the best performance. We then analyze the accuracy of function value, gradient, and Hessian approximations for such objective functions obtained through interpolation/regression models and neural networks. When compared to interpolation/regression models, neural networks can deliver competitive zero- and first-order approximations (at a high training cost) but underperform on second-order approximation. However, it is shown that combining a neural net activation function with the natural basis for quadratic interpolation/regression can waive the necessity of including cross terms in the natural basis, leading to models with fewer parameters to determine. Lastly, we provide evidence that the performance of a state-of-the-art derivative-free optimization algorithm can hardly be improved when the gradient of an objective function is approximated using any of the surrogate models considered, including neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Enhancing finite-difference based derivative-free optimization methods with machine learning

    math.OC 2025-02 conditional novelty 6.0 of 10

    A surrogate trained with Sobolev learning accelerates a finite-difference derivative-free method, with a complexity bound that improves with the average number of successful surrogate steps.

Pith tools