Skip to content
Preprint

Mathematical Principles and Experimental Discoveries of the Emergence of Symbolic Patterns in Artificial Neural Networks

Aug 2026 · 0 citations
Computer Science

TL;DR

It is shown that across a broad class of ANNs trained on diverse tasks, their inference logic can indeed be reformulated as sparse symbolic interactions, and two common mathematical criteria lead to the emergence of such sparse symbolic interactions.

Abstract

Artificial Neural networks (ANNs) are often treated as black-box models, making explainability a central challenge in deep learning. Many engineering methods have been proposed to approximately explain the ANN from various perspectives, such as feature attribution and visualization. However, it remains a long-standing open question whether the complex inference logic of an ANN can be explained exhaustively and concisely as sparse symbolic patterns. This raises a deeper inquiry: does the emergence of symbolic patterns reflect a natural law rather than chance? Here, we show that across a broad class of ANNs trained on diverse tasks, their inference logic can indeed be reformulated as sparse symbolic interactions. We further prove that two common mathematical criteria, which are implicitly required across tasks, lead to the emergence of such sparse symbolic interactions. Empirical evidence confirms that the two criteria hold for the majority of input samples in diverse models. Furthermore, the faithfulness of these interactions is also demonstrated by their strong sample-to-sample and model-to-model transferability, as well as their ability to explain the overall generalization power of ANNs. Our theoretical analysis and extensive experiments provide a solid foundation for symbolic explanations of ANNs, and offer novel insights into the ANN's generalization power. Our findings also highlight the potential of communicative learning, a paradigm in which the inference logic of an ANN can be directly inspected and tuned at the level of symbolic patterns, thus complementing traditional end-to-end learning paradigm. Finally, the observed emergence of symbolic patterns in ANNs suggests that similar symbolic representations may also emerge in other types of black-box systems under certain conditions, because our proof does not depend on any specific ANN architecture.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

The Emergent Symbolic Structure of Artificial Neural Networks

It is shown that the vector representations of a variety of neural networks can be closely approximated with symbolic structures, providing a potential way to reconcile longstanding symbolic conceptions of intelligence with the vector-based nature of modern AI.

R. Thomas McCoy, Paul Soulos, Tal Linzen et al. · 1 citation
Review Open access Jul 2026

Symbols and Neurons: A Review of Symbolic XAI in Deep Learning

A systematic review and synthesis of symbolic explainable AI (XAI) for deep learning is provided and a conceptual framework is proposed that clarifies training–inference flows, explanation interfaces, human feedback, and governance touchpoints is proposed.

Eduard Ionel Stan, G. Sciavicco, Paolo Napoletano · 0 citations
#machine learning Preprint Sep 2026

Neuron Activation-based Computation of Logical Explanations for Deep Neural Networks

Formal explainability of classifying neural networks (NNs) is an active area of research, providing explanations with provable guarantees of the classification within continuous regions of the input feature space. However, the existing techniques are either limited to individual input features without guarantees on their relations or the provided solutions fail to scale to deep architectures. This paper addresses these issues by introducing a flexible symbolic framework for an efficient, guided computation of explanations of the NN behavior, parametrized by the activations of internal neurons, and using logical engines such as SMT solvers. Unlike prior methods that rely on specialized NN verifiers, our method yields explanations that are not restricted in shape. Our algorithm is implementable on top of a general-purpose logical solver, isolating the NN-specific encoding from the algorithmic framework. We experimented with a wide range of benchmarks from the domains of image recognition and medicine, illustrating the advantages of the new method, particularly in computational efficiency. Notably, our approach enables logical explanation of deep networks not amenable to prior logic-based methods.

Tomáš Kolárik, Faezeh Labbaf, Fabrizio Leopardi et al. · 0 citations
Review Open access Jul 2026

Symbol Grounding in Neuro-Symbolic AI: A Gentle Introduction to Reasoning Shortcuts

This overview addresses this issue by providing a gentle introduction to RSs, discussing their causes and consequences in intuitive terms, and details methods for dealing with RSs, including mitigation and awareness strategies, and maps their benefits and limitations.

E. Marconato, Samuele Bortolotti, Emile van Krieken et al. · 1 citation
2026

Using Craig Interpolation for Explanation of Neural Networks (Abstract)

This work introduces space explanations, a logic-based notion of explanation that represents sufficient conditions for a neural network to predict a given class over a (potentially large and geometrically complex) subset of the feature space and demonstrates that the interpolation-based explanations are more meaningful than those computed by state-of-the-art techniques.

Faezeh Labbaf, Tomáš Kolárik, Martin Blicha et al. · 0 citations

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