Learning Algebraic Representation for Systematic Generalization in Abstract Reasoning

被引:6
|
作者
Zhang, Chi [1 ]
Xie, Sirui [1 ]
Jia, Baoxiong [1 ]
Wu, Ying Nian [1 ]
Zhu, Song-Chun [1 ,2 ,3 ,4 ]
Zhu, Yixin [2 ]
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90095 USA
[2] Peking Univ, Inst Artificial Intelligence, Beijing 10080, Peoples R China
[3] Tsinghua Univ, Beijing 10080, Peoples R China
[4] Beijing Inst Gen Artificial Intelligence, Beijing 10080, Peoples R China
来源
关键词
INTELLIGENCE;
D O I
10.1007/978-3-031-19842-7_40
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Is intelligence realized by connectionist or classicist? While connectionist approaches have achieved superhuman performance, there has been growing evidence that such task-specific superiority is particularly fragile in systematic generalization. This observation lies in the central debate between connectionist and classicist, wherein the latter continually advocates an algebraic treatment in cognitive architectures. In this work, we follow the classicist's call and propose a hybrid approach to improve systematic generalization in reasoning. Specifically, we showcase a prototype with algebraic representation for the abstract spatialtemporal reasoning task of Raven's Progressive Matrices (RPM) and present the ALgebra-Aware Neuro-Semi-Symbolic (ALANS) learner. The ALANS learner is motivated by abstract algebra and the representation theory. It consists of a neural visual perception frontend and an algebraic abstract reasoning backend: the frontend summarizes the visual information from object-based representation, while the backend transforms it into an algebraic structure and induces the hidden operator on the fly. The induced operator is later executed to predict the answer's representation, and the choice most similar to the prediction is selected as the solution. Extensive experiments show that by incorporating an algebraic treatment, the ALANS learner outperforms various pure connectionist models in domains requiring systematic generalization. We further show the generative nature of the learned algebraic representation; it can be decoded by isomorphism to generate an answer.
引用
收藏
页码:692 / 709
页数:18
相关论文
共 50 条
  • [1] Abstract visual reasoning based on algebraic methods
    Zheng, Mingyang
    Wan, Weibing
    Fang, Zhijun
    SCIENTIFIC REPORTS, 2025, 15 (01):
  • [2] LEARNING AND GENERALIZATION OF ABSTRACT AND CONCRETE CONCEPTS
    REED, HB
    DICK, RD
    JOURNAL OF VERBAL LEARNING AND VERBAL BEHAVIOR, 1968, 7 (02): : 486 - &
  • [3] Neural representation of abstract task structure during generalization
    Vaidya, Avinash R.
    Jones, Henry M.
    Castillo, Johanny
    Badre, David
    ELIFE, 2021, 10
  • [4] Learning Algebraic Recombination for Compositional Generalization
    Liu, Chenyao
    An, Shengnan
    Lin, Zeqi
    Liu, Qian
    Chen, Bei
    Lou, Jian-Guang
    Wen, Lijie
    Zheng, Nanning
    Zhang, Dongmei
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL-IJCNLP 2021, 2021, : 1129 - 1144
  • [5] Generalization in algebra: the foundation of algebraic thinking and reasoning across the grades
    Becker, Joanne Rossi
    Rivera, F. D.
    ZDM-MATHEMATICS EDUCATION, 2008, 40 (01):
  • [6] Generalization in algebra: the foundation of algebraic thinking and reasoning across the grades
    Joanne Rossi Becker
    F. D. Rivera
    ZDM, 2008, 40 (1): : 1 - 1
  • [7] Extension Properties and Subdirect Representation in Abstract Algebraic Logic
    Lavicka, Tomas
    Noguera, Carles
    STUDIA LOGICA, 2018, 106 (06) : 1065 - 1095
  • [8] Extension Properties and Subdirect Representation in Abstract Algebraic Logic
    Tomáš Lávička
    Carles Noguera
    Studia Logica, 2018, 106 : 1065 - 1095
  • [9] Categorical abstract algebraic logic: Subdirect representation of pofunctors
    Voutsadakis, George
    COMMUNICATIONS IN ALGEBRA, 2007, 35 (01) : 271 - 280
  • [10] Hierarchical Transformer Encoder With Structured Representation for Abstract Reasoning
    An, Jinwon
    Cho, Sungzoon
    IEEE ACCESS, 2020, 8 : 200229 - 200236