Limitations of One-Hidden-Layer Perceptron Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F15%3A00447921" target="_blank" >RIV/67985807:_____/15:00447921 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Limitations of One-Hidden-Layer Perceptron Networks
Original language description
Limitations of one-hidden-layer perceptron networks to represent efficiently finite mappings is investigated. It is shown that almost any uniformly randomly chosen mapping on a sufficiently large finite domain cannot be tractably represented by a one-hidden-layer perceptron network. This existential probabilistic result is complemented by a concrete example of a class of functions constructed using quasi-random sequences. Analogies with central paradox of coding theory and no free lunch theorem are discussed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LD13002" target="_blank" >LD13002: Modeling of complex systems for softcomputing methods</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Proceedings ITAT 2015: Information Technologies - Applications and Theory
ISBN
978-1-5151-2065-0
ISSN
1613-0073
e-ISSN
—
Number of pages
5
Pages from-to
167-171
Publisher name
Technical University & CreateSpace Independent Publishing Platform
Place of publication
Aachen & Charleston
Event location
Slovenský Raj
Event date
Sep 17, 2015
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—