Quantitative Gaussian-Process limits of Tensor Programs

arXiv:2607.06290 2026 Architecture 2 ideas extracted · analyzed Aug 30, 2026

What the math gives to ML

The paper supplies quantitative, architecture-agnostic finite-width control for neural computations that converge to Gaussian-process limits, including recurrent weight sharing and transformer-style attention dependencies. The transferable asset is not merely the existence of an NNGP, but an explicit Wasserstein error rate of order n^{-1/2}, which turns infinite-width approximations into engineering estimates for finite models. This can support principled width allocation: assign larger widths only to layers or contraction dimensions whose finite-width approximation constants are large. A second practical use is to regularize empirical multi-input activations toward their recursively predicted NNGP covariance, especially in shared-weight recurrent or attention blocks where independent-layer GP intuition is inaccurate.

Ideas from this paper

Mechanism confirmed, baseline not beaten 2026

Wasserstein-Budgeted Width Allocation

Use the paper's finite-width O(n^{-1/2}) Gaussian-process approximation bound as a width-budgeting rule rather than choosing every hidden dimension uniformly. Estimate an architecture-specific constant for each layer or attention contraction, then allocate width according to the smallest dimension satisfying its allowed distributional error. This should produce narrower models at comparable GP-like behavior, or permit the same parameter budget to be concentrated in the layers where finite-width…

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Quantitative Gaussian-Process limits of Tensor Programs arXiv:2607.06290
Unverified 2026

Finite-Width NNGP Covariance Stabilizer

Add a training-time regularizer that keeps the empirical joint covariance of hidden activations on multiple inputs close to the recursively predicted NNGP covariance. The regularizer targets the finite-width fluctuations quantified by the Wasserstein result, and is particularly appropriate for recurrent networks and attention blocks with shared weights, where hidden states at different positions or time steps are statistically coupled.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Quantitative Gaussian-Process limits of Tensor Programs arXiv:2607.06290