← Back to the collection
Core recurrence ·
Parcae
Parcae: Scaling Laws For Stable Looped Language Models
Uses stable state injection to examine the scaling of looped Transformers with recurrence and training data.
Inside the method
Prelude → [ Stable core ] × R → Coda
Simplified conceptual schematic. Consult the paper for the complete architecture.
- Recurrence family
- Core recurrence
- Depth control
- Variable recurrent depth
- KV / state strategy
- See implementation
Reading note
The repository provides entry points for 140M, 370M, 770M and 1.3B pretrained models. Availability is not a local reproduction result.
Sources checked 2026-09-15. This catalog does not imply independent reproduction.
Cite this work
@misc{parcae2026,
title = {Parcae: Scaling Laws For Stable Looped Language Models},
author = {Hayden Prairie and Zachary Novack and Taylor Berg-Kirkpatrick and Daniel Y. Fu},
year = {2026},
eprint = {2604.12946},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2604.12946}
}