Use spatially correlated training points whose low-frequency structure factor vanishes instead of iid points. For neural fields, PINNs, image-coordinate MLPs, or spatially indexed minibatches, this should suppress long-wavelength quadrature and gradient-estimation noise while preserving the represented target dynamics. The finite-order prediction is that a design with structure factor S(k)=O(|k|^{2q}) produces lower variance for smooth losses than iid sampling, especially as the domain or batch…
Use multiplier bootstrap on minibatch activation covariances to determine whether a large top eigenvalue is a genuine representation direction or merely a high-dimensional bulk fluctuation. When a spike is repeatedly significant, apply a low-rank whitening or shrinkage correction to that activation subspace; otherwise leave the layer unchanged, avoiding destructive whitening of ordinary bulk variation.
Drive the optimizer periodically around a baseline learning rate, but scale the modulation amplitude and period through a single dimensionless control variable rather than tuning them independently. The neural analogue predicts that normalized loss, gradient norm, and parameter-displacement trajectories should approximately collapse across schedules with equal \(aP^{\kappa}\), while sufficiently large values should reveal a measurable transition from weak tracking to strongly oscillatory or…
Train Fourier or state-space neural models by eliminating well-conditioned spectral modes first and retaining near-resonant modes until a later stage. The schedule is determined by the small-divisor geometry of a reference transport vector, with a cumulative Brjuno-like budget controlling how aggressively spectral corrections may be applied. This should prevent rare nearly resonant modes from producing disproportionately large gradients or unstable long-horizon rollouts.
Use a Christoffel word as a periodic binary gate for an expensive training operation: activate the operation exactly r times in every N-step period, but distribute those activations as uniformly as possible rather than in blocks or independent Bernoulli trials. Candidate operations include SAM perturbation steps, Hessian-vector preconditioning, gradient clipping, EMA teacher refreshes, or an auxiliary MoE expert. The intended benefit is lower burst-induced gradient variance at the same average…
Use Oja's streaming eigenvector estimate on a parameter block's incoming gradient stream, but activate its rank-one preconditioning correction only after the mathematically predicted d log d sample threshold. Before that point, the estimate is treated as unreliable and the optimizer remains close to AdamW or SGD. This prevents early noisy spectral directions from destabilizing training while retaining an O(d)-memory alternative to storing a full gradient covariance matrix.
Build a variational quantum neural network whose trainable 2-qubit Hamiltonian is projected into the Lee-Yang coupling cone and augmented by a uniform field term -h sum_i Z_i. The theorem certifies a nondegenerate ground state and a gap at least h/4, enabling imaginary-time state-preparation layers with predictable exponential suppression of excited-state error.
Represent selected activations, weights, or optimizer accumulators as four floating-point limbs and evaluate products through tensor-core matrix multiplications encoding limb convolution. Retain the convolution components during reductions and renormalize only at block boundaries, avoiding branch-heavy multi-double arithmetic inside every multiply-add.