Explicitising The Implicit Intrepretability of Deep Neural Networks Via Duality
Not on the map. Why?
Abstract (arXiv)
Recent work by Lakshminarayanan and Singh [2020] provided a dual view for fully connected deep neural networks (DNNs) with rectified linear units (ReLU). It was shown that (i) the information in the gates is analytically characterised by a kernel called the neural path kernel (NPK) and (ii) most critical information is learnt in the gates, in that, given the learnt gates, the weights can be retrained from scratch without significant loss in performance. Using the dual view, in this paper, we rethink the conventional interpretations of DNNs thereby explicitsing the implicit interpretability of DNNs. Towards this, we first show new theoretical properties namely rotational invariance and ensemble structure of the NPK in the presence of convolutional layers and skip connections respectively. Our theory leads to two surprising empirical results that challenge conventional wisdom: (i) the weights can be trained even with a constant 1 input, (ii) the gating masks can be shuffled, without any significant loss in performance. These results motivate a novel class of networks which we call deep linearly gated networks (DLGNs). DLGNs using the phenomenon of dual lifting pave way to more direct and simpler interpretation of DNNs as opposed to conventional interpretations. We show via extensive experiments on CIFAR-10 and CIFAR-100 that these DLGNs lead to much better interpretability-accuracy tradeoff.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 1 Mar 2022.
Builds on
33 of 46 references.
References · 33
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2017Grad-CAM++: Improved Visual Explanations for Deep Convolutional Networkscited by 936
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 364
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
21 more
- 2015Highway Networkscited by 257
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2018Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processescited by 164
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 156
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
- 2017Recovery Guarantees for One-hidden-layer Neural Networkscited by 94
- 2017Learning One-hidden-layer Neural Networks with Landscape Designcited by 79
- 2019Enhanced Convolutional Neural Tangent Kernelscited by 76
- 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 76
- 2020On the Similarity between the Laplace and Neural Tangent Kernelscited by 76
- 2019Width Provably Matters in Optimization for Deep Linear Neural Networkscited by 52
- 2018Learning One-hidden-layer ReLU Networks via Gradient Descentcited by 50
- 2017Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minimacited by 40
- 2019Gated Linear Networkscited by 26
- 2018Exponential Convergence Time of Gradient Descent for One-Dimensional Deep Linear Neural Networkscited by 22
- 2021Credit Assignment Through Broadcasting a Global Error Vectorcited by 19
- 2018From Hard to Soft: Understanding Deep Network Nonlinearities via Vector Quantization and Statistical Inferencecited by 13
- 2019Decoupling Gating from Linearitycited by 13
- 2020Neural Path Features and Neural Path Kernel : Understanding the role of gates in deep learningcited by 7
Built on by
Citing papers per year: 2025: 1.
1 paper.