Representations of Boolean Functions by Perceptron Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F14%3A00432428" target="_blank" >RIV/67985807:_____/14:00432428 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Representations of Boolean Functions by Perceptron Networks
Original language description
Limitations of capabilities of shallow perceptron networks are investigated. Lower bounds are derived for growth of numbers of units and sizes of output weights in networks representing Boolean functions of d variables. It is shown that for large d, almost any randomly chosen Boolean function cannot be tractably represented by shallow perceptron networks, i.e., each its representation requires a network with number of units or sizes of output weights depending on d exponentially
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
2014
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
ITAT 2014. Information Technologies - Applications and Theory. Part II
ISBN
978-80-87136-19-5
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
68-70
Publisher name
Institute of Computer Science AS CR
Place of publication
Prague
Event location
Demänovská dolina
Event date
Sep 25, 2014
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—