Some Comparisons of Complexity in Dictionary-Based and Linear Computational Models
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00350421" target="_blank" >RIV/67985807:_____/11:00350421 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Some Comparisons of Complexity in Dictionary-Based and Linear Computational Models
Original language description
We compare upper bounds on worst-case errors in variable-basis approximation with lower bounds on such errors for any linear approximator. Using methods from nonlinear approximation and integral representations tailored to computational units, we describe some cases where neural networks outperform any linear approximator.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F08%2F1744" target="_blank" >GA201/08/1744: Complexity of perceptron and kernel networks</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
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
Name of the periodical
Neural Networks
ISSN
0893-6080
e-ISSN
—
Volume of the periodical
24
Issue of the periodical within the volume
2
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
—
UT code for WoS article
000287910100004
EID of the result in the Scopus database
—