When is approximation by Gaussian networks necessarily a linear process?
type: Item
instance of: scholarly article
title: When is approximation by Gaussian networks necessarily a linear process?
zbMATH Open document ID: 1084.68104
published in: Neural Networks
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 2116582
zbMATH Keywords: Gaussian networks
zbMATH Keywords: Converse theorems
zbMATH Keywords: Weighted polynomial approximation Hermite polynomials
Wikidata QID: Q44319882
author: H. N. Mhaskar
MaRDI profile type: Publication
full work available at URL: j.neunet.2004.04.001
OpenAlex ID: W2087948458
cites work: Optimal nonlinear approximation
cites work: Q3485377
cites work: On direct and converse theorems in the theory of weighted polynomial approximation
cites work: Bounds on rates of variable-basis and neural-network approximation
cites work: Comparison of worst case errors in linear and neural network approximation
cites work: Q5534403
cites work: Q4857769
cites work: Q4421610
cites work: On the representation of band limited functions using finitely many bits
cites work: Interpolation of scattered data: distance matrices and conditionally positive definite functions
cites work: Norm estimates for the inverses of a general class of scattered-data radial-function interpolation matrices
cites work: Q4405392
DOI: 10.1016/J.NEUNET.2004.04.001
Recommended article: Q4694354
Recommended article: Constructive approximation by Gaussian neural networks
Recommended article: Gaussian approximation of stochastic processes with the linear regression
Recommended article: Q4943029
Recommended article: Q4508878
Recommended article: Q4351967
description: scientific article; zbMATH DE number 2116582