English

Approximation with SiLU Networks: Constant Depth and Exponential Rates for Basic Operations

Machine Learning 2026-02-24 v2 Numerical Analysis Numerical Analysis

Abstract

We present SiLU network constructions whose approximation efficiency depends critically on proper hyperparameter tuning. For the square function x2x^2, with optimally chosen shift aa and scale β\beta, we achieve approximation error ε\varepsilon using a two-layer network of constant width, where weights scale as β±k\beta^{\pm k} with k=O(ln(1/ε))k = \mathcal{O}(\ln(1/\varepsilon)). We then extend this approach through functional composition to Sobolev spaces, we obtain networks with depth O(1)\mathcal{O}(1) and O(εd/n)\mathcal{O}(\varepsilon^{-d/n}) parameters under optimal hyperparameters settings. Our work highlights the trade-off between architectural depth and activation parameter optimization in neural network approximation theory.

Keywords

Cite

@article{arxiv.2512.12132,
  title  = {Approximation with SiLU Networks: Constant Depth and Exponential Rates for Basic Operations},
  author = {Koffi O. Ayena},
  journal= {arXiv preprint arXiv:2512.12132},
  year   = {2026}
}

Comments

22 pages, 18 figures, submitted to the journal

R2 v1 2026-07-01T08:23:08.037Z