On the Circuit Complexity of Feedforward Neural Networks

Valeriu Beiu, Joos A. Peperstraete, Jan Vandewalle, Rudy Lauwereins

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    In this paper a network will be considered an acyclic graph. It has several input nodes (inputs) and some (at least one) output nodes (outputs). The nodes of the network are characterized by fan-in (the number of incoming edges) and fan-out (the number of outgoing edges), while the network has a certain size (the number of nodes) and depth (the number of edges on the longest input to output path). If with each edge a synaptic weight is associated and each node computes the weighted sum of its inputs to which a nonlinear activation function is then applied (artificial neuron), the network is a neural network (NN). Similarly, a Boolean circuit (BC) is a network of gates implementing elementary Boolean functions (AND, OR, NOT).
    Original languageEnglish
    Title of host publicationInternational Conference on Artificial Neural Networks
    Publication statusPublished - May 26 1994
    EventICANN'94 - Sorrento, Italy
    Duration: May 26 1994 → …


    Period5/26/94 → …


    Dive into the research topics of 'On the Circuit Complexity of Feedforward Neural Networks'. Together they form a unique fingerprint.

    Cite this