Pith. sign in

Nonsmooth Optimisation and neural networks

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

extension 1

citation-polarity summary

fields

math.OC 1

years

2025 1

verdicts

REJECT 1

roles

extension 1

polarities

extend 1

representative citing papers

KKT-based optimality conditions for neural network approximation

math.OC · 2025-06-18 · reject · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • KKT-based optimality conditions for neural network approximation math.OC · 2025-06-18 · reject · none · ref 10 · internal anchor

    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.