Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This research proposes a novel framework using category theory to evaluate compositional generalization in language models, shifting focus from predictive accuracy to identifying the structural and lexical conditions that make examples admissible. By representing sentences as functors and utilizing Kan extensions, the study diagnoses which training corpora license specific generalizations without requiring the training of a new predictive model. This approach offers a rigorous mathematical lens for understanding the fundamental limits of how AI systems generalize from observed data structures.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Compositional Generalization via Structural Identification in a Category-Theoretic Framework

arXiv1 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2608.26465v1 Announce Type: new Abstract: Compositional generalization is usually evaluated through model accuracy. We instead ask which structural or lexical identifications make held-out COGS examples admissible from the structures observed in training. Sentences are represented 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 separate unsupported structural templates. These data-side diagnoses characterize what the training corpus licenses under specified identifications, without training a predictive model.

Abstract:Compositional generalization is usually evaluated through model accuracy. We instead ask which structural or lexical identifications make held-out COGS examples admissible from the structures observed in training. Sentences are represented 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 separate unsupported structural templates. These data-side diagnoses characterize what the training corpus licenses under specified identifications, without training a predictive model.

Computation and Language (cs.CL); Machine Learning (stat.ML)

arXiv:2608.26465 [cs.CL]

(or arXiv:2608.26465v1 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2608.26465 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 180 cuvinte

Subiecte conexe