mlsanityData to 14 Oct 2026

A Group Theoretic Analysis of the Symmetries Underlying Base Addition and Their Learnability by Neural Networks

arXiv 2507.10678 ↗First posted 14 Jul 2025cs.LG cs.AI cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

A major challenge in the use of neural networks both for modeling human cognitive function and for artificial intelligence is the design of systems with the capacity to efficiently learn functions that support radical generalization. At the roots of this is the capacity to discover and implement symmetry functions. In this paper, we investigate a paradigmatic example of radical generalization through the use of symmetry: base addition. We present a group theoretic analysis of base addition, a fundamental and defining characteristic of which is the carry function -- the transfer of the remainder, when a sum exceeds the base modulus, to the next significant place. Our analysis exposes a range of alternative carry functions for a given base, and we introduce quantitative measures to characterize these. We then exploit differences in carry functions to probe the inductive biases of neural networks in symmetry learning, by training neural networks to carry out base addition using different carries, and comparing efficacy and rate of learning as a function of their structure. We find that even simple neural networks can achieve radical generalization with the right input format and carry function, and that learnability is closely correlated with carry function structure. We then discuss the relevance this has for cognitive science and machine learning.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 25 references that are in the map. First posted on arXiv 14 Jul 2025.

Builds on

9 of 25 references.

References · 9

  1. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
  2. 2021Investigating the Limitations of Transformers with Simple Arithmetic Taskscited by 139
  3. 2022Teaching Algorithmic Reasoning via In-context Learningcited by 112
  4. 2022Limitations of Language Models in Arithmetic and Symbolic Inductioncited by 71
  5. 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningcited by 63
  6. 2025Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language Modelscited by 31
  7. 2024Your Context Is Not an Array: Unveiling Random Access Limitations in Transformerscited by 11
  8. 2021What training reveals about neural network complexitycited by 5
  9. 2021A Self-Supervised Framework for Function Learning and Extrapolationcited by 2

Built on by

Not cited yet.