arXiv:1912.01498

Neural network interpretation using descrambler groups

Jake L. Amey, Jake Keeley, Tajwar Choudhury, Ilya Kuprov

제출 2019-12-02

원문 초록

The lack of interpretability and trust is a much-criticised feature of deep neural networks. In fully connected nets, the signalling 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 neutral 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 signalling 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 rectifier, frequency division multiplexing, group embedding, spectral filtering regularisation, and a Fourier-like transform that maps harmonic functions into Chebyshev polynomials - in ten minutes of unattended training from a random initial guess.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.