framework
active
framework:autoregressive-modelsAutoregressive models
Second model system studied; used to show why flat autoregressive LLMs struggle with long-range coherence.
Neighborhood — ranked by edge-count
Papers (1)
paper
Methods (1)
method
- Key analytical technique used across three model systems to determine constraints on long-range order.
Frameworks (3)
framework
- transformer architectureextendsNeural network architecture based on attention, commonly used in large language models
- Main framework: uses scaling of free energy under domain wall formation to determine whether local interactions can sustain ordered phases based on graph topology alone
- Windowed HamiltonianimplementsCore technical concept: a Hamiltonian where spin-spin interactions are defined only within finite windows ω, enabling generic analysis across diverse lattices
Findings (3)
finding
- Autoregressive model unable to converge to a single stored pattern for any finite β (Corollary 2)supportsConsequence of Theorem 3 and 1D no-order result
- Application to transformer language models
- Empirical observation explained by topological constraints: flat autoregressive architectures lack multiscale structure needed for long-range order.
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.
- Statistical technique where outputs are regressed on previous values; used in language generation
- Training objective interpretable as optimizing a diverse set of tasks; thus subject to multitask scaling convergence pressures
- The mechanism by which LLMs generate text: drawing a token from the next-token distribution and appending it to context repeatedly
- LLMs generating text by feeding output back through context window; debated whether this constitutes algorithmic recurrence for RPT-1
- Baseline persistence of any probe direction arising from the autoregressive nature of LLMs, not specific to emotion content
- Transformers are recurrent through autoregression because the K/V stream provides horizontal information flow across positions, even though each forward pass is feedforward.
- The training parallelization technique that latent methods are difficult to train with.