mlsanityData to 7 Oct 2026

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

arXiv 2512.12132 ↗First posted 13 Dec 2025cs.LG cs.NA math.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

We present SiLU network constructions whose approximation efficiency depends critically on proper hyperparameter tuning. For the square function x2, with optimally chosen shift a and scale β, we achieve approximation error varepsilon using a two-layer network of constant width, where weights scale as β± k with k = O(ln(1/varepsilon)). We then extend this approach through functional composition to Sobolev spaces, we obtain networks with depth O(1) and 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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 16 references that are in the map. First posted on arXiv 13 Dec 2025.

Builds on

9 of 16 references.

References · 9

  1. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  2. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
  3. 2016Error bounds for approximations with deep ReLU networkscited by 567
  4. 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
  5. 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 253
  6. 2016Benefits of depth in neural networkscited by 248
  7. 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 176
  8. 2019Neural Networks Learning and Memorization with (almost) no Over-Parameterizationcited by 23
  9. 2023GELU Activation Function in Deep Learning: A Comprehensive Mathematical Analysis and Performancecited by 16

Built on by

Not cited yet.