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.
A wide tanh network stays lazy on a fixed time horizon
Example
Assume AC. Fix , a data set , a depth , a bias scale , and the scalar-output source-normalized network with independent standard-normal initialization under its product law. Let . For each finite hidden-width tuple, take the unique gradient-flow path as a measurable function of the initialized parameters on , satisfying
so the empirical training direction is for every datum and time. The finite-width path exists on every finite interval, and its integrated empirical direction norm on equals . Consequently, as the hidden widths tend to infinity sequentially, the finite-data neural tangent kernel remains uniformly close in probability on to the deterministic recursive limiting kernel for this network and data set.
Example references
Facts & Assumptions
Given: , a fixed finite data set and finite depth, the positive bias scale, the source-normalized scalar-output network, and the constant training direction.
The exponential is positive, satisfies the addition formula, and has derivative equal to itself; sums, products, quotients with nonzero denominator, and compositions obey the derivative rules (The real exponential function and the number by a power series, The exponential is positive and satisfies , The exponential addition formula , The exponential function is smooth and , Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ).
The mean value theorem bounds increments of a differentiable function by a uniform derivative bound (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
A locally Lipschitz finite-dimensional vector field has a unique local solution (Picard-Lindelöf local existence and uniqueness for first-order systems).
The parameter-gradient formulas follow from reverse accumulation over shared parameters (Reverse accumulation sums gradients over shared parameter uses); the finite-data NTK stays uniformly close in probability to its deterministic limit on any fixed interval under the hypotheses in the stability lemma and sequential-width theorem (Finite-data fixed-time NTK stability under integrably bounded training directions, Sequential infinite-width NTK limit and finite-time lazy training dynamics, The neural tangent kernel of a differentiable parameterized function, Jacot–Gabriel–Hongler width-normalized fully connected networks).
Verification
Put . Then , so . The derivative rules in [F1] give and . Thus and . By [F2], , so is globally Lipschitz. Since , it is nonconstant; a polynomial of degree with leading coefficient satisfies as , so its absolute value is unbounded. The bounded nonconstant is therefore nonpolynomial.
For each finite network, the parameter vector field for the constant direction is smooth and locally Lipschitz, so a local solution exists by [F3]. The output-layer weights and bias have bounded speed because all hidden activations are bounded by , so they remain bounded on every compact time interval. Suppose the parameters in layers are bounded on such an interval. Backpropagating through those layers multiplies the direction by their finite weight matrices and factors of modulus at most , so each coordinate of the backpropagated direction at layer is bounded. The gradient formulas in [F4], together with , then bound every derivative in layer ; integration bounds its weights and biases. Descending induction bounds all parameters on every compact interval. If the maximal local solution had a finite endpoint, the smooth vector field would be bounded on a compact ball containing the trajectory, so the trajectory would be Lipschitz in time and have a limit as the endpoint is approached. Applying [F3] at that limit extends the solution, a contradiction. Hence the path exists on . On any compact tube around a finite solution segment the vector field is Lipschitz; subtracting the integral equations for two solutions gives on the tube for a Lipschitz constant ; iterating this inequality gives , proving local continuous dependence on the initial parameters. A finite cover of patches these local flow maps. Thus the global path is measurable as a function of initialization and time. For this direction, at every time, so its integral is .
Step 1.1 supplies the globally Lipschitz activation and bounded second derivative, and step 2.1 supplies a finite-width solution and the required direction bound. Applying [F4] with gives in probability under the stated sequential hidden-width limit.
Depends on
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- 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)$
- The neural tangent kernel of a differentiable parameterized function
- The real exponential function and the number $e$ by a power series
- Jacot–Gabriel–Hongler width-normalized fully connected networks
- Finite-data fixed-time NTK stability under integrably bounded training directions
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- The exponential function is smooth and $(\exp)'=\exp$
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- Picard-Lindelöf local existence and uniqueness for first-order systems
- Sequential infinite-width NTK limit and finite-time lazy training dynamics
- Reverse accumulation sums gradients over shared parameter uses
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
70 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
- Arthur Jacot, Franck Gabriel, and Clément Hongler, Neural Tangent Kernel: Convergence and Generalization in Neural Networks (standard reference, not scraped)