Artem Kirsanov, Chi-Ning Chou, Kyunghyun Cho and SueYeon Chung (2025), Findings of the Association for Computational Linguistics: NAACL 2025.
Key takeaways
From the reading, NOTE-789.
- Same accuracy, different mechanisms. In base Llama-3.1-8B (and Gemma-2-2B), an instruction beats up to five demonstrations and more examples overtake it; a trained soft prompt beats both.
- Demonstrations reshape the input. They raise the separability of the input sentence’s representation at early-to-middle layers; an instruction does not. Gold, letter and shuffled labels make little difference: the examples’ sentences do the work.
- An instruction acts on the last token, raising separability from about layer 8 on, less than demonstrations do.
- Failures sit at the readout. At five demonstrations accuracy varies from below 0.1 to about 0.6 across draws of examples while separability barely moves; consistently swapped labels fail with separability intact.
- Cross-task effects. Demonstrations for one labelling of the same sentences help other labellings early and hurt them late; soft prompts hurt them more.
- The limit. Base models only, one instruction wording, mostly synthetic data, and a readout explanation inferred, not measured.
Standing in the record
Filed 2026-10-12 for QUESTION-024 and read 2026-10-14 in NOTE-789. Its
readout finding is held as THEORY-251, and its demonstrations-against-
instruction finding supports THEORY-264 with LIT-942. It was
registered as counting “against a single frame induced from examples”; it
does not test that, since it holds the instruction’s wording fixed and
varies the prompt form. It points the same way as LIT-942, not the opposite
way as the triage of 2026-10-14 had it. Its suggestions for prompt design
belong to the anthology; the anthology-candidate flag stands.