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.
Abstract
Modern systems in artificial intelligence (AI) somehow excel in domains for which they seem poorly suited. Intelligence has traditionally been modeled as operating over structured combinations of symbols, such as logical formulas. However, the strongest modern AI systems are based on neural networks, which instead represent information in continuous vectors. Vectors seem inadequate for capturing the structure of language, logic, and other cognitive domains, yet neural networks achieve impressive performance in these areas. How do they do it? In this work, we propose a potential answer: Despite appearances, perhaps the internal representations of neural networks implicitly realize symbolic structure. In support of this hypothesis, we show that the vector representations of a variety of neural networks can be closely approximated with symbolic structures: we can replace the network's entire representation-generating process with a closed-form equation instantiating a symbolic structure, and the network's behavior remains largely unchanged. This finding holds for both small-scale neural networks trained to manipulate lists as well as large language models (LLMs) operating in four domains that are central in symbolic traditions: arithmetic, logic, computer code, and language. Further, our symbolic approximation allows us to modify an LLM's behavior in targeted ways via precise interventions on its internal representations, showing that the LLM's behavior is reliant on the symbolic structures we have identified. This work provides a potential way to reconcile longstanding symbolic conceptions of intelligence with the vector-based nature of modern AI.
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.
It is concluded that explaining how language can emerge from neural population codes, in both biological and artificial systems, will not be achieved through the incremental refinement of algebraic-symbolic theories but will demand new theoretical paradigms.
Samuel A. Nastase, Zaid Zada, A. Goldberg et al.· Neuron· 1 citation
A neuro-symbolic framework for automatic CA that significantly reduces user involvement by introducing neural Oracle Transformer models which learn to emulate user responses and to generalize conceptual knowledge is proposed.
Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar et al.· 0 citations
This work develops a mathematical formalization that is grounded in Category Theory, in order to enable proof-based guarantees of properties of neuro-symbolic systems, and advances the theoretical foundations of neuro-symbolic AI by supporting principled design of HI systems.
Johannes E. Bendler· Proceedings of the Thirty-Fi...· 0 citations
A class of architectures in which the update operator applied to the hidden state is the denotation of a linear logic proof is defined, and it is established that this construction yields smooth (differentiable) functions suitable for gradient-based optimization.
Akhil Veluru· International Journal of Art...· 0 citations