The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks (Q439836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6067189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks |
scientific article; zbMATH DE number 6067189 |
Statements
The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks (English)
0 references
17 August 2012
0 references
binary neural network
0 references
restraining neuron
0 references
\(n\)-bit parity problem
0 references
Hamming sphere
0 references
SP function
0 references
0 references
0.7746878862380981
0 references
0.7548935413360596
0 references
0.7334447503089905
0 references
0.7110662460327148
0 references
