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 forward preactivation-variance recurrence
Statement
Let and let be positive integers. For each , let have mutually independent, identically distributed entries with a symmetric law, mean zero, and finite variance , and suppose is independent of the input activation vector . Set the fan-in , set every bias to zero, and define and coordinatewise, where . Assume for every layer that the coordinates of have a common finite second moment; they need not be independent or identically distributed. Also assume that each preactivation coordinate has a symmetric law; an atom at zero is allowed in this forward second-moment recurrence. Then, for every and , At the raw-input boundary, the exact base relation is if is centered, its second moment here is its variance. In particular, writing , the exact finite-depth formula is Thus for gives , with zero atoms allowed at every depth. This is a statement about ensemble second moments, not about variance along every sampled network or training success.
Facts & Assumptions
Given: A finite fully connected layered perceptron with zero biases, symmetric centered independent weights, layer inputs independent of their weights, symmetric preactivations, and the stated layerwise moment assumptions.
A fully connected layered perceptron has a real weight on every edge between consecutive layers, so each preactivation is the corresponding finite weighted sum. (Finite feedforward computation graphs and layered MLPs)
For independent centered weights independent of a square-integrable input vector , . (Variance of a centered random weighted sum)
If is symmetric about zero, , including when has an atom at zero. (Second moments of symmetric rectifiers)
Proof
In the fully connected layer from to , each coordinate is . Apply [F2] to this row of weights and the input vector. Since its entries have common variance and the input coordinates have common second moment, this gives and . For this is the stated raw-input base relation.
For , . By [F3], . Symmetry makes , so this is . Substitution into step 1.1 proves the claimed recurrence.
Apply step 2.1 successively for . The product of the finitely many coefficients is the displayed expression for ; setting each coefficient to proves preservation. No division by a variance occurs, so the identity also holds when .
Remarks
The equal-second-moment assumption allows the dependence between coordinates that naturally arises after averaging over a random previous layer. For a concrete finite-depth model satisfying all these hypotheses, take every width to be one, , and mutually independent weights with equal probabilities, where . At each layer the fresh weight is independent of the preceding activation and its random sign makes the preactivation symmetric. The event already forces all subsequent preactivations to vanish, yet and hold exactly. Thus atomlessness is unnecessary for finite-depth forward propagation.
Depends on
Used by
Dependency tree · two levels
13 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 (standard reference, not scraped)
- Johns Hopkins University, Handout #8: Neural Network Training and Tokenization, §3 (standard reference, not scraped)