Compositionality and Generalization in Emergent Languages

被引:0
|
作者
Chaabouni, Rahma [1 ,2 ]
Kharitonov, Eugene [1 ]
Bouchacourt, Diane [1 ]
Dupoux, Emmanuel [1 ,2 ]
Baroni, Marco [1 ,3 ]
机构
[1] Facebook AI Res, Paris, France
[2] PSL Res Univ, INRIA, CNRS, Cognit Machine Learning ENS,EHESS, Paris, France
[3] ICREA, Barcelona, Spain
关键词
EVOLUTION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Natural language allows us to refer to novel composite concepts by combining expressions denoting their parts according to systematic rules, a property known as compositionality. In this paper, we study whether the language emerging in deep multi-agent simulations possesses a similar ability to refer to novel primitive combinations, and whether it accomplishes this feat by strategies akin to human-language compositionality. Equipped with new ways to measure compositionality in emergent languages inspired by disentanglement in representation learning, we establish three main results. First, given sufficiently large input spaces, the emergent language will naturally develop the ability to refer to novel composite concepts. Second, there is no correlation between the degree of compositionality of an emergent language and its ability to generalize. Third, while compositionality is not necessary for generalization, it provides an advantage in terms of language transmission: The more compositional a language is, the more easily it will be picked up by new learners, even when the latter differ in architecture from the original agents. We conclude that compositionality does not arise from simple generalization pressure, but if an emergent language does chance upon it, it will be more likely to survive and thrive.
引用
收藏
页码:4427 / 4442
页数:16
相关论文
共 50 条
  • [21] Generalization and specialization strategies for learning re languages
    Jain, S
    Sharma, A
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1998, 23 (1-2) : 1 - 26
  • [22] An algebraic generalization of w-regular languages
    Ésik, Z
    Kuich, W
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 648 - 659
  • [23] Understanding Robust Generalization in Learning Regular Languages
    Dan, Soham
    Bastani, Osbert
    Roth, Dan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [24] THE GENERALIZATION OF EMERGENT RELATIONS IN EQUIVALENCE CLASSES - STIMULUS SUBSTITUTABILITY
    FIELDS, L
    ADAMS, BJ
    BROWN, JL
    VERHAVE, T
    PSYCHOLOGICAL RECORD, 1993, 43 (02): : 235 - 254
  • [25] Old languages in new academic spaces: emergent pedagogy for tertiary programmes in Pacific languages
    Willans, Fiona
    LANGUAGE LEARNING JOURNAL, 2020, 48 (03): : 346 - 355
  • [26] Logical conditions in programming languages: review, discussion and generalization
    Nagy, Benedek
    Abuhmaidan, Khaled
    Aldwairi, Monther
    ANNALES MATHEMATICAE ET INFORMATICAE, 2023, 57 : 65 - 77
  • [27] A generalization of Myhill-Nerode theorem for fuzzy languages
    Gonzalez de Mendivil, Jose R.
    FUZZY SETS AND SYSTEMS, 2016, 301 : 103 - 115
  • [28] On Generalization of Definitional Equivalence to Non-Disjoint Languages
    Lefever, Koen
    Szekely, Gergely
    JOURNAL OF PHILOSOPHICAL LOGIC, 2019, 48 (04) : 709 - 729
  • [29] On Generalization of Definitional Equivalence to Non-Disjoint Languages
    Koen Lefever
    Gergely Székely
    Journal of Philosophical Logic, 2019, 48 : 709 - 729
  • [30] Logical conditions in programming languages: review, discussion and generalization
    Nagy, Benedek
    Abuhmaidan, Khaled
    Aldwairi, Monther
    ANNALES MATHEMATICAE ET INFORMATICAE, 2023, 57 : 65 - 77