Methods › General › Normalization › Filter Response Normalization

Filter Response Normalization

2 papers tagged archive 2025-07-28

Introduced by Saurabh Singh et al. in Filter Response Normalization Layer: Eliminating Batch Dependence in the Training of Deep Neural Networks

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

Filter Response Normalization (FRN) is a type of normalization that combines normalization and an activation function, which can be used as a replacement for other normalizations and activations. It operates on each activation channel of each batch element independently, eliminating the dependency on other batch elements.

To demonstrate, assume we are dealing with the feed-forward convolutional neural network. We follow the usual convention that the filter responses (activation maps) produced after a convolution operation are a 4D tensor X with shape [B, W, H, C], where B is the mini-batch size, W, H are the spatial extents of the map, and C is the number of filters used in convolution. C is also referred to as output channels. Let x = X_(b,:,:,c) ∈ℛᴺ, where N = W ×H, be the vector of filter responses for the cᵗʰ filter for the bᵗʰ batch point. Let ν² = ∑ᵢ xᵢ²/N, be the mean squared norm of x.

Then Filter Response Normalization is defined as the following:

x̂ = x/(√(ν² + ϵ)),

where ϵ is a small positive constant to prevent division by zero.

A lack of mean centering in FRN can lead to activations having an arbitrary bias away from zero. Such a bias in conjunction with ReLU can have a detrimental effect on learning and lead to poor performance and dead units. To address this the authors augment ReLU with a learned threshold τ to yield:

z = max(y, τ)

Since max(y, τ)=max(y-τ,0)+τ=ReLU(y-τ)+τ, the effect of this activation is the same as having a shared bias before and after ReLU.

PaperSourceSee Code · gupta-abhay/pytorch-frn

In Syntology for a different name, 'filter normalization', about another paper, arXiv:1712.09913: repository known, no verified implementation (declared_code; repositories: 5 listed of 11 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'filter normalization' (resolution: token_match); this answer is about that name. About another paper: this answer is about arXiv:1712.09913, while the archive credits arXiv:1911.09737.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:1712.09913 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 8 harvested samples) · 3 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

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.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; 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)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

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

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

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

5 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
CAPTCHA Detection1
Deep Learning1
Image Classification1
Object Detection1
object-detection1

Usage over time archive 2025-07-28

Papers per year tagged with Filter Response Normalization: 2019 to 2020, peak 1 1 0 2019: 1 paper 2019 2020: 1 paper 2020
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

Normalization

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