Initialization schemes and early-training interventions that change the loss landscape the optimizer sees.
Replace a dense token-mixing, MLP, or low-rank-adapter projection with a Bernoulli-signed sparse matrix normalized by the paper's predicted operator scale. Estimate the active representation dimension and use the effective scale to detect regimes in which extreme sparsity is likely to cause unstable amplification or dead rows.
Use Marchenko–Pastur spectral edges to calibrate tensorized random features even when the base vector has exchangeable, sign-symmetric dependent coordinates. Rescale the tensor features and select their retained dimension so the predicted covariance bulk remains well-conditioned instead of assuming independent Gaussian coordinates.
Initialize a univariate polynomial-activation hidden layer to realize a prescribed polynomial exactly, rather than relying on gradient descent to learn the required cancellation between shifted monomials. This provides an analytically controlled starting point for polynomial MLPs, polynomial feature extractors, and teacher-to-student initialization when the desired local map is known or fitted from data.