Rates of Approximation by Neural Networks.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F00%3A06000136" target="_blank" >RIV/67985807:_____/00:06000136 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Rates of Approximation by Neural Networks.
Original language description
A theoretical framework for investigation of complexity of feedforward networks measured by the number of hidden units is presented in the context of nonlinear approximation theory. Upper bounds on rates of approximation by neural networks are derived interms of certain norms depending on types of computational units.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2000
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Quo Vadis Computational Intelligence? New Trends and Approaches in Computational Intelligence.
ISBN
3-7908-1324
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
—
Publisher name
Physica-Verlag
Place of publication
Heidelberg
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—