Induction heads implement smoothed n-gram estimators
Finite softmax attention interpolates exact and partial context matches, while beginning-of-sequence tokens induce additive pseudo-count smoothing.
2026-05-30
Induction heads are commonly interpreted as implementing exact n-gram counting through match-and-copy operations. We show that finite softmax attention instead induces a data-dependent interpolation between exact and partial context matches. We also identify a complementary mechanism in which beginning-of-sequence tokens implement additive pseudo-count smoothing. Together, these results connect mechanistic descriptions of transformer circuits to classical statistical estimators.
Finite softmax attention interpolates exact and partial context matches, while beginning-of-sequence tokens induce additive pseudo-count smoothing.
For label-symmetric Markov tasks and symmetric initialization, gradient flow keeps the disentangled Transformer in the permutation-fixed parameter subspace, so its predictor depends on token-equality patterns rather than token identities.
2026 · ICML
2021 · ICCV