Shen, Mishra and Khashabi (2023) — ARXIV-2310.08540, ICML 2024. Read as NOTE-276.
Key takeaways
- Two hypotheses, and only the weaker one was ever tested. Hypothesis 1: for any weights arising from self-supervised pretraining and any well-defined task, ICL is algorithmically equivalent to gradient descent. Hypothesis 2: for a given task, there exist transformer weights for which a simulated ICL is equivalent to gradient descent. Hypothesis 2 is a statement about architectural expressivity and is what the constructions establish.
- Theorem 1 is a one-line contradiction. If
Ais equivalent to ICL thenM_Θ0(σ_A ∘ x_t) − M_Θ0(σ_B ∘ x_t) = M_{Θ_σA}(x_t) − M_{Θ_σB}(x_t)for any two orderings of the demonstrations. Gradient descent averages over a batch, so its right-hand side is zero; ICL’s left-hand side is not. Measured on LLaMA-7B/AGNews over 10 orderings of 8 demonstrations, ICL’s output- distribution spread exceeds GD’s, SGD’s and Adam’s throughout training. - The hand-constructed weights do not look like real ones. Reproducing
ARXIV-2212.07677’s construction at LLaMA’s
N_x = N_y = 4096requires sparsity above 99.99% inW_KandW_Qand about 75% inW_V; measured sparsity in LLaMA at every threshold from 10⁻² to 10⁻⁶ is far lower.P = (η/N)Ialso diverges atN = 0. - ICL is a property of a family of weights, not a point. Across GPT-J checkpoints, ICL accuracy on AGNews is flat while parameters keep moving. Equivalence shown for one choice of parameters is not equivalence.
- The empirical comparison covers three metrics and finds a gap on all
three. LLaMA-7B on AGNews, CB, SST-2 and RTE,
N ∈ {1, 2, 4, 8}, four learning rates, 200 epochs, against whole-model GD and against sub-model GD onW_Vof a middle and a deep layer. ICL agrees with itself under a different demonstration order more than with any GD variant.
Standing in the anthology
Active, and it is the paper that makes this cluster filable as a
dispute rather than a finding. Its Hypothesis-1/Hypothesis-2 distinction is
reusable well beyond in-context learning: a proof that an architecture can
compute something, plus a model trained on the task to show it does, is
weaker evidence about pretrained models than it reads as.
The authors state the conclusion as “the equivalence remains an open hypothesis”, not as a refutation, and the record follows them on that.