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.
Rectifier variance-preserving initialization
Definition
Inputs. A finite layered perceptron with positive integer widths , a real negative-side slope , a mode , and a finite mutually independent family of real random variables with a common symmetric law, mean zero, and variance one. The layer matrix has shape , with row index and column index .
Output. Random weight matrices and zero bias vectors .
Instructions. For each , set the fan-in and fan-out . Set For every matrix entry set , and set . The case is ReLU; the piecewise-linear activation for general is for and for .
Remarks
The repeated forward recurrence concerns a layer whose inputs are outputs of a rectifier. A raw-input first affine layer has no preceding rectifier factor. If the input coordinates are square-integrable, centered, have common variance , and the first-layer weights are independent of the input vector, then the finite weighted sum has mean zero. In its second moment, the diagonal terms each contribute and the off-diagonal terms vanish because the weights are independent and centered. Thus , so preserves . He et al. also use the rectifier scale at that first layer for simplicity; this changes one boundary factor, not the repeated hidden-layer factor. Fan-in mode and fan-out mode target different directions and need not preserve both when layer widths differ. The paper's depth and ImageNet accuracy comparisons are reported experiments, not consequences of this definition and not guarantees of training success or generalization.
The mode names specify the source's forward and conditional backward moment targets. They do not assert that finite-network gradients are independent of their weights or gates. A positive-probability zero preactivation requires a specified kink convention for backpropagation; it does not have an ordinary ReLU derivative. Consequently the backward scale alone supplies no nonzero actual-gradient preservation guarantee.
Depends on
Used by
Dependency tree · two levels
9 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)