HOPE: High-order Polynomial Expansion of Black-box Neural Networks
Not on the map. Why?
Abstract (arXiv)
Despite their remarkable performance, deep neural networks remain mostly ``black boxes'', suggesting inexplicability and hindering their wide applications in fields requiring making rational decisions. Here we introduce HOPE (High-order Polynomial Expansion), a method for expanding a network into a high-order Taylor polynomial on a reference input. Specifically, we derive the high-order derivative rule for composite functions and extend the rule to neural networks to obtain their high-order derivatives quickly and accurately. From these derivatives, we can then derive the Taylor polynomial of the neural network, which provides an explicit expression of the network's local interpretations. Numerical analysis confirms the high accuracy, low computational complexity, and good convergence of the proposed method. Moreover, we demonstrate HOPE's wide applications built on deep learning, including function discovery, fast inference, and feature selection. The code is available at https://github.com/HarryPotterXTX/HOPE.git.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 51 references that are in the map. First posted on arXiv 17 Jul 2023.
Builds on
25 of 51 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
- 2017SmoothGrad: removing noise by adding noisecited by 1,097
- 2014Striving for Simplicity: The All Convolutional Netcited by 983
- 2016The Mythos of Model Interpretabilitycited by 716
13 more
- 2017DGM: A deep learning algorithm for solving partial differential equationscited by 674
- 2017Interpretable Explanations of Black Boxes by Meaningful Perturbationcited by 611
- 2019Interpretable machine learning: definitions, methods, and applicationscited by 303
- 2015Explaining NonLinear Classification Decisions with Deep Taylor Decompositioncited by 248
- 2017Visualizing Deep Neural Network Decisions: Prediction Difference Analysiscited by 166
- 2019The Shapley Taylor Interaction Indexcited by 143
- 2020Drug discovery with explainable artificial intelligencecited by 118
- 2022From Shapley Values to Generalized Additive Models and backcited by 59
- 2017Interpretable & Explorable Approximations of Black Box Modelscited by 54
- 2022SCI: A Spectrum Concentrated Implicit Neural Compression for Biomedical Datacited by 13
- 2021Towards a mathematical framework to inform Neural Network modelling via Polynomial Regressioncited by 6
- 2021NN2Poly: A polynomial representation for deep feed-forward artificial neural networkscited by 3
- 2023SHoP: A Deep Learning Framework for Solving High-order Partial Differential Equationscited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.