TY - JOUR
T1 - Topological measurement of deep neural networks using persistent homology
AU - Watanabe, Satoru
AU - Yamana, Hayato
N1 - Funding Information:
This work was supported in part by JST CREST, Japan, under Grant JPMJCR1503. We are also grateful to Hitachi, Ltd. for the tuition subsidy. The founder had no role in study design and technical investigation in this paper.
Funding Information:
This work was supported in part by JST CREST, Japan, under Grant JPMJCR1503. We are also grateful to Hitachi, Ltd. for the tuition subsidy. The founder had no role in study design and technical investigation in this paper.
Publisher Copyright:
© 2021, The Author(s).
PY - 2022/1
Y1 - 2022/1
N2 - The inner representation of deep neural networks (DNNs) is indecipherable, which makes it difficult to tune DNN models, control their training process, and interpret their outputs. In this paper, we propose a novel approach to investigate the inner representation of DNNs through topological data analysis (TDA). Persistent homology (PH), one of the outstanding methods in TDA, was employed for investigating the complexities of trained DNNs. We constructed clique complexes on trained DNNs and calculated the one-dimensional PH of DNNs. The PH reveals the combinational effects of multiple neurons in DNNs at different resolutions, which is difficult to be captured without using PH. Evaluations were conducted using fully connected networks (FCNs) and networks combining FCNs and convolutional neural networks (CNNs) trained on the MNIST and CIFAR-10 data sets. Evaluation results demonstrate that the PH of DNNs reflects both the excess of neurons and problem difficulty, making PH one of the prominent methods for investigating the inner representation of DNNs.
AB - The inner representation of deep neural networks (DNNs) is indecipherable, which makes it difficult to tune DNN models, control their training process, and interpret their outputs. In this paper, we propose a novel approach to investigate the inner representation of DNNs through topological data analysis (TDA). Persistent homology (PH), one of the outstanding methods in TDA, was employed for investigating the complexities of trained DNNs. We constructed clique complexes on trained DNNs and calculated the one-dimensional PH of DNNs. The PH reveals the combinational effects of multiple neurons in DNNs at different resolutions, which is difficult to be captured without using PH. Evaluations were conducted using fully connected networks (FCNs) and networks combining FCNs and convolutional neural networks (CNNs) trained on the MNIST and CIFAR-10 data sets. Evaluation results demonstrate that the PH of DNNs reflects both the excess of neurons and problem difficulty, making PH one of the prominent methods for investigating the inner representation of DNNs.
KW - Convolutional neural network
KW - Deep neural network
KW - Persistent Homology
KW - Topological data analysis
UR - http://www.scopus.com/inward/record.url?scp=85109252550&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85109252550&partnerID=8YFLogxK
U2 - 10.1007/s10472-021-09761-3
DO - 10.1007/s10472-021-09761-3
M3 - Article
AN - SCOPUS:85109252550
SN - 1012-2443
VL - 90
SP - 75
EP - 92
JO - Annals of Mathematics and Artificial Intelligence
JF - Annals of Mathematics and Artificial Intelligence
IS - 1
ER -