Jacobi Moment Spectral Regularizer
Implementation & benchmark of arXiv:2607.27185 — Sharp Bounds on Ground State Energy of the SYK Model
Source paper: Sharp Bounds on Ground State Energy of the SYK Model arXiv:2607.27185 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Regularize the Gram spectrum of selected neural layers so that its low-order moments match the spectral moments generated by a truncated q-boson Jacobi operator. Unlike a simple Frobenius or spectral-norm penalty, this controls several parts of the singular-value distribution simultaneously and can discourage harmful spectral tails without forcing all singular values to be equal.
Formulas
Mathematical statement
Let T_L be the L-by-L truncation of the paper's tridiagonal operator with (T_L)_{r,r+1}=sqrt([r+1]_q), where [r]_q=(1-q^r)/(1-q), and let e_0=(1,0,...,0)^T. Define target even moments a_{2ell}=e_0^T T_L^{2ell}e_0 and normalize them by a_2 so that the target second moment is one: mu_{2ell}=a_{2ell}/a_2^ell. For a neural weight matrix W with input width d, define the normalized Gram matrix C=W^T W/(tr(W^T W)/d). Its empirical normalized moments are b_ell=tr(C^ell)/d. Add R(W)=sum_{ell=2}^p beta_ell(b_ell-mu_{2ell})^2, optionally including a penalty on b_1-1. Trace powers can be estimated without forming C using Hutchinson probes z satisfying E[zz^T]=I_d: tr(C^ell)/d is estimated by (1/(Kd)) sum_i z_i^T C^ell z_i. The transferable mathematical asset is the explicit moment sequence induced by a Jacobi recurrence; the neural adaptation treats it as a target spectral shape.
Implementation notes
Attach the regularizer to weight matrices of MLP expansion/projection layers or attention Q,K,V projections during training, initially excluding embeddings and output heads. Precompute target values mu_4, mu_6, and mu_8 from a 32-by-32 or 64-by-64 T_L for a selected q; these constants are detached from autograd. At each regularization step, form C implicitly. For each Hutchinson probe z, compute v_0=z and repeatedly apply v_{j+1}=W^T(Wv_j)/s, where s=tr(W^T W)/d is computed directly from the weight tensor. Estimate b_j by z^T v_j/d, average over K=1 or 2 fixed Rademacher probes, and add lambda times the squared deviations from mu_{2j}. Refresh probes every few hundred steps and backpropagate through W but not through the target moments. The paper contributes the deterministic recurrence and moment targets; trace estimation and coefficient selection are empirical. Begin with a six-layer width-256 MLP on CIFAR-10 or a two-layer transformer on a small language dataset. Compare no spectral regularization, Frobenius decay, spectral normalization, and this penalty at matched FLOPs. Track validation loss, gradient norm, estimated top singular value, and b_4,b_6,b_8. Success is reduced spectral-tail growth, improved validation performance, or stable training with a larger learning rate without divergence.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.