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

arXiv:2608.26526 2026 Regularization 1 ideas extracted · analyzed Aug 29, 2026

What the math gives to ML

The paper replaces worst-case layer-norm multiplication with high-probability derivative control for wide random tanh networks. Under Xavier Gaussian initialization and an explicit width condition, first-order input sensitivity is independent of depth, while square-free mixed derivatives grow polynomially in depth rather than exponentially. The most direct neural-network transfer is a derivative regularizer whose order-dependent targets follow this scaling, combined with width-aware initialization and monitoring of Jacobian growth. This is particularly suitable for smooth surrogate models, robustness-sensitive regressors, and neural operators where input regularity matters.

Ideas from this paper

Unverified Re-invented 2026

Polynomial-depth derivative regularization

Train a wide tanh network with a regularizer that constrains input Jacobians and sampled square-free mixed derivatives according to the theorem's depth scaling. First-order derivatives receive a depth-independent target, while an order-k mixed derivative is allowed to scale like k! L^(k-1), avoiding the exponentially conservative penalties implied by multiplying layer operator norms.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercube arXiv:2608.26526