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.
Simultaneous initialization estimates for the Du architectures
Statement
Use either of the two architectures, its own terminal population kernel , and independent Gaussian initialization. Assume AC, DC and countable choice and the activation and bounded-label hypotheses of the convergence theorems. Fix . Write , and . There are constants and , depending only on the fixed activation bounds, its normalizer, the label bound, and, in the residual case, , with the following property. For the fully connected case put ; if
then with probability at least , simultaneously:
Here is the Jacobian block of the last hidden-layer matrix, and is the derivative of the scalar output with respect to the hidden feature vector , so . In the residual case , the same conclusions hold with replaced everywhere in the conclusions by , provided
For residual depth one use the fully connected case. Constants may be enlarged, and may be increased, simultaneously in these conclusions.
Statement references
Facts & Assumptions
Given: The architecture, its population recursion, the data, Gaussian initialization, width and confidence parameters in the Statement.
The architecture-specific population recurrences, including residual means, and their positive semidefiniteness are supplied locally. Fully connected and residual networks with the Du Gram kernel The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite
Lipschitz functions of a standard Gaussian vector obey the stated one-sided concentration inequality; applying it to both signs gives a two-sided bound. Lipschitz concentration for standard Gaussian measure
Gaussian vectors have the stated covariance and even moments . Multivariate normal law, including singular covariance Gaussian even moments for Brownian increments
Conditional on hidden features, the Gaussian output norm is at most the square root of their total squared norm plus their operator norm times , with failure probability at most . Gaussian output initialization concentrates conditionally on the hidden features
If have finite second moments, then ; expanding a square and applying this bound gives the triangle estimate used for residual feature variances. Cauchy-Schwarz for random variables
Euclidean Cauchy–Schwarz bounds inner products and the Euclidean norm satisfies the triangle inequality. Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation
A nondegenerate bivariate normal vector has its Gaussian Lebesgue density. A positive-definite multivariate normal law has its Gaussian density
Differentiation may pass through an integral when parameter derivatives have a common integrable majorant. Differentiation under the integral sign
Integration by parts is valid on a compact interval when the derivatives are integrable. If are differentiable on with integrable, then
Dominated convergence passes limits through integrals under a common integrable majorant. Dominated convergence
For nonnegative and , . Markov's inequality for random variables
For square-integrable and , . Chebyshev's inequality for random variables
A real function continuous on a compact interval and differentiable in its interior has some derivative equal to its average rate of change; this turns the bounded -derivatives in step 2.1 into Lipschitz bounds. The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
Analyticity gives , and the -Lipschitz property of gives wherever needed in step 2.1. [given]
A -net of the Euclidean unit sphere in exists with at most points. Finite epsilon nets of the Euclidean sphere
Matrix operator norms are induced by the Euclidean vector norm. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
For , . The -norms for rational , and
The Frobenius norm is the Euclidean norm of the matrix entry list, ; for any unit , Euclidean Cauchy–Schwarz gives , hence . The Frobenius norm on real or complex matrices Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation
In the residual coupling, the feature vector and fresh Gaussian vector are independent, so . This is the construction in The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite and yields the monotone variance lower bound in step 4.1.
For finitely many independent real random variables, expectations of products of nonnegative Borel functions factor, including when the expectations are extended nonnegative values. Expectations factor over finite products of independent random variables
The probability of a finite union of events is at most the sum of their probabilities. The finite union bound
Proof
We give the scalar estimates used below explicitly. If are centered Gaussian variables with variances at most a fixed , then and [F3] imply ; [F5] then gives for integers . The same last bound holds for when is an independent standard normal, because . After centering, each such variable satisfies , enlarging using . Expanding its exponential series, for one has . For independent copies, [F20] factors the exponential moment of their sum. Applying [F11] to with , and then to , to obtain for . All constants are uniform over the covariances with these variance bounds.
The Gaussian expectation maps needed in the population recurrences are Lipschitz functions of the three entries of their bivariate covariance on any region , where is fixed. This applies to for and , and to the residual marginal map . At fixed , changing changes these expectations by at most : use the Lipschitz constants , , and [F5] to bound the resulting products. For fixed and , the covariance matrix is positive definite, so [F7] supplies the density . On any compact interval , its eigenvalues lie between and . Direct differentiation of the Gaussian density gives . Uniform eigenvalue bounds imply that is bounded by an integrable polynomial times , uniformly on this interval; has at most linear growth and is bounded. Thus [F8] justifies differentiating the expectation under the integral. On finite rectangles apply [F9] successively in and ; the boundary terms tend to zero as the rectangles expand because of Gaussian decay and the growth bound. The same integrable majorant and [F10] pass the rectangle limits, giving . Its absolute value is at most for and for , since and . At , the representation , is dominated after multiplication by either pair of activations by , which is integrable; [F10] gives continuity at both endpoints. Finally is Lipschitz in the covariance entries when .
Write and, for residual layers, . Conditional on previous layers, the preactivation pairs in distinct rows are independent centered Gaussians with covariance given by . In the fully connected case, step 1.1 bounds each difference of from its conditional mean by , except with probability , where . Its conditional mean is exactly the fully connected population expectation evaluated at . Since the population diagonal is one, step 2.1 gives, while the error is at most a fixed small constant, , where and . If is a fixed base for this recurrence, then after enlarging its prefactor. Choose the statement constant and enlarge the width constant; its term , with , then makes this error smaller than both the fixed stopping threshold and . Conditional bounds and the finite union bound [F21] over therefore justify the estimates through layers ; the last hidden-feature norm is bounded by one further conditional application of the activation moment estimate, without identifying its covariance with the terminal derivative kernel. A first layer crossing the stopping threshold would contradict this recurrence. In particular all feature norms are bounded by a constant, hence by .
In the residual case the population feature variances lie in a fixed compact interval independent of . Indeed the vector construction in [F1] gives , whose diagonal is . Positivity of follows from nonconstancy, continuity and the positive Gaussian density. Also with , so iteration gives a fixed upper bound. The empirical conditional mean satisfies exactly the same residual second-moment/mean recursion with replaced by . The nonlinear quadratic part has conditional fluctuation at most by step 1.1. Each cross part is ; its centered value has absolute size at most by [F2], since its Lipschitz constant in the independent row Gaussians is at most . The empirical mean has fluctuation at most by [F2]. Step 2.1 now yields , taking the maximum of the covariance and mean errors. The first layer has by step 1.1 and [F2]. Hence uniformly in . The width assumption and the same stopping argument, now in , justify the conditional estimates and give the feature bound through ; the finite union bound [F21] combines their layerwise failure probabilities. One further conditional step gives , using the same upper-norm recurrence, so .
For either architecture, conditional on layers before the last, the last-hidden-layer Jacobian Gram entries are , where for the fully connected case and for residual . This follows by differentiating the last layer. The summands are independent across . Steps 1.1–2.1, the feature bounds and errors just proved give entry error at most in the fully connected case, for a fixed base depending only on the fixed activation bounds, and at most in the residual case. Choose the statement constant also with ; the displayed logarithmic width term and a sufficiently large fixed multiplier then make both errors at most . A finite union bound [F21] covers the terminal-kernel entry events. If an matrix has entries bounded by , then for any , by [F6], hence . Thus . Both matrices are symmetric, and for every , , where . The Rayleigh-quotient characterization of the smallest eigenvalue now gives .
By [F16], choose a -net of the unit sphere with at most points. The Euclidean norm duality follows from [F6], so . For unit , choose within of them. Then [F6] gives . Taking suprema yields . Each is standard normal, whose tail is at most by [F2]. The finite union bound [F21] gives for all with failure at most when , which follows from either displayed width because in the fully connected case and in the residual case. The latter bound follows by bounding the diagonal of its terminal kernel with step 4.1. Gaussian second and eighth moments and [F12] give and with failure at most when , also implied by the widths. These arguments never bound on the whole input space, so no input-dimension condition is used.
Conditional on hidden weights, , where is the product of downstream feature Jacobians. Their operator norms have fixed envelopes in the fully connected case and in the residual case, using for residual layers. Increase the conclusion constants so these envelopes are at most and , respectively. Each coordinate is centered Gaussian of variance at most or . Since , its two-sided tail is at most ; the finite union bound [F21] over at most coordinates gives the asserted coordinate maxima with failure at most . Finally [F4] and give or with failure at most .
By the finite union bound [F21], allocate at most to each fully connected feature-covariance or terminal-feature-norm event in step 3.1; there are at most such events. Allocate at most to each residual covariance, cross-term, mean, or terminal-feature-norm event in step 4.1; there are at most such events. Allocate at most to each terminal-kernel entry event. The weight-matrix and readout norm events in step 5.2 each use ; backward coordinates use and the output norm uses in step 6.1. Even summing both architecture allocations, these budgets total at most . The thresholds are constant multiples of or ; increasing the fixed constants in the width and conclusions makes each displayed concentration bound meet its allocation without changing their forms. Adding the deterministic bounded-label contribution proves the simultaneous event.
Depends on
- Fully connected and residual networks with the Du Gram kernel
- The recursively defined population Gram matrices are finite, symmetric, and positive semidefinite
- Gaussian output initialization concentrates conditionally on the hidden features
- Lipschitz concentration for standard Gaussian measure
- Multivariate normal law, including singular covariance
- Gaussian even moments for Brownian increments
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy-Schwarz for random variables
- 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
- A positive-definite multivariate normal law has its Gaussian density
- Differentiation under the integral sign
- If $u,v$ are differentiable on $[a,b]$ with $u',v'$ integrable, then $\int_a^b u v' = u(b)v(b)-u(a)v(a) - \int_a^b u'v$
- Dominated convergence
- Markov's inequality for random variables
- Chebyshev's inequality for random variables
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- Finite epsilon nets of the Euclidean sphere
- 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$)
- Expectations factor over finite products of independent random variables
- The finite union bound
Used by
Dependency tree · two levels
139 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)