Initialization ideas

Initialization schemes and early-training interventions that change the loss landscape the optimizer sees.

△ Mechanism confirmed, baseline not beaten 2026

Spectral subspace initialization for nonlinear teachers

Use a bounded function of the response to form a supervised, label-weighted covariance of the input and initialize the first neural layer from its leading outlier eigenspace. For vector-valued responses, use a matrix-valued response preprocessing map so several label statistics are combined in one lifted spectral estimator.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Spectral phase transitions in Gaussian multi-index models arXiv:2608.12183
Unverified 2026

Separated Digital-Net Codebook Initialization

Initialize VQ-VAE, product-quantization, or prototype embeddings from a matrix-scrambled digital net after mapping points into the data latent region. This aims to prevent early codebook collisions and dead entries by giving codewords broad coverage and controlled minimum separation, rather than relying on Gaussian initialization or random samples that contain increasingly large local gaps.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: Separation properties of scrambled digital nets and related random point sets arXiv:2607.29063
Unverified 2026

Marchenko–Pastur Tensor Initialization

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.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Marchenko-Pastur law for tensor powers of exchangeable unconditional vectors arXiv:2607.21759
Unverified 2026

Vandermonde polynomial initialization

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.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: Landscape analysis for shallow neural networks: Complete classification of critical points for cubic activation and affine target functions arXiv:2607.15173
Unverified 2026

Spherical-Design Prototype Initialization

Initialize directional prototypes, cosine-classifier weights, or angular attention directions with a spherical t-design rather than iid random vectors. Exact matching of spherical moments through degree t should provide uniform angular coverage and reduce initialization anisotropy, especially when the number of prototypes is small.

Useful5/10
Difficulty4/10
Novelty5/10
Paper: Dual Geometry of Spherical Designs: Polarity, Self-Polar Rigidity, and Quadrature Structure arXiv:2609.02439
Unverified 2026

Projective stationary-energy initialization

Split a recurrent state into two blocks and initialize their variances and cross-correlation according to the stationary projective energy distribution induced by the transition. This places the initial hidden state near the typical invariant direction of the dynamics instead of forcing a long transient from zero or isotropic noise.

Useful5/10
Difficulty5/10
Novelty7/10
Paper: Quantitative Furstenberg Theory for Large Random Matrices arXiv:2608.22543
Unverified 2026

Semicircle-Calibrated Additive Initialization

Calibrate the scales of several additive self-adjoint residual or attention operators so their aggregate spectrum has a controlled higher-moment Berry–Esseen certificate. Penalize unusually large normalized (2+δ)-moments, which should reduce spectral outliers and make the summed operator closer to a predictable semicircle-shaped spectrum.

Useful4/10
Difficulty5/10
Novelty7/10
Paper: The Berry--Esseen Estimate in the Free Central Limit Theorem arXiv:2608.05866