Attention-based Iterative Decomposition for Tensor Product Representation
Not on the map. Why?
Abstract (arXiv)
In recent research, Tensor Product Representation (TPR) is applied for the systematic generalization task of deep neural networks by learning the compositional structure of data. However, such prior works show limited performance in discovering and representing the symbolic structure from unseen test data because their decomposition to the structural representations was incomplete. In this work, we propose an Attention-based Iterative Decomposition (AID) module designed to enhance the decomposition operations for the structured representations encoded from the sequential input data with TPR. Our AID can be easily adapted to any TPR-based model and provides enhanced systematic decomposition through a competitive attention mechanism between input features and structured representations. In our experiments, AID shows effectiveness by significantly improving the performance of TPR-based prior works on the series of systematic generalization tasks. Moreover, in the quantitative and qualitative evaluations, AID produces more compositional and well-bound structural representations than other works.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 36 of its 51 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
36 of 51 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Layer Normalizationcited by 5,579
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
- 2020Object-Centric Learning with Slot Attentioncited by 865
- 2014Neural Turing Machinescited by 630
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
- 2017A simple neural network module for relational reasoningcited by 345
- 2015Towards AI-Complete Question Answering: A Set of Prerequisite Toy Taskscited by 309
24 more
- 2020Inductive Biases for Deep Learning of Higher-Level Cognitioncited by 273
- 2019Compositionality decomposed: how do neural networks generalise?cited by 264
- 2020On the Binding Problem in Artificial Neural Networkscited by 230
- 2019Recurrent Independent Mechanismscited by 219
- 2016Using Fast Weights to Attend to the Recent Pastcited by 161
- 2018Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNNcited by 142
- 2021Going Beyond Linear Transformers with Recurrent Fast Weight Programmerscited by 84
- 2022StepGame: A New Benchmark for Robust Multi-Hop Spatial Reasoning in Textscited by 65
- 2021The Neural Data Router: Adaptive Control Flow in Transformers Improves Systematic Generalizationcited by 62
- 2016Tracking the World State with Recurrent Entity Networkscited by 51
- 2020Learning Associative Inference Using Fast Weight Memorycited by 51
- 2023An Investigation into Pre-Training Object-Centric Representations for Reinforcement Learningcited by 49
- 2020Emergent Symbols through Binding in External Memorycited by 47
- 2019Metalearned Neural Memorycited by 44
- 2018Memorize or generalize? Searching for a compositional RNN in a haystackcited by 41
- 2022Neural Systematic Bindercited by 37
- 2021Fast and Slow Learning of Recurrent Independent Mechanismscited by 36
- 2019Enhancing the Transformer with Explicit Relational Encoding for Math Problem Solvingcited by 34
- 2020Self-Attentive Associative Memorycited by 33
- 2018Learning to Reason with Third-Order Tensor Productscited by 27
- 2021Compositional Attention: Disentangling Search and Retrievalcited by 12
- 2021Enriching Transformers with Structured Tensor-Product Representations for Abstractive Summarizationcited by 11
- 2020Distributed Associative Memory Network with Memory Refreshing Losscited by 4
- 2021The Structure of Systematicity in the Braincited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.