KKT-based necessary optimality conditions for one-hidden-layer neural networks under L1 and L_infinity losses are expressed as convex set intersections, with the L_infinity conditions containing a sign error.
Nonsmooth Optimisation and neural networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we study neural networks from the point of view of nonsmooth optimisation, namely, quasidifferential calculus. We restrict ourselves to the case of uniform approximation by a neural network without hidden layers, the activation functions are restricted to continuous strictly increasing functions. We develop an algorithm for computing the approximation with one hidden layer through a step-by-step procedure. The nonsmooth analysis techniques demonstrated their efficiency. In particular, they partially explain why the developed step-by-step procedure may run without any objective function improvement after just one step of the procedure.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
KKT-based optimality conditions for neural network approximation
KKT-based necessary optimality conditions for one-hidden-layer neural networks under L1 and L_infinity losses are expressed as convex set intersections, with the L_infinity conditions containing a sign error.