Skip to content

TPR-Attention for Combinatorial Generalization

Aug 2026 · 0 citations · 11 references
Computer Science

TL;DR

This work introduces a new architectural component that embeds structured inductive bias into deep learning: an attention mechanism operating over tensor-product representations (TPRs) that outperforms existing architectural components in combinatorial generalization.

Abstract

Systematic generalization remains a significant challenge in deep learning. In particular, combinatorial generalization - generalizing to new configurations of known factors of variation - is effortless for humans but difficult for standard neural architectures that rely on statistical correlations rather than explicit structural representations. We introduce a new architectural component that embeds structured inductive bias into deep learning: an attention mechanism operating over tensor-product representations (TPRs). Through controlled experiments on compositional tasks, we show that this TPR-attention mechanism outperforms existing architectural components in combinatorial generalization. These results highlight the value of integrating explicit compositional structure into neural attention and point toward a promising path for models capable of systematic generalization.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Retrieval-Centric Deep Learning in Growing Nonparametric Neural Networks

We investigate a general-purpose layer for deep learning that, instead of compressing arbitrary-size training data into fixed-size weight matrices, stores a new pair of key-value representations for every data point during training, and retrieves and recombines these representations through an attention mechanism at in...

Maximilian Schlegel, Rajai Nasser, Seijin Kobayashi et al. · 0 citations
#machine learning Preprint Oct 2026

MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization

Constructive neural combinatorial optimization (NCO) has emerged as a promising paradigm that learns to construct solutions to combinatorial optimization problems (COPs) step by step, which reduces reliance on handcrafted rules and enables fast inference. While many methods with dynamic embeddings generalize well, they...

Chang-Liang Zhou, Yuan-Yao Chen, Rong-Sheng Chen et al. · 0 citations
Review Open access Sep 2026

Quantifying the Knowledge in Deep Neural Networks: An Overview

Deep Neural Networks (DNNs) have proven to be extremely effective at learning a wide range of tasks. Due to their complexity and inexplicable internal state, DNNs are difficult to analyze. Several attempts to interpret their operation have been made, but analyzing them from the perspective of the knowledge encoded in t...

Ioanna Valsamara, Ioannis Mademlis, Ioannis Pitas · 0 citations
#artificial intelligence Preprint Sep 2026

Relative Generalization Invariance of LLM Pretraining

This work introduces Relative Generalization Invariance (RGI), the invariance of the validation-loss difference between any two tokens across models, and shows that RGI approximately holds across a wide range of optimizers and moderate architectural variations, suggesting that these choices induce an approximately unif...

Feng-Zhuo Zhang, Shu-Che Wang, Sheng-Gui Li et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.