Deep Networks: Overview
From Ufldl
(→Overview) |
(→Advantages of deep networks) |
||
| Line 31: | Line 31: | ||
unless it has an exponentially large number of hidden units. | unless it has an exponentially large number of hidden units. | ||
| - | To take a simple example, consider building a boolean | + | 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 logical | the network can compute either the logical OR of its inputs (or the logical | ||
