Abstract
We provide a characterization of two types of directed homology for fully-connected, feedforward neural network architectures. These exact characterizations of the directed homology structure of a neural network architecture are the first of their kind. We show that the directed flag homology of deep networks reduces to computing the simplicial homology of the underlying undirected graph, which is explicitly given by Euler characteristic computations. We also show that the path homology of these networks is non-trivial in higher dimensions and depends on the number and size of the layers within the network. These results provide a foundation for investigating homological differences between neural network architectures and their realized structure as implied by their parameters.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 18th IEEE International Conference on Machine Learning and Applications, ICMLA 2019 |
Editors | M. Arif Wani, Taghi M. Khoshgoftaar, Dingding Wang, Huanjing Wang, Naeem Seliya |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1077-1082 |
Number of pages | 6 |
ISBN (Electronic) | 9781728145495 |
DOIs | |
State | Published - Dec 2019 |
Event | 18th IEEE International Conference on Machine Learning and Applications, ICMLA 2019 - Boca Raton, United States Duration: Dec 16 2019 → Dec 19 2019 |
Publication series
Name | Proceedings - 18th IEEE International Conference on Machine Learning and Applications, ICMLA 2019 |
---|
Conference
Conference | 18th IEEE International Conference on Machine Learning and Applications, ICMLA 2019 |
---|---|
Country/Territory | United States |
City | Boca Raton |
Period | 12/16/19 → 12/19/19 |
Bibliographical note
Publisher Copyright:© 2019 IEEE.
Keywords
- Deep Learning
- Homology
- Neural Networks
- Path Homology
- Topology