Sign inGet started
Paper · arXiv

First Passage Attention

Augmenting softmax attention with forget gates typically relies on summing decay contributions along the key--query path. Because such accumulation is monotonic, these mechanisms cannot selectively erase intermediate context while preserving older, structurally relevant tokens. We propose First Passage Attention (FPA), which shifts from path summation to path extrema by lowering a key's logit proportionally to the deepest dip of a learned scalar field below that key's level over the intervening span. FPA encompasses the Forgetting Transformer (FoX) as a special case, and when the field and levels follow a shared learned walk, the alive keys with unpenalised logits naturally form a stack. ...

AuthorsYuxuan Liu
Primary categorycs.CL
Published15 October 2026
Last updated at source15 October 2026
cs.CLcs.AIcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/45c83638-c546-4118-b3ab-5cdc269c0365" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 6 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Recent changes

  • 22 Oct 2026 Topics added cs.AI, cs.LG

Changes detected by Silytics between refreshes of the source.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 24 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.