Correlated initialization of deep residual networks
arXiv:2609.03589
2026
Dynamics
2 ideas extracted · analyzed Sep 4, 2026
What the math gives to ML
The paper identifies a concrete depth-dependent initialization law for residual networks with long-range correlated layer weights: if layer correlations decay as k^{-\alpha} and the feature map has Hermite rank q, the accumulated residual noise scales like L^H with H=1-\alpha q/2, so the nontrivial regime uses \lambda_L\asymp L^{-H}. This gives a principled continuum between Brownian-like independent initialization and smoother, strongly correlated depth dynamics, rather than choosing the usual 1/L or 1/\sqrt{L} scaling heuristically. The most transferable asset is a generator for correlated parameters together with a scaling rule that preserves an O(1) feature evolution as depth changes. A practical first test is to compare ordinary iid residual initialization against fractional-Gaussian or Hermite-transformed layer noise at equal depth, parameter count, and marginal activation variance.
Ideas from this paper
Unverified
2026
Replace independent residual-block parameters by a stationary correlated sequence and set the residual multiplier according to the sequence's long-memory exponent and Hermite rank. This preserves a nontrivial O(1) input-output transformation as depth grows, while avoiding activation explosion or identity collapse caused by inappropriate residual scaling.
Useful7/10
Difficulty6/10
Novelty8/10
Unverified
2026
Treat the correlation decay exponent and Hermite rank as explicit hyperparameters controlling the roughness of the depth-wise residual trajectory. Use smoother long-memory drivers for stable deep propagation and less correlated drivers when optimization needs more layer-wise diversity, while retaining critical scaling so the network does not collapse to the identity.
Useful6/10
Difficulty5/10
Novelty8/10