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.
arXiv:2604. 26157v4 Announce Type: replace-cross Abstract: Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations.
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.
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:2606. 00230v1 Announce Type: new Abstract: Grokking, the phenomenon in which neural networks generalize long after fitting their training data, has been studied in supervised settings on many epochs.
arXiv:2607. 18961v1 Announce Type: new Abstract: Large language models (LLMs) generate fluent text by incrementally predicting the next token from a prefix.
arXiv:2608.29118v1 Announce Type: new Abstract: Fine-tuning large language models (LLMs) on narrowly harmful datasets can lead to misalignment broadly, a phenomenon known as emergent misalignment (EM...
arXiv:2606.05087v2 Announce Type: replace Abstract: Frequent verbs such as 'have' and 'make' can function either as collocates in light-verb constructions or as full lexical predicates, as in 'make a...
arXiv:2607. 05679v1 Announce Type: cross Abstract: Language models (LMs) exhibit problematic biases, such as stereotypes.
arXiv:2608.28980v1 Announce Type: cross Abstract: Can the specialized architectures that machine learning has traditionally built for structured data be replaced by language-based models? This questi...
The study examines how the geometric placement of synthetic data affects discourse-pragmatic function classification. Using 410 annotated instances of the word "look" and synthetic examples generated by Llama 3.1, the authors partitioned the synthetic data by cosine distance in RoBERTa space and compared six training conditions. While all augmentation conditions improved macro‑F and accuracy over a real‑only baseline, the nearest synthetic examples (NEAR) yielded the largest macro‑F gain (0.113) and a distance‑balanced mix achieved the highest accuracy (0.748), though none improved AUC.
arXiv:2608.23476v1 Announce Type: new Abstract: Narrow fine-tuning on small, domain-specific datasets can produce broad and surprising changes in model behavior-a phenomenon called weird generalizati...
The study examines how the geometric placement of synthetic data affects discourse‑pragmatic function classification. Using 410 annotated instances of the word "look" from the British National Corpus, synthetic examples were generated with Llama 3.1 and grouped by cosine distance from real data in RoBERTa space. Six training conditions were compared, showing that examples close to real data (NEAR) yield the largest macro‑F gain, while a distance‑balanced mix gives the highest accuracy, yet none improve AUC.