Dimension-independent bounds on the degree of approximation by neural networks
Explore this paper's citation graph
Summary
Enough conditions are studied in order that a neural network having a single hidden layer consisting of n neurons, each with an activation function φ, can be constructed so as to give a mean square approximation to f within a given accuracy, independent of the number of variables.
- Type
- article
- Published
- 1994-05-01
- Cited by
- 87
- References
- 14
- OpenAlex
- https://openalex.org/W2075407161
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17097536
Keywords
Dimension (graph theory), Univariate, Degree (music), Artificial neural network, Function (biology)
References
- Theory of Approximation of Functions of a Real Variable
- Optimal nonlinear approximation
- Approximation properties of a multilayered feedforward artificial neural network
- A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
- Theory of the backpropagation neural network
- Approximation by superposition of sigmoidal and radial basis functions
- The Chebyshev polynomials
- Multilayer feedforward networks are universal approximators
- Universal approximation bounds for superpositions of a sigmoidal function
- Approximation by superpositions of a sigmoidal function
- Multilayer feedforward networks are universal approximators
Cited by
- Generalization bounds for function approximation from scattered noisy data
- Multivariate data approximation with preprocessing of data
- Approximation Error Bounds via Rademacher's Complexity
- Implementing size-optimal discrete neural networks require analog circuitry
- On the near optimality of the stochastic approximation of smooth functions by neural networks
- The essential order of approximation for nearly exponential type neural networks
- System identification using neural networks
- Functional optimization by variable-basis approximation schemes
- Neural networks and approximation theory
- Complexity of Gaussian-radial-basis networks approximating smooth functions
- Universal Approximation Using Feedforward Neural Networks: A Survey of Some Existing Methods, and Some New Results
- On Best Approximation by Ridge Functions
- Rates of approximation of real-valued boolean functions by neural networks
- Lower estimation of approximation rate for neural networks
- Degree of Approximation by Neural and Translation Networks with a Single Hidden Layer
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
- Applications of classical approximation theory to periodic basis function networks and computational harmonic analysis
- Using a neural network based method to solve the vibrational Schrödinger equation for H2O
- Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
- Best approximation by ridge functions in Lp-spaces
Related papers
- Comparing multivariate and univariate subject-specific reference regions for blood constituents in healthy persons.
- An algorithm for seeking the maximum value of univariate functions
- The Multi-Item Univariate Delta Check Method: A New Approach
- What is the ‘best’ method of forecasting?
- Improving the Accuracy of Deep Neural Networks Through Developing New Activation Functions
- Encompassing univariate models in multivariate time series: A case study
- Univariate and Multivariate Outlier Identification for Skewed or Heavy-Tailed Distributions
- A Comparative Study between Univariate and Multivariate Linear Stationary Time Series Models