Post-LayerNorm smuggled-bias degeneracy conjecture

Because the outputs are constrained by 1Tx=1\mathbf{1}^T x=1, let x=x1d1x'=x-\frac{1}{d}\mathbf{1}, so that 1Tx=0\mathbf{1}^T x'=0, and let WRm×dW\in\mathbb{R}^{m\times d} act on the input. Define the smuggled bias by

bsmuggled=1dW1.b_{\mathrm{smuggled}}=\frac{1}{d}W\mathbf{1}.

Then Wx=Wx+bsmuggledWx=Wx'+b_{\mathrm{smuggled}}. Post-LayerNorm smuggled-bias degeneracy conjecture. For y=LN(Wx)y=\mathrm{LN}(Wx) with mean-squared-error loss on the LayerNorm output, the LLC drop relative to a full-rank Gaussian baseline is

Δλ=m2.\Delta\lambda=\frac{m}{2}.

LayerNorm's translation invariance should make bsmuggledb_{\mathrm{smuggled}} an effective blind spot, although the precise symmetry group of the Post-LayerNorm loss landscape has not been characterized. Current SGLD-based LLC estimates are unreliable in this setting, with the reported estimate Δλ=0.92±0.86\Delta\lambda=-0.92\pm0.86 over five seeds; a direct proof or a better-calibrated estimator is still needed.

Sources & referencesView supporting material

Primary source

Sungbae Chun, “The Geometric Cost of Normalization: Affine Bounds on the Bayesian Complexity of Neural Networks”, arXiv:2603.27432 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.