Counting Hidden Neural Networks

@inproceedings{Richard2016CountingHN,
  title={Counting Hidden Neural Networks},
  author={Anthony R. Richard},
  year={2016}
}
We apply combinatorial tools, including Pólya’s theorem, to enumerate all possible networks for which (1) the network contains distinguishable input and output nodes as well as partially distinguishable intermediate nodes; (2) all connections are directed and for each pair of nodes, there are at most two connections, that is, at most one connection per… CONTINUE READING