Function Approximation with Randomly Initialized Neural Networks for Approximate Model Reference Adaptive Control
Not on the map. Why?
Abstract (arXiv)
Classical results in neural network approximation theory show how arbitrary continuous functions can be approximated by networks with a single hidden layer, under mild assumptions on the activation function. However, the classical theory does not give a constructive means to generate the network parameters that achieve a desired accuracy. Recent results have demonstrated that for specialized activation functions, such as ReLUs and some classes of analytic functions, high accuracy can be achieved via linear combinations of randomly initialized activations. These recent works utilize specialized integral representations of target functions that depend on the specific activation functions used. This paper defines mollified integral representations, which provide a means to form integral representations of target functions using activations for which no direct integral representation is currently known. The new construction enables approximation guarantees for randomly initialized networks for a variety of widely used activation functions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 36 references that are in the map. First posted on arXiv 28 Mar 2023.
Builds on
15 of 36 references.
References · 15
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2017Self-Normalizing Neural Networkscited by 591
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2019On the Power and Limitations of Random Features for Understanding Neural Networkscited by 103
- 2017Continuously Differentiable Exponential Linear Unitscited by 73
- 2020Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learningcited by 33
- 2021On the Approximation Power of Two-Layer Networks of Random ReLUscited by 29
Built on by
Not cited yet.