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.
ReLU backward gradient-variance recurrence
Statement
Consider a finite rectified stack in a fully connected layered perceptron, with widths , zero biases, , and , where . For an objective differentiable as a function of the last activation, set and define backward signals by the zero-at-kink convention , , and . At realizations where all relevant preactivations are nonzero, these are ordinary chain-rule gradients. At zeros they are specified backpropagation signals; no ordinary derivative of ReLU at zero is asserted.
Without any independence assumptions, fix a layer and suppose every is square-integrable. Then This is an exact atom-aware identity for the realized network signals. For any specified bounded measurable random gate vector in place of , define . If every redefined is square-integrable, the same mean and covariance formulas hold.
For the conditional recurrence, additionally assume at the layers in question that the entries of are independent with a common symmetric centered law of finite variance , that is symmetric with common zero probability , and that the coordinates of have common finite second moment . Assume the gate vector is independent of and is independent of . Write the fan-out as . Then If these hypotheses hold for every , then In particular, the source's atomless conditional case gives and the corresponding product of half factors. If the downstream coordinate is centered, is its variance. The conditional fan-out choice makes each atomless product factor one.
These conditional identities do not establish that a nonzero actual-network gradient satisfies their hypotheses. Indeed, if , is a ReLU output and , the assumption already forces almost surely. If also and gate independence holds, it forces . Thus the nonzero atomless backward preservation model with these full independence assumptions is infeasible for such an actual ReLU layer; the conditional implication and product remain valid, and the general covariance identity above supplies the unconditional finite-network formula.
Facts & Assumptions
Given: The finite stack, an objective differentiable as a function of with , and the backward-signal convention; square-integrable summands for the general identity; and, only for the conditional formulas, the stated symmetry, moments, and independence assumptions.
A fully connected layered perceptron evaluates each layer as a finite weighted sum followed by its specified activation. (Finite feedforward computation graphs and layered MLPs)
At totally differentiable points, derivatives of a composition multiply in layer order. (The chain rule for total derivatives: )
A symmetric preactivation with zero probability has positive sign probability . (Second moments of symmetric rectifiers)
Independent centered weights, independent of the input vector, give weighted-sum mean zero and variance equal to the sum of weight variances times input second moments. (Variance of a centered random weighted sum)
Products of independent integrable variables have factored expectations. (Expectations factor over finite products of independent random variables)
Variance and covariance are centered second moments. (Moments, variance, and covariance on a probability space)
Products of square-integrable variables are integrable by Cauchy–Schwarz. (Cauchy-Schwarz for random variables)
A finite independent family has product joint law. (Independent random elements have product joint law)
Expectation is linear on integrable random variables, and respects their almost-sure order. (Linearity, monotonicity, and the modulus bound for expectation)
Proof
At a realization with nonzero preactivations, the derivative of ReLU is the diagonal matrix with entries , and the affine derivative is . The chain rule [F2] therefore gives the two backward identities in the Statement. The specified convention defines the same identities at zeros without using [F2] there.
For fixed , . A finite sum of square-integrable variables is square-integrable: . By [F7] each pairwise product is integrable. Expanding the mean and centered square, then applying [F6] and expectation linearity [F9], gives exactly the asserted mean and covariance sums, without factoring any dependent variables.
Under the conditional assumptions, [F3] and gate independence give by [F5]. For fixed , the column of weights is centered, independent, and independent of . Applying [F4] yields mean zero and variance . This also equals the upstream second moment, proving the one-step formula.
Repeat step 1.3 for the finitely many layers . All generated upstream coordinates are centered and have the common second moment in step 1.3, so substitution gives the stated product, including a possibly uncentered terminal signal. Setting gives the original half-factor formulas and setting makes those factors one.
To prove the feasibility obstruction, let . Symmetry and positive variance imply : if , symmetry gives , forcing variance zero. By [F8], the event that all matrix entries are strictly negative has probability . Since is coordinatewise nonnegative, all coordinates of are nonpositive on , so and there, including when the input vector is zero. Independence of and now gives , hence almost surely. If , step 1.3's gate calculation gives , hence . This proves the obstruction without declaring the valid conditional identities false.
Remarks
He et al. §2.2, Eqs. (14)–(16), multiply the atomless half factors under the stated weight/incoming-gradient and gate/downstream-gradient independence assumptions. Those are a conditional moment calculation, not a proof of their realization by a nonzero finite ReLU gradient. Zero atoms also invalidate the ordinary derivative at those realizations; choosing the zero-at-kink convention addresses the algorithmic signal but does not establish the independence assumptions.
Depends on
- Finite feedforward computation graphs and layered MLPs
- 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)$
- Expectations factor over finite products of independent random variables
- Moments, variance, and covariance on a probability space
- Cauchy-Schwarz for random variables
- Independent random elements have product joint law
- Linearity, monotonicity, and the modulus bound for expectation
Used by
Dependency tree · two levels
35 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.2 (standard reference, not scraped)
- Johns Hopkins University, Handout #8: Neural Network Training and Tokenization, §3 (standard reference, not scraped)