arXiv Machine Learning
Sep 21

Recursive Language Models Generalize Out of Domain

The paper investigates how restricting a language model’s view to isolated subtask contexts—via recursive language models—affects learning compared to standard chain‑of‑thought (CoT) approaches. While CoT can simulate recursive reasoning and offers similar in‑distribution performance, it tends to exploit contextual shortcuts that fail out of distribution; recursive models avoid this by isolating context, thereby preventing such shortcuts. The study shows that merely covering the correct rule is insufficient for robust reasoning beyond the training distribution.

By Chenxiao Yang, Zhiyuan Li, David McAllester, Nathan Srebro
arXiv Computation and Language
Aug 28

Compositional Generalization via Structural Identification in a Category-Theoretic Framework

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.

By Akihiro Maeda, Thomas Seiller, Yohei Oseki
arXiv AI
Oct 16

RAG-RST: Retrieved Exemplars as In-Context Discourse Schema for RST Parsing

RAG‑RST is a retrieval‑augmented framework that supplies a formal discourse schema as in‑context demonstrations for Rhetorical Structure Theory parsing. By retrieving exemplar EDU pairs, it improves nuclearity F1 from 0.794 to 0.846 and relation F1 from 0.738 to 0.788 without any training. Two configurations—precomputed and dynamic—both outperform existing RST parsers, with the dynamic variant consistently strongest, and the approach shows that a formal linguistic schema can be provided to a foundation model as a demonstration rather than encoded in its parameters.

By Mohammadreza Sediqin, Shlomo Engelson Argamon
Hugging Face Trending Papers
Jun 25

Compositionality and the lexicon in evolutionary semantics

Formal semantics has shown that sentence meanings arise by recursively composing lexical meanings, yet much of the literature on semantic universals models either lexicons with fixed signal structures or holistic composition without interpretable lexical parts. We introduce a framework that integrates this fundamental insight of formal semantics in evolutionary modeling, by allowing lexical meanings and a composition function to co-evolve under pressures for conceptual simplicity and communicative accuracy.