Skip to content

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

Sep 2026 · 0 citations · 21 references
Mathematics Computer Science

TL;DR

It is proved that every fixed finite derivative order has uniformly bounded variance under explicit regularity assumptions, and for residual networks with branch scale L^{-1/2}, it is proved that every fixed finite derivative order has uniformly bounded variance under explicit regularity assumptions.

Abstract

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.

View source

Similar papers

#machine learning Preprint Sep 2026

Correlated initialization of deep residual networks

We study the large-depth behavior of residual networks whose weights are correlated across layers at initialization. Our results confirm and extend a conjecture of Marion et al. [2025], according to which correlated initializations should interpolate continuously between the Brownian stochastic differential equation ar...

Felix Benning, I. Nourdin, G. Peccati · 1 citation
#machine learning Preprint Oct 2026

Global Exponential Convergence of Two-Layer Linear Network Training

We prove global exponential (linear) convergence with an explicit rate in the rich scaling for wide two-layer linear networks trained with smooth Polyak-Lojasiewicz predictor losses. Gradient flow in the factors closes exactly in terms of a finite-dimensional Bures flow of the neuron law covariance, in which the predic...

Stephen Y. Zhang, Gabriel Peyré · 1 citation · ⚡1
Preprint Oct 2026

Exact Tail Laws for Nonlinear SGD with Infinite-Variance Gradients

This work describes its accuracy through exact first-order tail probabilities for the last iterate of nonlinear, constant-stepsize SGD, and proves its relative accuracy at shrinking tolerances above the central scale, with state-dependent noise and a growing observation horizon.

Xiao-Lin Li, Qi Lei, Zi-Yang Wei et al. · 0 citations
Preprint Oct 2026

Conditional Fluctuations of Mean-Field Systems with Stable Common Noise

We study conditional fluctuations of smooth mean-field systems on a torus with endogenous symmetric stable common jumps of index $0<\alpha<1$. A positive-strip estimate makes empirical Poisson acceptance errors negligible at the sampling scale. The conditional laws given the full Poisson master converge in probability...

Alexandre Autran · 0 citations
Open access Oct 2026

Sharp Gaussian information-response frontiers: finite p-adic realization and noncommuting harmonic quenches

How strongly can a positive precision update change a Gaussian response at a given information cost? Standard log-determinant and inverse-update identities do not by themselves determine the admissible costs when the worst modal contraction, total contraction, and active-rank cap are fixed. On a finite-dimensional phys...

David Rebollo-Martínez, M. Rebollo-Salas · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.