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

The CoTFormer architecture proposes formalizing Chain-of-Thought reasoning as recurrent latent computation, aiming to improve out-of-distribution generalization on inductive tasks while maintaining intermediate states for attention mechanisms. This research directly addresses core challenges in machine learning model efficiency and interpretability by integrating explicit reasoning traces into transformer structures. The study evaluates these structural variants against standard perplexity metrics within controlled algorithmic settings to validate their theoretical benefits.
Surse care acoperăarXiv, Latent Space
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Reproducing Recurrent Transformers: The CoTFormer

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

arXiv:2607.19405v1 Announce Type: new Abstract: The CoTFormer architecture formalizes Chain-of-Thought as a form of recurrent latent computation, preserving intermediate states as attendable representations to mimic explicit reasoning traces. In this work, we evaluate CoTFormer and its structural variants across perplexity and compute efficiency metrics. Furthermore, we extend evaluation to controlled algorithmic settings to determine whether this recurrent framework improves out-of-distribution generalisation on inductive reasoning tasks.

Abstract:The CoTFormer architecture formalizes Chain-of-Thought as a form of recurrent latent computation, preserving intermediate states as attendable representations to mimic explicit reasoning traces. In this work, we evaluate CoTFormer and its structural variants across perplexity and compute efficiency metrics. Furthermore, we extend evaluation to controlled algorithmic settings to determine whether this recurrent framework improves out-of-distribution generalisation on inductive reasoning tasks.

Machine Learning (cs.LG)

arXiv:2607.19405 [cs.LG]

(or arXiv:2607.19405v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2607.19405 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 · 154 cuvinte

Subiecte conexe