On the Size of Weights for Threshold Gates
Author:
- 1 May 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 7 (3) , 484-492
Abstract
It is proved that if n is a power of 2, then there is a threshold function on n inputs that requires weights of size around $2^{( n \log n )/2 - n} $. This almost matches the known upper bounds.
Keywords
This publication has 5 references indexed in Scilit:
- Neural networks and complexity theory1992
- Introduction to the Theory of Neural ComputationPhysics Today, 1991
- A Geometric Approach to Threshold Circuit Complexity1991
- Bounds on the Number of Threshold FunctionsIEEE Transactions on Electronic Computers, 1966
- A Lower Bound of the Number of Threshold FunctionsIEEE Transactions on Electronic Computers, 1965