Efficiency, learnability, and structure in recursive systems of communication
Licentiate thesis, 2026

Language is fundamentally shaped by pressures for efficient communication, typically characterised as a trade-off between simplicity and informativeness. While both information-theoretic models and multi-agent reinforcement learning have successfully captured these dynamics, they predominantly treat linguistic terms as atomic labels. Consequently, these existing frameworks struggle to account for the systematicity and recursiveness that are prevalent across languages.

This thesis extends the study of efficient communication to compositional domains with productive morphosyntax, focusing primarily on recursive numeral systems. Across four contributions, we employ computational modeling to explore how functional and learning pressures shape structured languages. First, we show through multi-agent reinforcement learning that artificial agents optimised solely for communicative success tend to prefer more efficient recursive numeral systems. Second, we argue that previous efficiency measures cannot account for regularity and introduce a different trade-off that can separate human systems from artificial ones that were previously considered optimal but were lacking human-likeness. Third, we connect regularity to learnability, using reinforcement learning to show that human numeral systems exhibit high regularity because they are inherently easier to learn. Finally, we expand this framework to an open-ended collaborative building task, showing that agents utilising procedural abstractions develop languages that minimise similar efficiency trade-offs.

Overall, this work attempts to bridge the gap between efficient communication models and the compositional reality of language, demonstrating how structure is consistently preferred because of communicative and cognitive constraints.

Efficient communication

Reinforcement Learning

Recursive numeral systems

Learnability

Regularity

Room ED, EDIT building
Opponent: Prof. Jakub Szymanik, Center for Mind/Brain Sciences and Department of Information Engineering and Computer Science, University of Trento, Italy.

Author

Andrea Silvi

Chalmers, Computer Science and Engineering (Chalmers), Data Science and AI

Learning Efficient Recursive Numeral Systems via Reinforcement Learning

Proceedings of the Annual Meeting of the Cognitive Science Society,;Vol. 47(2025)p. 4700-4707

Paper in proceeding

Recursive numeral systems are highly regular and easy to process.

Association for Computational Linguistics. European Chapter . Proceedings of the Conference.,;Vol. Volume 1: Long Papers(2026)p. 4873-4885

Paper in proceeding

Silvi, A., Prasertsom, P., Culbertson, J., Dubhashi, D., Johansson, M., Smith, K. Evaluating the relationship between regularity and learnability in recursive numeral systems using Reinforcement Learning

PACE: Procedural Abstractions for Communicating Efficiently

Proceedings of the Annual Meeting of the Cognitive Science Society,;Vol. 47(2025)

Paper in proceeding

Subject Categories (SSIF 2025)

Computer Sciences

Comparative Language Studies and Linguistics

Publisher

Chalmers

Room ED, EDIT building

Online

Opponent: Prof. Jakub Szymanik, Center for Mind/Brain Sciences and Department of Information Engineering and Computer Science, University of Trento, Italy.

More information

Latest update

6/2/2026 9