Pith. sign in

REVIEW 2 cited by

How Transformers Get Rich: Approximation and Dynamics Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.11474 v3 pith:JHKZH72T submitted 2024-10-15 cs.LG math.OCstat.ML

classification cs.LGmath.OCstat.ML
keywords dynamicsgraminductiontransformersanalysisapproximationheadin-context
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Transformers have demonstrated exceptional in-context learning capabilities, yet the theoretical understanding of the underlying mechanisms remains limited. A recent work (Elhage et al., 2021) identified a ``rich'' in-context mechanism known as induction head, contrasting with ``lazy'' $n$-gram models that overlook long-range dependencies. In this work, we provide both approximation and dynamics analyses of how transformers implement induction heads. In the {\em approximation} analysis, we formalize both standard and generalized induction head mechanisms, and examine how transformers can efficiently implement them, with an emphasis on the distinct role of each transformer submodule. For the {\em dynamics} analysis, we study the training dynamics on a synthetic mixed target, composed of a 4-gram and an in-context 2-gram component. This controlled setting allows us to precisely characterize the entire training process and uncover an {\em abrupt transition} from lazy (4-gram) to rich (induction head) mechanisms as training progresses.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Provable Low-Frequency Bias of In-Context Learning of Representations

    cs.LG 2025-07 conditional novelty 7.0 of 10

    In-context learning biases hidden representations toward low-frequency eigenvectors of a reweighted graph Laplacian, a phenomenon the authors prove and test.

  2. Frontier Language Models Struggle to Copy: Text Can Be Better Viewed in 2D

    cs.CL 2026-07 conditional novelty 6.0 of 10

    2D-RoPE, which arranges text by line breaks into rows and columns, lets Transformers copy strings hundreds of times longer than training lengths, while standard 1D positional encodings fail on the same task.

Pith tools