A mathematical theory of relational generalization in transitive inference

• Published in: Proceedings of the National Academy of Sciences - PNAS Vol. 121; no. 28; p. e2314511121
• Main Authors: Lippl, Samuel, Kay, Kenneth, Jensen, Greg, Ferrera, Vincent P., Abbott, L. F.
• Format: Journal Article
• Language: English
• Published: United States National Academy of Sciences 09.07.2024
• Subjects: Animals; Biological Sciences; Deep Learning; Generalization, Psychological; Humans; Mathematical Concepts; Physical Sciences; relational representations; relational learning; transitive inference; compositional generalization
• ISSN: 0027-8424; 1091-6490; 1091-6490
• DOI: 10.1073/pnas.2314511121

Humans and animals routinely infer relations between different items or events and generalize these relations to novel combinations of items. This allows them to respond appropriately to radically novel circumstances and is fundamental to advanced cognition. However, how learning systems (including the brain) can implement the necessary inductive biases has been unclear. We investigated transitive inference (TI), a classic relational task paradigm in which subjects must learn a relation ( A > B and B > C ) and generalize it to new combinations of items ( A > C ). Through mathematical analysis, we found that a broad range of biologically relevant learning models (e.g. gradient flow or ridge regression) perform TI successfully and recapitulate signature behavioral patterns long observed in living subjects. First, we found that models with item-wise additive representations automatically encode transitive relations. Second, for more general representations, a single scalar “conjunctivity factor” determines model behavior on TI and, further, the principle of norm minimization (a standard statistical inductive bias) enables models with fixed, partly conjunctive representations to generalize transitively. Finally, neural networks in the “rich regime,” which enables representation learning and improves generalization on many tasks, unexpectedly show poor generalization and anomalous behavior on TI. We find that such networks implement a form of norm minimization (over hidden weights) that yields a local encoding mechanism lacking transitivity. Our findings show how minimal statistical learning principles give rise to a classical relational inductive bias (transitivity), explain empirically observed behaviors, and establish a formal approach to understanding the neural basis of relational abstraction.