SOURCE-LINKED INTELLIGENCE

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

arXiv · AI, language, vision and robotics · article · Aug 27, 2026 · UTC

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$ 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 c

Read original source ↗ Open in workspace

recordType

paper

region

Global