Keywords: Algebraic topology, persistent homology, network complexity, neural network
TL;DR: We develop a new topological complexity measure for deep neural networks and demonstrate that it captures their salient properties.
Abstract: While many approaches to make neural networks more fathomable have been proposed, they are restricted to interrogating the network with input data. Measures for characterizing and monitoring structural properties, however, have not been developed. In this work, we propose neural persistence, a complexity measure for neural network architectures based on topological data analysis on weighted stratified graphs. To demonstrate the usefulness of our approach, we show that neural persistence reflects best practices developed in the deep learning community such as dropout and batch normalization. Moreover, we derive a neural persistence-based stopping criterion that shortens the training process while achieving comparable accuracies as early stopping based on validation loss.
Code: [![github](/images/github_icon.svg) BorgwardtLab/Neural-Persistence](https://github.com/BorgwardtLab/Neural-Persistence)