paper-with-me

홈 › Papers

Understanding the Countably Infinite: Neural Network Models of the Successor Function and its Acquisition

2023-11-26 · Vima Gupta, Sashank Varma

As children enter elementary school, their understanding of the ordinal structure of numbers transitions from a memorized count list of the first 50-100 numbers to knowing the successor function and understanding the countably infinite. We investigate this developmental change in two neural network models that learn the successor function on the pairs (N, N+1) for N in (0, 98). The first uses a one-hot encoding of the input and output values and corresponds to children memorizing a count list, while the second model uses a place-value encoding and corresponds to children learning the language rules for naming numbers. The place-value model showed a predicted drop in representational similarity across tens boundaries. Counting across a tens boundary can be understood as a vector operation in 2D space, where the numbers with the same tens place are organized in a linearly separable manner, whereas those with the same ones place are grouped together. A curriculum learning simulation shows that, in the expanding numerical environment of the developing child, representations of smaller numbers continue to be sharpened even as larger numbers begin to be learned. These models set the stage for future work using recurrent architectures to move beyond learning the successor function to simulating the counting process more generally, and point towards a deeper understanding of what it means to understand the countably infinite.

📄 PDF Abstract BibTeX arXiv:2311.15194

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Ambiguity Hierarchy of Regular Infinite Tree Languages

2020-09-07 · Alexander Rabinovich, Doron Tiferet

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambig…

Probabilistic Inference with Generating Functions for Poisson Latent Variable Models

2016-12-01 · NeurIPS 2016 12 · Kevin Winner, Daniel R. Sheldon

Graphical models with latent count variables arise in a number of fields. Standard exact inference techniques such as variable elimination and belief propagation do not apply to these models because the latent variables …

Value Functions as Supermartingale Certificates

2026-05-29 · Alessandro Abate, Daniel Contro, Mirco Giacobbe, Agustín Martínez-Suñé 외 arxiv

Certification methods for stochastic systems provide sufficient proof rules, based on real-valued supermartingale certificates, to determine the almost-sure satisfaction of $ω$-regular properties (and therefore of linear…

Reinforcement Learning

On Accuracy and Coherence with Infinite Opinion Sets

2020-07-28 · Mikayla Kelley

There is a well-known equivalence between avoiding accuracy dominance and having probabilistically coherent credences (see, e.g., de Finetti 1974, Joyce 2009, Predd et al. 2009, Schervish et al. 2009, Pettigrew 2016). Ho…

Learning Successor States and Goal-Dependent Values: A Mathematical Viewpoint

2021-01-18 · Léonard Blier, Corentin Tallec, Yann Ollivier

In reinforcement learning, temporal difference-based algorithms can be sample-inefficient: for instance, with sparse rewards, no learning occurs until a reward is observed. This can be remedied by learning richer objects…