Methods › General › Feedforward Networks › Switch FFN

Switch FFN

20 papers tagged archive 2025-07-28

Introduced by William Fedus et al. in Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

A Switch FFN is a sparse layer that operates independently on tokens within an input sequence. It is shown in the blue block in the figure. We diagram two tokens (x₁ = “More” and x₂ = “Parameters” below) being routed (solid lines) across four FFN experts, where the router independently routes each token. The switch FFN layer returns the output of the selected FFN multiplied by the router gate value (dotted-line).

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: NC-FFN; W-Switch; T-Switch; Switch-KD; FB π-Switch; FFN-SkipLLM; Auto-Switch; TACIT-SWITCH.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 20 · with a code link: 6 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 20 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 20 of 20, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 30 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Mixture-of-Experts13
Language Modelling4
GPU3
Language Modeling3
Machine Translation3
Question Answering3
Text Generation2
Translation2
All1
Avg1
CPU1
Common Sense Reasoning1
Data Augmentation1
In-Context Learning1
Large Language Model1
Model Compression1
Neural Architecture Search1
Object Detection1
RAG1
Reinforcement Learning (RL)1

Usage over time archive 2025-07-28

Papers per year tagged with Switch FFN: 2021 to 2025, peak 7 7 0 2021: 5 papers 2021 2022: 7 papers 2022 2023: 5 papers 2023 2024: 0 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (20 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Feedforward Networks

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