Published July 2021
| public
Book Section - Chapter
Neural Network Computations with DOMINATION Functions
- Creators
- Kilic, Kordag Mehmet
- Bruck, Jehoshua
Abstract
We study a new representation of neural networks based on DOMINATION functions. Specifically, we show that a threshold function can be computed by its variables connected via an unweighted bipartite graph to a universal gate computing a DOMINATION function. The DOMINATION function consists of fixed weights that are ascending powers of 2. We derive circuit-size upper and lower bounds for circuits with small weights that compute DOMINATION functions. Interestingly, the circuit-size bounds are dependent on the sparsity of the bipartite graph. In particular, functions with sparsity 1 (like the EQUALITY function) can be implemented by small-size constant-weight circuits.
Additional Information
© 2021 IEEE.Additional details
- Eprint ID
- 111819
- DOI
- 10.1109/isit45174.2021.9517872
- Resolver ID
- CaltechAUTHORS:20211110-155100881
- Created
-
2021-11-11Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field