analiza aiqbench
This research introduces FPRM, a Transformer-based model that stabilizes deep looped architectures by using fixed-point convergence as a dynamic halting mechanism. By addressing signal propagation issues through pre-norm layers and residual scaling, the system adaptively allocates compute resources based on task difficulty while maintaining performance on complex reasoning benchmarks like ARC-AGI.
Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers
arXiv:2606.18206v1 Announce Type: new Abstract: Looped architectures provide an inductive bias toward learning step-by-step procedures for tasks that require compositional reasoning. The number of effective layers reached by looping determines the quality of the solution these models find. Like deep architectures, looped architectures are prone to a signal propagation problem induced by depth as the halting decision is postponed. In this paper, we address this signal propagation issue using pre-norm layers and residual scaling. Building on these architectural modifications, we propose FPRM, a Transformer-based Fixed-Point Reasoning Model that uses fixed-point convergence as an end-to-end halting mechanism in a looped architecture. We show that fixed-point halting allows FPRM to adapt its compute to task difficulty. FPRM is effective on common reasoning benchmarks, namely Sudoku, Maze, state-tracking, and ARC-AGI.
Abstract:Looped architectures provide an inductive bias toward learning step-by-step procedures for tasks that require compositional reasoning. The number of effective layers reached by looping determines the quality of the solution these models find. Like deep architectures, looped architectures are prone to a signal propagation problem induced by depth as the halting decision is postponed. In this paper, we address this signal propagation issue using pre-norm layers and residual scaling. Building on these architectural modifications, we propose FPRM, a Transformer-based Fixed-Point Reasoning Model that uses fixed-point convergence as an end-to-end halting mechanism in a looped architecture. We show that fixed-point halting allows FPRM to adapt its compute to task difficulty. FPRM is effective on common reasoning benchmarks, namely Sudoku, Maze, state-tracking, and ARC-AGI.
Artificial Intelligence (cs.AI)
arXiv:2606.18206 [cs.AI]
(or arXiv:2606.18206v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2606.18206 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 · 216 cuvinte
Subiecte conexe

[AINews] Muse Spark 1.3 matches GPT-5.6-Sol, confirming Meta Superintelligence as the newest Frontier Lab, >90% discount for training
Latent Space · 3 sept. 2026

Why do models task game?
AI Alignment Forum · 6 aug. 2026
Amazon is investing in the Lean Focused Research Organization
Amazon Science · 26 iul. 2026

34 Amazon Research Awards Build on Trainium recipients announced
Amazon Science · 5 aug. 2026