Interpretable neuron structuring with graph spectral regularization

A Tong, D van Dijk, JS Stanley III, M Amodio… - Advances in Intelligent …, 2020 - Springer
Advances in Intelligent Data Analysis XVIII: 18th International Symposium on …, 2020Springer
While neural networks are powerful approximators used to classify or embed data into lower
dimensional spaces, they are often regarded as black boxes with uninterpretable features.
Here we propose Graph Spectral Regularization for making hidden layers more
interpretable without significantly impacting performance on the primary task. Taking
inspiration from spatial organization and localization of neuron activations in biological
networks, we use a graph Laplacian penalty to structure the activations within a layer. This …
Abstract
While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features. Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on the primary task. Taking inspiration from spatial organization and localization of neuron activations in biological networks, we use a graph Laplacian penalty to structure the activations within a layer. This penalty encourages activations to be smooth either on a predetermined graph or on a feature-space graph learned from the data via co-activations of a hidden layer of the neural network. We show numerous uses for this additional structure including cluster indication and visualization in biological and image data sets.
Springer