Deep Networks: Overview
From Ufldl
(→Advantages of deep networks) |
(→Advantages of deep networks) |
||
Line 33: | Line 33: | ||
To take a simple example, consider building a boolean circuit/network to | To take a simple example, consider building a boolean circuit/network to | ||
compute the parity (or XOR) of <math>n</math> input bits. Suppose each node in | compute the parity (or XOR) of <math>n</math> input bits. Suppose each node in | ||
- | the network can compute either the logical OR of its inputs (or the | + | the network can compute either the logical OR of its inputs (or the OR of the |
negation of the inputs), or compute the logical AND. If we have a network with | negation of the inputs), or compute the logical AND. If we have a network with | ||
only 1 hidden layer, the parity function would require a number of nodes that | only 1 hidden layer, the parity function would require a number of nodes that |