arXiv Computation and Language By Akihiro Maeda, Thomas Seiller, Yohei Oseki

Compositional Generalization via Structural Identification in a Category-Theoretic Framework

Read the original on arXiv Computation and Language →

The paper proposes a new way to evaluate compositional generalization by examining which structural or lexical identifications allow held‑out COGS examples to be considered admissible based on training data. Sentences are modeled as functors from syntactic addresses to lexical tokens, and selective collapses induce Kan extensions that propagate observed associations. Across 21 COGS generalization types, admissibility follows distinct identification profiles, while residual failures highlight unsupported structural templates, providing data‑side diagnoses of what the training corpus licenses without training a predictive model.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Sep 14

Type Diversity Enables Transformers to Generalise Compositionally

The paper investigates why Transformers struggle more with structural than lexical compositional generalisation. It argues that this disparity stems from low structural type diversity rather than an inherent limitation of Transformers. By creating linguistically diverse variants of the COGS and SLOG datasets, the authors show that type diversity correlates equally with generalisation in both lexical and structural cases, challenging previous explanations of the difficulty.

By Anssi Moisio, Mathias Creutz, Mikko Kurimo
Hugging Face Trending Papers
Jul 22

Exposure is Optional: Learning Unlike Coordination in Language Models

Coordination, a fundamental linguistic structure, remains a subject of intense debate, and its exact nature continues to elude theoretical linguistics. A common view holds that only same-category constituents can be conjoined, which has been challenged by the many grammatical unlike coordinations found in natural language.

arXiv Computation and Language
Sep 25

Parts-of-Speech as Emergent Categories in SAE Latent Space

The study investigates how part‑of‑speech (PoS) categories are represented in the latent space of Sparse AutoEncoders (SAEs) applied to language models. Results show that PoS distinctions can be reliably recovered from SAE activations, but the mapping is not one‑to‑one; instead, PoS categories are supported by compact, distributed groups of sparse latents that vary across tags and remain stable on held‑out data. The findings suggest that SAEs encode morpho‑syntactic information in a distributed, category‑dependent manner rather than through isolated grammatical features.

By Alessandro Bondielli, Lucia Passaro, Serena Auriemma, Alessandro Lenci
arXiv Computer Vision
Oct 2

Reachability Is Not Generalization: Understanding Verb--Noun Decomposition in Assembly Action Recognition

The paper investigates how verb–noun decomposition, a common strategy for recognizing assembly actions, generalizes to novel combinations of familiar components. Through a systematic study on three datasets (MECCANO, HAViD, and IMPACT), the authors find that while decomposition avoids the zero‑probability ceiling of atomic classifiers, its performance still heavily depends on the co‑occurrence patterns seen during training. The analysis reveals that errors concentrate on the larger‑vocabulary component, that shared‑encoder training can entangle components and worsen generalization, and that these issues stem from primitive support, vocabulary asymmetry, and component entanglement.

By Changyi Li, Yu Xiao