cs.LGAug 27, 2026

High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercube

Authors: Josef Dick, Michael Feischl, Fabian Zehetgruber

Abstract

We establish high-probability bounds for mixed input derivatives of wide random neural networks whose activation derivatives satisfy a factorial growth bound. Our main result specializes these estimates to tanh⁡\tanh networks with Xavier initialization. A direct deterministic analysis based on Euclidean operator norms of the weight matrices yields derivative bounds that generally grow exponentially with the depth. We show that this growth can be substantially improved for sufficiently wide Gaussian networks by isolating the term that is linear in the highest-order derivative and controlling the corresponding tangent directions by measurable finite nets. For scalar-output tanh⁡\tanh networks with Gaussian weights and Xavier initialization, we prove that there exist constants C,C0,C1>0C,C_0,C_1>0 such that, whenever the common hidden width satisfies n≥C(L3n02(1+log⁡n0)+L2(1+log⁡(L/η)))n \geq C\left(L^3n_0^2(1+\log n_0)+L^2\left(1+\log(L/η)\right)\right), then, with probability at least 1−η1-η, the estimate ∣DuRΦ(L)(x)∣≤C0∣u∣!(C1L)∣u∣−1∏j∈uβj(η,n0)\left|D^u\mathcal{R}_{Φ^{(L)}}(x)\right| \leq C_0 |u|! (C_1L)^{|u|-1}\prod_{j\in u}β_j(η,n_0) holds simultaneously for every non-empty u⊆[n0]u\subseteq[n_0] and every x∈[0,1]n0x\in[0,1]^{n_0}. Thus, the first-order derivative bound is independent of the depth, while a square-free mixed derivative of order ∣u∣|u| grows at most polynomially as L∣u∣−1L^{|u|-1}, apart from the coordinate factors. As consequences, we obtain high-probability bounds for the Euclidean Lipschitz constant and for weighted Sobolev norms of the network realization. The latter connect the derivative estimates to quasi-Monte Carlo integration and indicate how such regularity can enter the analysis of QMC-based training.

Explore similar work

Jun 9, 2026

Limitations of Learning Tanh Neural Networks with Finite Precision

We investigate limitations of learning tanh⁡\tanh neural networks from point evaluations under finite-precision computations and LpL^p accuracy guarantees, building on Berner, Grohs, and Voigtländer (2023). Our approach is based on a novel construction of sharply localized bump functions via iterated tanh⁡\tanh activations. Using this mechanism, we show that, in a finite-precision setting, no adaptive randomized algorithm based on mm samples can achieve a convergence rate higher than the Monte Carlo rate O(m−1/p)O(m^{-1/p}) in the LpL^p norm, unless the sampling budget grows exponentially with the size of the network parameters and architecture. The results reveal fundamental limitations imposed by finite precision on the learnability of classes containing localized bump functions, extending previous results for ReLU networks to the tanh⁡\tanh setting.
Sep 8, 2026

Critical initialization destabilizes higher input derivatives in wide scalar-input networks

The edge-of-chaos condition preserves first-order input perturbations in wide randomly initialized networks, but physics-informed losses, score matching and derivative regularization depend on higher input derivatives. For smooth scalar-input fully connected networks, using a joint Gaussianity of the finite derivative jet that holds in the infinite-width limit at each fixed depth, we derive mean-field recursions through third order that are exact at the variance fixed point, with finite-depth corrections that decay geometrically. At criticality, the first-derivative variance is depth-invariant, whereas the second-derivative variance grows linearly whenever the activation has nonzero curvature. The resulting third-order system closes on mean-field susceptibilities. For residual networks with branch scale L^{-1/2}, we prove that every fixed finite derivative order has uniformly bounded variance under explicit regularity assumptions. Simulations verify the critical growth laws, the residual bound, and the closed recursion. The results concern initialization, not trained-network performance.
Oct 13, 2026

Lifting Finite-Sample Gaussian Approximation of Wide Neural Networks to Functional Convergence

Randomly initialised neural networks of width mm converge to Gaussian processes as m→∞m \to \infty, with two types of quantitative bounds characterising this convergence. Finite-sample bounds compare the network with its Gaussian limit at a fixed finite sample set, on an arbitrary domain, in the quadratic Wasserstein distance W2\mathcal W_2, achieving a convergence rate of m−1/2m^{-1/2} with explicit constants. However, these constants grow with the number of samples, so the bound becomes uninformative as the sample set is refined. Functional bounds remove that dependence by comparing the two as random functions, at the price of spherical input, metrics weaker than W2\mathcal W_2, or slower rates. In this paper, we therefore lift a finite-sample bound to a functional one. The lifting refines the sample set until it is dense in the domain, so the bound must first be made independent of the number of samples. We achieve this by measuring the error per sample, which makes the constant uniform. For a polynomial activation and any compact input set, this gives a rate of m−1/2m^{-1/2} in the supremum norm, with an explicit constant.