arXiv Analytics

Sign in

arXiv:2305.05562 [cs.LG]AbstractReferencesReviewsResources

SkelEx and BoundEx: Natural Visualization of ReLU Neural Networks

Pawel Pukowski, Haiping Lu

Published 2023-05-09Version 1

Despite their limited interpretability, weights and biases are still the most popular encoding of the functions learned by ReLU Neural Networks (ReLU NNs). That is why we introduce SkelEx, an algorithm to extract a skeleton of the membership functions learned by ReLU NNs, making those functions easier to interpret and analyze. To the best of our knowledge, this is the first work that considers linear regions from the perspective of critical points. As a natural follow-up, we also introduce BoundEx, which is the first analytical method known to us to extract the decision boundary from the realization of a ReLU NN. Both of those methods introduce very natural visualization tool for ReLU NNs trained on low-dimensional data.

Related articles: Most relevant | Search more
arXiv:2207.07696 [cs.LG] (Published 2022-07-15)
Algorithmic Determination of the Combinatorial Structure of the Linear Regions of ReLU Neural Networks
arXiv:2206.00228 [cs.LG] (Published 2022-06-01)
Lower and Upper Bounds for Numbers of Linear Regions of Graph Convolutional Networks
arXiv:2003.04273 [cs.LG] (Published 2020-03-09)
Finding Input Characterizations for Output Properties in ReLU Neural Networks