Pith. sign in

REVIEW 2 cited by

Understanding In-Context Learning of Linear Models in Transformers Through an Adversarial Lens

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 2411.05189 v2 pith:4IOU7DUO submitted 2024-11-07 cs.LG cs.CR

classification cs.LGcs.CR
keywords transformersadversariallearningmodelsattacksalgorithmsin-contextlinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we make two contributions towards understanding of in-context learning of linear models by transformers. First, we investigate the adversarial robustness of in-context learning in transformers to hijacking attacks -- a type of adversarial attacks in which the adversary's goal is to manipulate the prompt to force the transformer to generate a specific output. We show that both linear transformers and transformers with GPT-2 architectures are vulnerable to such hijacking attacks. However, adversarial robustness to such attacks can be significantly improved through adversarial training -- done either at the pretraining or finetuning stage -- and can generalize to stronger attack models. Our second main contribution is a comparative analysis of adversarial vulnerabilities across transformer models and other algorithms for learning linear models. This reveals two novel findings. First, adversarial attacks transfer poorly between larger transformer models trained from different seeds despite achieving similar in-distribution performance. This suggests that transformers of the same architecture trained according to the same recipe may implement different in-context learning algorithms for the same task. Second, we observe that attacks do not transfer well between classical learning algorithms for linear models (single-step gradient descent and ordinary least squares) and transformers. This suggests that there could be qualitative differences between the in-context learning algorithms that transformers implement and these traditional algorithms.

Discussion (0). Continue with ORCID 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. Training Dynamics of In-Context Learning in Linear Attention

    cs.LG 2025-01 conditional novelty 7.0 of 10

    For in-context linear regression, merged key/query linear attention learns via one abrupt loss drop, while separate key/query attention learns via multiple drops, with each stage adding one principal component of the ...

  2. How Can Mamba Learn In Context with Outliers and Generalize Provably?

    cs.LG 2025-10 conditional novelty 6.0 of 10

    A simplified one-layer Mamba provably learns in-context binary classification tolerating outlier fractions approaching 1, whereas a linear Transformer can only tolerate α < 1/2.

Pith tools