Papers › Forgetting Transformer: Softmax Attention with a Forget Gate

Forgetting Transformer: Softmax Attention with a Forget Gate

3 Mar 2025arXiv:2503.02130archive 2025-07-28

Zhixuan Lin, Evgenii Nikishin, Xu Owen He, Aaron Courville

An essential component of modern recurrent sequence models is the forget gate. While Transformers do not have an explicit recurrent form, we show that a forget gate can be naturally incorporated into Transformers by down-weighting the unnormalized attention scores in a data-dependent way. We name this attention mechanism Forgetting Attention and the resulting model the Forgetting Transformer (FoX). We show that FoX outperforms the Transformer on long-context language modeling, length extrapolation, and short-context downstream tasks, while performing on par with the Transformer on long-context downstream tasks. Moreover, it is compatible with the FlashAttention algorithm and does not require any positional embeddings. Several analyses, including the needle-in-the-haystack test, show that FoX also retains the Transformer's superior long-context capabilities over recurrent sequence models such as Mamba-2, HGRN2, and DeltaNet. We also introduce a "Pro" block design that incorporates some common architectural components in recurrent sequence models and find it significantly improves the performance of both FoX and the Transformer. Our code is available at https://github.com/zhixuan-lin/forgetting-transformer.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Syntology holds a reference implementation of Pro block design, generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Pro block design') (how to connect); the free check have('2503.02130') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 13 samples from 1 repository, 11 ran (9 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 11 samples that ran has no recorded date.

zhixuan-lin/forgetting-transformer officialmentioned in paperpytorchMITSyntology: 13 samples, 11 ran (2 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · our draft was wrong
9ran
2unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from zhixuan-lin/forgetting-transformer. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

zhixuan-lin/forgetting-transformer official repository 13 samples, 11 ran (2 instrument-failed) · 2 unverified
constant_schedule src/forgetting_transformer/schedule/schedule.py ran MIT (permissive) · f4bcdc1cf181abd3 · report fixture: signature value:float/0/float · returned function · level recorded 2026-09-24
convert_to_scalar in 24 papers src/forgetting_transformer/logger.py ran MIT (permissive) · df304bdd056129a1 · report fixture: signature metrics:dict/0/? · returned dict · level recorded 2026-09-24
elu_p1 in 11 papers
census: 3 implementations from 6 papers, 1 distinct output on one shared input this sample: bucket 1 of 1, arg 1: rank 2, kind float, dtype float32
src/forgetting_transformer/model/delta_net/delta_net_layer.py ran · our draft was wrong fingerprinted MIT (permissive) · bc4bddefd7540078 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-22
is_power_of_two in 15 papers src/forgetting_transformer/utils.py ran fingerprinted MIT (permissive) · 5c43f7270b7b5ef0 · report fixture: signature n:int/0/int · returned bool · level recorded 2026-09-25
is_valid_filename src/forgetting_transformer/logger.py ran MIT (permissive) · f474d27c0cab10e5 · report fixture: signature filename:str/0/str · returned bool · level recorded 2026-09-24
join_schedules src/forgetting_transformer/schedule/schedule.py ran MIT (permissive) · 07f244414412b732 · report fixture: signature schedules:list/1/callable, boundaries:list/1/int · returned function · level recorded 2026-09-24
maybe_contiguous in 8 papers src/forgetting_transformer/ops/forgetting_attention.py ran fingerprinted MIT (permissive) · 58e6542897e7d424 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-25
one_minus_sqrt_schedule src/forgetting_transformer/schedule/schedule.py ran MIT (permissive) · 46cd56c1ad913051 · report fixture: signature init_value:float/0/float, end_value:float/0/float, transition_steps:int/0/int, transition_begin:int/0/int · returned function · level recorded 2026-09-24
rounded_multiple src/forgetting_transformer/ops/forgetting_attention.py ran fingerprinted MIT (permissive) · d0340dda6fca386f · report fixture: signature a:int/0/int, b:int/0/int · returned int · level recorded 2026-09-24
safe_divide in 19 papers
census: 3 implementations from 5 papers, 2 distinct outputs on one shared input
src/forgetting_transformer/utils.py ran MIT (permissive) · e9970b6ad2c69c84 · report fixture: signature a:int/0/int, b:int/0/int · returned int · level recorded 2026-09-25
sum_norm in 12 papers
census: 3 implementations from 6 papers, 2 distinct outputs on one shared input this sample: bucket 1 of 1, arg 1: rank 2, kind float, dtype float32
src/forgetting_transformer/model/delta_net/delta_net_layer.py ran · our draft was wrong fingerprinted MIT (permissive) · e544fdb6373b9f42 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded, date not recorded
convert_to_numpy in 8 papers src/forgetting_transformer/logger.py unverified MIT (permissive) · 47a1ac03e43d6cff · report
group_parameters in 9 papers src/forgetting_transformer/utils.py unverified MIT (permissive) · 5e23b22ed11c3731 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for Pro block design (graph method: Pro block design), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).

label matches by construction: the code was generated for this method (not judged by a model)

  1. forgetting_attention_backward_block entry · level 2 · ran · 11ff0a896c5f9fd2fa882f9e5a7a308fd6698a5fdca0d25f8c3713d0b51f0a40

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2503.02130") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Language ModelingLanguage ModellingMamba

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections