Methods › General › Feedforward Networks › Boom Layer

Boom Layer

2 papers tagged archive 2025-07-28

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

A Boom Layer is a type of feedforward layer that is closely related to the feedforward layers used in Transformers. The layer takes a vector of the form v ∈ℝᴴ and uses a matrix multiplication with a GeLU activation to produce a vector u ∈ℝ^(N×H). We then break u into N vectors and sum those together, producing w ∈ℝᴴ. This minimizes computation and removes an entire matrix of parameters compared to traditional down-projection layers.

The Figure to the right shows the Boom Layer used in the context of SHA-RNN from the original paper.

Source: Single Headed Attention RNN: Stop Thinking With Your HeadSee Code · Smerity/sha-rnn

In Syntology for a different name, 'BOOM': repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: listed only). The lookup matched a different name in Syntology's graph, 'BOOM' (resolution: token_match); this answer is about that name. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2511.00423) is about this method is not checked.

Origin paper of this answer, arXiv:2511.00423 (its page on this site · its page on Syntology): in Syntology's graph layer with no harvested code sample.

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: 2 · with a code link: 1 · where Syntology ran a sample: 0 (0 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: none of the 2 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 2 of 2, 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

4 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
GPU1
Hyperparameter Optimization1
Language Modeling1
Language Modelling1

Usage over time archive 2025-07-28

Papers per year tagged with Boom Layer: 2019 to 2021, peak 1 1 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021
Papers per year the archive tags with this method, by the paper's archive date (2 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