On the Circuit Complexity of Sigmoid Feedforward Neural Networks


This paper aims to examine the circuit complexity of sigmoid activation feedforward artificial neural networks by placing them amongst several classic Boolean and threshold gate circuit complexity classes. The starting point is the class NN(k) defined by [Shawe-Taylor et al. (1992)] Classes of feedforward neural nets and their circuit complexity. Neural… (More)
DOI: 10.1016/0893-6080(96)00130-X


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics