SgGN, by removing GN-matrix singularities via the algebraic structure of shallow ReLU nets and alternating linear/nonlinear solves, outperforms Adam on LSNN discretizations of discontinuous advection-reaction problems.
ReLU neural network approximation to piecewise constant functions
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper studies the approximation property of ReLU neural networks (NNs) to piecewise constant functions with unknown interfaces in bounded regions in $\mathbb{R}^d$. Under the assumption that the discontinuity interface $\Gamma$ may be approximated by a connected series of hyperplanes with a prescribed accuracy $\varepsilon >0$, we show that a three-layer ReLU NN is sufficient to accurately approximate any piecewise constant function and establish its error bound. Moreover, if the discontinuity interface is convex, an analytical formula of the ReLU NN approximation with exact weights and biases is provided.
fields
math.NA 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Structure-Guided Gauss-Newton Method: Linear Advection-Reaction Equation
SgGN, by removing GN-matrix singularities via the algebraic structure of shallow ReLU nets and alternating linear/nonlinear solves, outperforms Adam on LSNN discretizations of discontinuous advection-reaction problems.