Papers › FNet: Mixing Tokens with Fourier Transforms

FNet: Mixing Tokens with Fourier Transforms

9 May 2021NAACL 2022 7arXiv:2105.03824archive 2025-07-28

James Lee-Thorp, Joshua Ainslie, Ilya Eckstein, Santiago Ontanon

We show that Transformer encoder architectures can be sped up, with limited accuracy costs, by replacing the self-attention sublayers with simple linear transformations that "mix" input tokens. These linear mixers, along with standard nonlinearities in feed-forward layers, prove competent at modeling semantic relationships in several text classification tasks. Most surprisingly, we find that replacing the self-attention sublayer in a Transformer encoder with a standard, unparameterized Fourier Transform achieves 92-97% of the accuracy of BERT counterparts on the GLUE benchmark, but trains 80% faster on GPUs and 70% faster on TPUs at standard 512 input lengths. At longer input lengths, our FNet model is significantly faster: when compared to the "efficient" Transformers on the Long Range Arena benchmark, FNet matches the accuracy of the most accurate models, while outpacing the fastest models across all sequence lengths on GPUs (and across relatively shorter lengths on TPUs). Finally, FNet has a light memory footprint and is particularly efficient at smaller model sizes; for a fixed speed and accuracy budget, small FNet models outperform Transformer counterparts.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2105.03824")

Code

Syntology Ran 2 of 2 code samples harvested from 2 repositories linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong.

By repository: community (archive-listed): 2 samples from 2 repositories, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

google-research/google-research officialmentioned in papertf report
amoramine/FNet_classification mentioned on GitHubpytorch report
amoramine/FNet_with_BART_classification mentioned on GitHubpytorch report
erksch/fnet-pytorch mentioned on GitHubjaxMIT report
facebookresearch/xformers mentioned on GitHubpytorch report
jaketae/fnet mentioned on GitHubpytorch report
vineet54/fnet-google-pytorch mentioned on GitHubpytorchMIT 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

2 samples harvested; 2 ran; 1 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong

Licence: 1 of the 2 samples is 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

evaluate amoramine/FNet_with_BART_classification/fnet.py community (archive-listed) ran · honoured contract no licence file found · pointer only · c92b7a737063ef80 · report
fourier_transform jaketae/fnet/fnet/core.py community (archive-listed) ran · our draft was wrong fingerprinted MIT (permissive) · 8b5fcaaabe030716 · report

Tasks

Linguistic AcceptabilityMachine TranslationNatural Language InferenceParaphrase IdentificationSemantic Textual SimilaritySentiment AnalysisText ClassificationTransfer Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Linguistic Acceptability CoLA FNet-Large Accuracy 78% #9 of 43 Archive leaderboard report
Natural Language Inference MultiNLI BERT-Large Matched 88 #17 of 67 Archive leaderboard report
Natural Language Inference MultiNLI BERT-Large Mismatched 88 #17 of 67 Archive leaderboard report
Natural Language Inference MultiNLI FNet-Large Matched 78 #46 of 67 Archive leaderboard report
Natural Language Inference MultiNLI FNet-Large Mismatched 76 #46 of 67 Archive leaderboard report
Natural Language Inference QNLI FNet-Large Accuracy 85% #40 of 43 Archive leaderboard report
Natural Language Inference RTE FNet-Large Accuracy 69% #57 of 90 Archive leaderboard report
Paraphrase Identification Quora Question Pairs FNet-Large F1 85 #5 of 31 Archive leaderboard report
Semantic Textual Similarity MRPC FNet-Large Accuracy 88% #23 of 45 Archive leaderboard report
Semantic Textual Similarity STS Benchmark FNet-Large Spearman Correlation 0.84 #50 of 66 Archive leaderboard report
Sentiment Analysis SST-2 Binary classification FNet-Large Accuracy 94 #38 of 87 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Absolute Position EncodingsAdamAttentionAttention DropoutBERTBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerLinear Warmup With Linear DecayMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformerWeight DecayWordPiece

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