Pith. sign in

REVIEW 1 cited by

Benign Overfitting in Token Selection of Attention Mechanism

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 2409.17625 v3 pith:YISOJUW6 submitted 2024-09-26 cs.LG

classification cs.LG
keywords attentionmechanismgeneralizationoverfittingbenignlabelnoiseselection
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Attention mechanism is a fundamental component of the transformer model and plays a significant role in its success. However, the theoretical understanding of how attention learns to select tokens is still an emerging area of research. In this work, we study the training dynamics and generalization ability of the attention mechanism under classification problems with label noise. We show that, with the characterization of signal-to-noise ratio (SNR), the token selection of attention mechanism achieves benign overfitting, i.e., maintaining high generalization performance despite fitting label noise. Our work also demonstrates an interesting delayed acquisition of generalization after an initial phase of overfitting. Finally, we provide experiments to support our theoretical analysis using both synthetic and real-world datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How Transformers Learn Regular Language Recognition: A Theoretical Study on Training Dynamics and Implicit Bias

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A one-layer transformer trained on even pairs provably passes through a fast attention-growth phase into a slow max-margin phase, and with chain-of-thought the same model can solve parity checking.

Pith tools