Understanding In-context Learning of Addition via Activation Subspaces
Xinyan Hu, Kayo Yin, Michael I. Jordan, Jacob Steinhardt, Lijie Chen
TL;DR
The paper tackles how in-context learning emerges in forward passes of large transformers by studying an arithmetic add-$k$ task. It introduces activation patching and a sparse-head optimization to localize ICL to a few heads, revealing a six-dimensional aggregator subspace per head that encodes unit-digit and magnitude information via periodic patterns, with a parity direction, and a self-correction mechanism across demonstrations. The key contributions include a novel optimization method identifying 33 significant heads (reduced to three critical heads in practice), a PCA-based subspace localization, a decomposition into interpretable periodic feature directions, and a causal link between extractor and aggregator subspaces that explains how signals flow across tokens. The findings illuminate how fine-grained, low-dimensional activation subspaces support ICL in large models, offering a principled lens for analyzing and potentially engineering ICL mechanisms in future systems.
Abstract
To perform few-shot learning, language models extract signals from a few input-label pairs, aggregate these into a learned prediction rule, and apply this rule to new inputs. How is this implemented in the forward pass of modern transformer models? To explore this question, we study a structured family of few-shot learning tasks for which the true prediction rule is to add an integer $k$ to the input. We introduce a novel optimization method that localizes the model's few-shot ability to only a few attention heads. We then perform an in-depth analysis of individual heads, via dimensionality reduction and decomposition. As an example, on Llama-3-8B-instruct, we reduce its mechanism on our tasks to just three attention heads with six-dimensional subspaces, where four dimensions track the unit digit with trigonometric functions at periods $2$, $5$, and $10$, and two dimensions track magnitude with low-frequency components. To deepen our understanding of the mechanism, we also derive a mathematical identity relating ``aggregation'' and ``extraction'' subspaces for attention heads, allowing us to track the flow of information from individual examples to a final aggregated concept. Using this, we identify a self-correction mechanism where mistakes learned from earlier demonstrations are suppressed by later demonstrations. Our results demonstrate how tracking low-dimensional subspaces of localized heads across a forward pass can provide insight into fine-grained computational structures in language models.
