Skip to content
Review Open access

A survey of theory-grounded interpretability for deep neural networks

Aug 2026 · Journal of King Saud University: Computer and Information Sciences · Vol 38 · 0 citations · 278 references

TL;DR

This survey takes a complementary, theory-grounded perspective, examining interpretability through four classical machine learning (ML) frameworks, each grounded in a mature mathematical theory, and concludes with open problems and directions for scalable, theory-grounded interpretability.

Abstract

Deep neural networks achieve state-of-the-art performance across computer vision, natural language processing, and scientific discovery, yet their internal decision-making mechanisms remain difficult to interpret. Post-hoc explanation methods such as SHAP, saliency maps, and attention visualization provide empirical insights but offer limited mathematical guarantees about learning dynamics and representation formation. This survey takes a complementary, theory-grounded perspective, examining interpretability through four classical machine learning (ML) frameworks, each grounded in a mature mathematical theory. These are kernel methods (functional analysis), sparse representations (convex optimization), matrix factorization (linear algebra), and manifold learning (differential geometry). We synthesize and critically evaluate 203 papers (2016–2026), organizing them by the theoretical principle each framework contributes rather than by application domain. Neural tangent kernel (NTK) methods provide rigorous convergence and generalization guarantees but depend on idealized infinite-width assumptions; sparse representation methods yield interpretable-by-design architectures but face reconstruction and approximation trade-offs; matrix factorization reveals an implicit bias toward low-rank structure that helps explain generalization; and manifold learning offers geometric tools for analyzing representation structure, class separability, and generative behavior. Beyond reviewing each framework, we establish explicit mathematical bridges between them, arguing that they offer complementary views of a common phenomenon, namely that gradient-based optimization often drives deep networks toward low-dimensional, interpretable structure. We further situate these frameworks among adjacent interpretability paradigms, including mechanistic, concept-based, and attribution-based methods, and delineate the validity conditions and failure modes that determine when classical theory yields reliable rather than misleading explanations. The review concludes with open problems and directions for scalable, theory-grounded interpretability.

Read PDF

Similar papers

Preprint Aug 2026

Convergent Evolution in Neural Representation Space: Emergent Order in Deep Belief Networks

It is shown that layer-wise generative learning can spontaneously uncover and progressively amplify class-related structure in unlabeled data and improve average clustering can coexist with reduced accessibility for a few difficult class pairs.

Patrick Krauss, Achim Schilling, Andreas K. Maier et al. · 0 citations
#machine learning Preprint Sep 2026

Neural Symbollic Regression Using Deep Learning and Sparse Modelling

A scalable and understandable neural-symbolic framework that treats neural networks as functional preconditioners for symbolic discovery, creating a solid link between neural approximation and the discovery of sparse equations for scientific machine learning.

U. Ravikumar, S. Sumitra · 0 citations
Aug 2026

InDeed: Interpretable Image Deep Decomposition With Grounded Generalizability

Image decomposition aims to analyze an image into elementary components, which is essential for numerous downstream tasks and also by nature provides certain interpretability to the analysis. Deep learning can be powerful for such tasks, but surprisingly their combination with a focus on interpretability and generaliza...

Si-Han Wang, Shang-Qi Gao, Fuping Wu et al. · 0 citations
Review Open access Sep 2026

An Introduction to Stochastic Deep Learning

Stochastic neural network broadens deep learning from prediction‐oriented function approximation to a richer framework for statistical inference, and two related architectures are discussed: kernel‐expanded StoNet and sublinearly structured DNNs, which can be viewed as structural or theoretical extensions of the StoNet...

Fa-Ming Liang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.