claim
active
claim:if-a-looped-model-with-cyclic-recurrence-reaches-a-fixed-point-either-each-block-s-contribution-vanishes-asymptotically-or-the-sequential-application-traces-a-constant-cyclic-trajectory-in-latent-spaceIf a looped model with cyclic recurrence reaches a fixed point, either each block's contribution vanishes asymptotically or the sequential application traces a constant cyclic trajectory in latent space
Theoretical framing that establishes cyclic fixed points as the meaningful limiting behavior
Source paper
extracted_from(2026) · Hugh Blayney · Álvaro Arroyo · Johan Obando-Ceron · Pablo Samuel Castro +3
Neighborhood — ranked by edge-count
Papers (1)
paper
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Caption of Figure 1 summarizing the central empirical finding of the paper
- Formal proposition establishing that fixed-point convergence implies cyclic fixed points for all block permutations
- Core mechanistic claim linking fixed point theory to observable inference stage behavior
- Strong claim that inference stage structure is architectural rather than learned
- Practical design implication of the paper's mechanistic findings
- Suggests cyclic behavior is emergent from transformer architecture itself, not learned during training
- The key theoretical contribution: each layer in a cyclic recurrence converges to a distinct fixed point, tracing a consistent trajectory in latent space
- Central empirical claim of the paper supported by ColSum concentration analysis across multiple architectures