Explorerβ€ΊMathematicsβ€ΊMathematics
Research PaperResearchia:202607.17025

Landscape analysis for shallow neural networks: Complete classification of critical points for cubic activation and affine target functions

Shokhrukh Ibragimov

Abstract

In this paper, we study the optimization landscape induced by the true loss for shallow polynomial neural networks (PNNs) with $\mathfrak{h} \in \mathbb{N}$ neurons on the hidden layer, one-dimensional input and output layers, and a monomial activation of degree $d \in \mathbb{N}$, trained against a non-constant affine linear target function. Our first main result provides for arbitrary activation degree $d$ a sharp existence/non-existence criterion for \emph{global minimizers} with necessary st...

Submitted: July 17, 2026Subjects: Mathematics; Mathematics

Description / Details

In this paper, we study the optimization landscape induced by the true loss for shallow polynomial neural networks (PNNs) with h∈N\mathfrak{h} \in \mathbb{N} neurons on the hidden layer, one-dimensional input and output layers, and a monomial activation of degree d∈Nd \in \mathbb{N}, trained against a non-constant affine linear target function. Our first main result provides for arbitrary activation degree dd a sharp existence/non-existence criterion for \emph{global minimizers} with necessary structural conditions. We show that the infimum of the loss is always zero and achievable with at least dd active and visible hidden neurons -- that is, hidden neurons with non-zero inner and outer weights -- with pairwise distinct pivots. In contrast, if h<d\mathfrak{h} < d, then the infimum cannot be attained and any minimizing sequence of parameters necessarily diverges to infinity. In the second main result, we provide a complete classification of all critical points of the loss function for the cubic activation. We show that the loss landscape admits no \emph{local maximizers}, critical points cannot have exactly two distinct pivots, global minimizers require at least three distinct pivots, critical points with no active hidden neurons correspond to \emph{saddle points} only, and consequently, \emph{non-global local minimizers} and non-trivial saddle points arise only in networks where all pivots coincide. Moreover, non-global local minimizers require all hidden neurons to be active and visible with exactly one hidden neuron having a slope sign matching that of the target function. Our second main result also guarantees that each hidden neuron of a critical point that is not a global minimizer has either input-dependent or zero contribution, but has no nonzero input-independent contribution, to its corresponding realization function.


Source: arXiv:2607.15173v1 - http://arxiv.org/abs/2607.15173v1 PDF: https://arxiv.org/pdf/2607.15173v1 Original Link: http://arxiv.org/abs/2607.15173v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jul 17, 2026
Topic:
Mathematics
Area:
Mathematics
Comments:
0
Bookmark