The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks

DOI10.1007/S11432-011-4405-6MaRDI QIDQ439836zbMATH OpenOpenAlexFDO

Authors Juan Yang, Zhenjin Huang, Yang Lu, Qiang Wang

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

zbMATH Keywords

\(n\)-bit parity problembinary neural networkHamming sphererestraining neuronSP function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Minimal feedforward parity networks using threshold gates
• N-bit parity neural networks: new solutions based on linear programming
• The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network
• Solving the XOR and Parity \(n\) problems using a single universal binary neuron
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ

Cites work

• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• Extracting Rules from Neural Networks by Pruning and Hidden-Unit Splitting
• Minimal feedforward parity networks using threshold gates
• N-bit parity neural networks: new solutions based on linear programming
• Sign-representation of Boolean functions using a small number of monomials

Cited in

(3)

• The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network
• N-bit parity neural networks: new solutions based on linear programming
• Solving the XOR and Parity \(n\) problems using a single universal binary neuron

This page was built for publication: The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439836)