mlsanityData to 14 Oct 2026

Harmonizing Program Induction with Rate-Distortion Theory

arXiv 2405.05294 ↗First posted 8 May 2024cs.HC cs.CL cs.ITcited by 4

Not on the map. Why?

Abstract (arXiv)

Many aspects of human learning have been proposed as a process of constructing mental programs: from acquiring symbolic number representations to intuitive theories about the world. In parallel, there is a long-tradition of using information processing to model human cognition through Rate Distortion Theory (RDT). Yet, it is still poorly understood how to apply RDT when mental representations take the form of programs. In this work, we adapt RDT by proposing a three way trade-off among rate (description length), distortion (error), and computational costs (search budget). We use simulations on a melody task to study the implications of this trade-off, and show that constructing a shared program library across tasks provides global benefits. However, this comes at the cost of sensitivity to curricula, which is also characteristic of human learners. Finally, we use methods from partial information decomposition to generate training curricula that induce more effective libraries and better generalization.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 5 of its 44 references that are in the map. First posted on arXiv 8 May 2024.

Builds on

5 of 44 references.

References · 5

  1. 2024Predictive, scalable and interpretable knowledge tracing on structured domainscited by 13
  2. 2023Exploring the hierarchical structure of human plans via program generationcited by 12
  3. 2022Synergistic information supports modality integration and flexible learning in neural networks solving multiple taskscited by 8
  4. 2021Towards an extended taxonomy of information dynamics via Integrated Information Decompositioncited by 4
  5. 2020Sequence Generation using Deep Recurrent Networks and Embeddings: A study case in musiccited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.