How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
PReLU fan-in and fan-out variance scales
Statement
Let and consider a finite rectified stack with zero biases, widths , , and , where for and for . Put and . Suppose each has independent entries with a common symmetric centered law of finite variance and is independent of . Suppose each layer input has coordinates with a common finite second moment, and all preactivation coordinates are symmetric about zero. Input coordinates may be dependent, and zero atoms are allowed. Then, writing , Thus preserves the forward preactivation variance across the hidden layers.
For backward signals, take an objective differentiable as a function of the last activation and set . Specify a finite kink value and put , , and . They are ordinary chain-rule gradients when all relevant preactivations are nonzero; when and the activation is linear and this also holds at zeros. Otherwise a specified kink value is a backpropagation convention. If the coordinates of have common zero probability , the coordinates of have common finite second moment , is independent of , and is independent of , then The upstream coordinates have mean zero. If these conditional hypotheses hold for every , then In the source's atomless case , this retains the original backward factor and the fan-out choice . For a noncentered terminal signal is its second moment; for centered signals it is their variance. The source's forward and atomless backward weight variances agree exactly when . With atoms the conditional backward-preserving choice is when ; if the upstream signal has zero variance for every finite weight variance. These are conditional backward statements, and no independence assumption or nonzero actual-gradient realization is inferred from initialization.
Facts & Assumptions
Given: The finite stack and its forward moment assumptions, an objective differentiable as a function of with , the specified backward-signal convention, and the additional layerwise conditional hypotheses only for backward preservation.
The source initializer uses forward variance or backward variance . (Rectifier variance-preserving initialization)
Symmetry gives PReLU second moment , and the squared gate moment is . (Second moments of symmetric rectifiers)
Independent centered weights independent of an input vector give weighted-sum mean zero and variance . (Variance of a centered random weighted sum)
Totally differentiable compositions obey the total-derivative chain rule. (The chain rule for total derivatives: )
The ReLU forward recurrence allows zero atoms and has factor and the corresponding finite-depth product. (ReLU forward preactivation-variance recurrence)
Exact backward signals obey a covariance-sum identity; the ReLU half-factor product is conditional, and its full atomless independence assumptions force zero downstream second moment at a nondegenerate actual ReLU hidden layer. (ReLU backward gradient-variance recurrence)
Expectations of products of independent integrable variables factor. (Expectations factor over finite products of independent random variables)
Proof
Apply [F3] to a row of . The preactivation is centered and has variance , which proves the raw-input relation. For , [F2] and centered symmetry give , proving the forward recurrence without an atomlessness or coordinate-independence assumption. Successive substitution gives the finite product; the forward choice [F1] makes every hidden-layer factor one.
At nonzero preactivations the derivative of PReLU is on the positive half-line and on the negative half-line, so [F4] gives the stated backward recursion for ordinary gradients there. At zeros the recursion is instead the specified convention, except in the linear case , where it is the ordinary derivative everywhere. By [F2] and independence of the gate and , [F7] gives .
Apply [F3] to each column of and , using the assumed matrix/signal independence. The upstream signal is centered and has variance . Iteration over the finite set of layers proves the backward product, just as for [F6]. If then and the source's backward choice [F1] gives unit coefficient. For positive , solving the unit-coefficient equation gives ; for zero the coefficient vanishes for every finite weight variance.
The positive source scales and agree exactly when . At , the forward and backward formulas specialize to [F5] and [F6], including the atom correction and feasibility caveat; at , for every zero probability, as required for the linear derivative. These substitutions also show why an arbitrary kink convention must not be silently identified with an ordinary derivative.
Remarks
The atomless half-factor product is retained as the precise conditional calculation in He et al. §2.2; the forward product is valid for actual finite stacks satisfying the forward assumptions, with dependent coordinates and zero atoms allowed. The backward independence hypotheses require separate verification for an actual network. In particular, the ReLU specialization has the explicit nonzero-feasibility obstruction proved in the backward theorem, even at one hidden layer. No mean-field limit or empirical training claim supplies that gap.
Depends on
- Rectifier variance-preserving initialization
- Variance of a centered random weighted sum
- Second moments of symmetric rectifiers
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- ReLU backward gradient-variance recurrence
- ReLU forward preactivation-variance recurrence
- Expectations factor over finite products of independent random variables
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun, Delving Deep into Rectifiers, §2.2 (standard reference, not scraped)
- Simon J. D. Prince, Understanding Deep Learning, §7.5.1–7.5.3 (standard reference, not scraped)
- Johns Hopkins University, Handout #8: Neural Network Training and Tokenization, §3 (standard reference, not scraped)