Neural network interpretation using descrambler groups.
Neural network interpretation using descrambler groups.
复制标题
DOI:
10.1073/pnas.2016917118
复制
发表时间:
2021-02-02
影响因子:
11.1
通讯作者:
Kuprov I
中科院分区:
文献类型:
--
作者:
Amey JL;Keeley J;Choudhury T;Kuprov I
Artificial neural networks are famously opaque—it is often unclear how they work. In this communication, we propose a group-theoretical way of finding out. It reveals considerable internal sophistication, even in simple neural networks: our nets apparently invented an elegant digital filter, a regularized integral transform, and even Chebyshev polynomials. This is a step toward saving reductionism. For centuries, the philosophical approach to science has been to find fundamental laws that govern reality, to test those laws, and to use their predictive power. Black-box neural networks amount to blasphemy within that school, but they are irresistible because they “just work.” Explaining how they work is a notoriously difficult problem, to which this paper offers a partial solution. The lack of interpretability and trust is a much-criticized feature of deep neural networks. In fully connected nets, the signaling between inner layers is scrambled because backpropagation training does not require perceptrons to be arranged in any particular order. The result is a black box; this problem is particularly severe in scientific computing and digital signal processing (DSP), where neural nets perform abstract mathematical transformations that do not reduce to features or concepts. We present here a group-theoretical procedure that attempts to bring inner-layer signaling into a human-readable form, the assumption being that this form exists and has identifiable and quantifiable features—for example, smoothness or locality. We applied the proposed method to DEERNet (a DSP network used in electron spin resonance) and managed to descramble it. We found considerable internal sophistication: the network spontaneously invents a bandpass filter, a notch filter, a frequency axis rescaling transformation, frequency-division multiplexing, group embedding, spectral filtering regularization, and a map from harmonic functions into Chebyshev polynomials—in 10 min of unattended training from a random initial guess.
登录
查看更多内容
影响因子:
6
作者:
Effati, Sohrab;Buzhabadi, Reza
通讯作者:
Buzhabadi, Reza
影响因子:
64.8
作者:
RUMELHART, DE;HINTON, GE;WILLIAMS, RJ
通讯作者:
WILLIAMS, RJ
影响因子:
2.7
作者:
LIU, DC;NOCEDAL, J
通讯作者:
NOCEDAL, J
影响因子:
22.7
作者:
Lipton, Zachary C.
通讯作者:
Lipton, Zachary C.
影响因子:
4
作者:
Gnecco, Giorgio;Kurkova, Vera;Sanguineti, Marcello
通讯作者:
Sanguineti, Marcello