mlsanityData to 7 Oct 2026

Exact Learning of Arithmetic with Differentiable Agents

arXiv 2511.22751 ↗First posted 27 Nov 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

We explore the possibility of exact algorithmic learning with gradient-based methods and introduce a differentiable framework capable of strong length generalization on arithmetic tasks. Our approach centers on Differentiable Finite-State Transducers (DFSTs), a Turing-complete model family that avoids the pitfalls of prior architectures by enabling constant-precision, constant-time generation, and end-to-end log-parallel differentiable training. Leveraging policy-trajectory observations from expert agents, we train DFSTs to perform binary and decimal addition and multiplication. Remarkably, models trained on tiny datasets generalize without error to inputs thousands of times longer than the training examples. These results show that training differentiable agents on structured intermediate supervision could pave the way towards exact gradient-based learning of algorithmic skills. Code available at hrefhttps://github.com/dngfra/differentiable-exact-algorithmic-learner.githttps://github.com/dngfra/differentiable-exact-algorithmic-learner.git.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 34 of its 44 references that are in the map. First posted on arXiv 27 Nov 2025.

Builds on

34 of 44 references.

References · 34

  1. 2015Pointer Networkscited by 882
  2. 2014Neural Turing Machinescited by 630
  3. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
  4. 2023The Impact of Positional Encoding on Length Generalization in Transformerscited by 319
  5. 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
  6. 2022Transformers Learn Shortcuts to Automatacited by 260
  7. 2022Neural Networks and the Chomsky Hierarchycited by 214
  8. 2022Exploring Length Generalization in Large Language Modelscited by 204
  9. 2023What Algorithms can Transformers Learn? A Study in Length Generalizationcited by 198
  10. 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 191
  11. 2024The Illusion of State in State-Space Modelscited by 181
  12. 2025Hierarchical Reasoning Modelcited by 167
22 more
  1. 2019On the Turing Completeness of Modern Neural Network Architecturescited by 129
  2. 2023Teaching Arithmetic to Small Transformerscited by 121
  3. 2015Neural GPUs Learn Algorithmscited by 118
  4. 2018On the Practical Computational Power of Finite Precision RNNs for Language Recognitioncited by 117
  5. 2015Neural Programmer-Interpreterscited by 96
  6. 2020On the Computational Power of Transformers and its Implications in Sequence Modelingcited by 85
  7. 2024Transformers Can Achieve Length Generalization But Not Robustlycited by 82
  8. 2015Inferring Algorithmic Patterns with Stack-Augmented Recurrent Netscited by 76
  9. 2023Length Generalization in Arithmetic Transformerscited by 64
  10. 2023Positional Description Matters for Transformers Arithmeticcited by 56
  11. 2015Learning to Transduce with Unbounded Memorycited by 54
  12. 2019Sequential Neural Networks as Automatacited by 54
  13. 2015Neural Random-Access Machinescited by 32
  14. 2024Universal Length Generalization with Turing Programscited by 25
  15. 2024Position Coupling: Improving Length Generalization of Arithmetic Transformers Using Task Structurecited by 22
  16. 2024Arithmetic Transformers Can Length-Generalize in Both Operand Length and Countcited by 18
  17. 2024Autoregressive Large Language Models are Computationally Universalcited by 14
  18. 2025Learning Algorithms in the Limitcited by 9
  19. 2016Extensions and Limitations of the Neural GPUcited by 7
  20. 2023Recurrent Neural Language Models as Probabilistic Finite-state Automatacited by 6
  21. 2025Beyond Statistical Learning: Exact Learning Is Essential for General Intelligencecited by 6
  22. 2016Learning Efficient Algorithms with Hierarchical Attentive Memorycited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.