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.
Parameter-ball control of the last-layer Gram and loss Hessian
Statement
Fix finite real parameters obeying either Du architecture recurrence, with all parameters equipped with the Euclidean norm (Frobenius norm on each matrix block). At a fixed initialization assume all hidden feature norms are at most , all matrices with have operator norm at most , , , and all backward feature derivatives have coordinate maxima at most , where . For fully connected networks allow for a fixed , while are fixed independent of . There are depending only on , these fixed bounds and the activation, with the following bounds; write . In the residual case the constants depend also on fixed , and every below is replaced by a fixed independent of . Uniformly on any parameter ball with (fully connected) or (residual),
In the residual last inequality the upper bound is for . The residual first-layer and output-vector derivatives are bounded without a factor . Consequently, if and , the loss Hessian on the ball satisfies
The constants in this last bound can again be fixed independent of for residual networks. For any segment from to contained in the ball, its output Taylor remainder satisfies
with replaced by fixed in the residual case.
Statement references
Facts & Assumptions
Given: The deterministic initialization bounds, the architecture, the parameter ball, and fixed activation constants , , .
The architectures and scalings are defined locally. Fully connected and residual networks with the Du Gram kernel
The chain rule gives the forward variations and backward feature derivatives of the finite network. Reverse accumulation sums gradients over shared parameter uses
Euclidean Cauchy–Schwarz bounds vector inner products, coordinate products, and sums over parameter blocks in the estimates below. Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation
Restricting a scalar output to a parameter line segment gives the first-order Taylor formula with integral remainder used in step 5.1. Taylor's theorem with an integral remainder
A vector-valued map whose derivative norm is bounded by on a segment is -Lipschitz along that segment. If is differentiable with integrable then ; and a bounded derivative makes Lipschitz
Matrix operator norms are the induced norms on finite-dimensional inner-product spaces, and the parameter norm uses the Frobenius norm on matrix blocks. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| The Frobenius norm on real or complex matrices
For , . The -norms for rational , and
Proof
Write and in both architectures, for fully connected , and for residual . A layer has feature Jacobian in the fully connected case, and in residual layers . Within the stated ball, . Products of consecutive , , therefore have norm at most in the fully connected case and in the residual case. All estimates below use only for matrix operator norms; the input is fixed.
Let . Lipschitz continuity gives . For fully connected layers, ; for residual layers it gives , using the fixed upper feature bound in the residual case and the initial exponential envelope in the fully connected case. Summing the geometric recurrences gives in the first case and in the second. The imposed smallness of keeps all feature norms in the required bounds and justifies the recurrences successively. Also or , since it is bounded by for , and by for .
For a unit parameter direction , let . At the first layer . Subsequent layers obey . The product bounds in step 1.1, the feature bounds in step 2.1, and Cauchy–Schwarz over layer blocks give or . For the residual case use , retaining the separate first-layer term. Thus or , uniformly in . Since and , each output gradient has norm at most or , proving or . This explicitly retains the output and first-layer terms with no bound.
Put . The backward recurrence is , with . Decompose its difference as . The latter is the sum of a weight-difference term bounded by (respectively ) and a gate-difference term bounded by , because . Summing the backward recurrence with the product bounds gives or . Hence or . The crude bound or follows separately from step 1.1 and .
For the last-hidden-layer Gram, put , and or . Direct differentiation gives . Subtract its initialized version in three parts: feature-inner-product change, derivative-gate change with , and output-weight-square change. Step 2.1 bounds the first part by or before multiplying by . For the second part, Cauchy–Schwarz gives ; multiply by , and use step 2.1. For the third part, . Feature norms and bound all remaining factors. The entry error is consequently at most or . The operator norm is at most times this entry bound.
For two unit parameter directions , twice differentiating the output gives the mixed output-weight terms , and the sum over layers of This identity follows by differentiating every primitive twice and propagating each resulting second-order term through its downstream Jacobians; the linear skip has zero second derivative. The coordinate-product inequality , steps 3.1–3.2, and or bound the first part by or . The terms involving use the backward bound and or ; summing with Cauchy–Schwarz over matrix blocks gives the same bound. The output-weight mixed terms are at most or . This proves the output-Hessian bound, with polynomial factors in absorbed into only for the fully connected case.
The identity gives . Integrating the Jacobian along the straight segment to initialization gives or . Substitution of steps 3.1 and 4.1 proves the claimed loss-Hessian bound, after enlarging to absorb squares of fixed exponential envelopes. For each coordinate the integral Taylor formula is . Step 4.1 bounds its absolute value by or the corresponding residual constant. Summing coordinate squares gives the stated vector Taylor bound.
Depends on
- Fully connected and residual networks with the Du Gram kernel
- Reverse accumulation sums gradients over shared parameter uses
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- Taylor's theorem with an integral remainder
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The Frobenius norm $\lVert A\rVert_F=(\sum_{i,j}|a_{ij}|^2)^{1/2}$ on real or complex matrices
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
79 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
- Du, Lee, Li, Wang and Zhai, Gradient Descent Finds Global Minima of Deep Neural Networks, Appendices B, C, E and G (standard reference, not scraped)