The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
From MaRDI portal
Publication:439836
DOI10.1007/S11432-011-4405-6zbMath1245.68159OpenAlexW2081631884MaRDI QIDQ439836
Zhenjin Huang, Juan Yang, Qiang Wang, Yang Lu
Publication date: 17 August 2012
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4405-6
Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Sign-representation of Boolean functions using a small number of monomials
- N-bit parity neural networks: new solutions based on linear programming
- Minimal Feedforward Parity Networks Using Threshold Gates
- Extracting Rules from Neural Networks by Pruning and Hidden-Unit Splitting
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}n
This page was built for publication: The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
