IAAISCORE
SCORE: Replacing Layer Stacking with Contractive Recurrent Depth
Replaces layer stacking with a single shared block applied iteratively through a contractive, ODE-inspired update h ← (1 − dt) · h + dt · F(h), using fixed discrete steps and ordinary backpropagation.
Inside the method
[ Single block ] × T: h ← (1 − dt) h + dt F(h)
Simplified conceptual schematic. Consult the paper for the complete architecture.
- Recurrence family
- Full-stack recurrence
- Depth control
- Fixed number of discrete iterations
- KV / state strategy
- See paper
Reading note
Evaluated on graph networks, MLPs and nanoGPT; generally speeds convergence and reduces parameters through sharing. Simple Euler steps give the best cost-performance trade-off.
Sources checked 2026-10-28. This catalog does not imply independent reproduction.
Related works
Cite this work
@misc{score2026,
title = {SCORE: Replacing Layer Stacking with Contractive Recurrent Depth},
author = {Guillaume Godin},
year = {2026},
eprint = {2603.10544},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2603.10544}
}