Training ideas

Curricula, sampling schedules, pseudo-labeling and multi-task mixing, with the standard training recipe as the control.

△ Mechanism confirmed, baseline not beaten 2026

Matrix-Free Krylov Backpropagation Through Solver Layers

Turn an iterative optimization or equilibrium computation inside a neural network into a differentiable layer whose backward pass solves the implicit adjoint system with conjugate gradients or GMRES using only automatic-differentiation matrix-vector products. This avoids storing unrolled iterations and avoids explicit Hessian or Jacobian construction, enabling longer solver horizons and lower-memory implicit architectures.

Useful8/10
Difficulty6/10
Novelty5/10
Paper: PANDA: A Matrix-Free Differentiable NMPC Solver via Proximal Averaged Quasi-Newton with Adaptive Linesearch Algorithm arXiv:2608.16280
△ Mechanism confirmed, baseline not beaten 2026

Residual-Christoffel Collocation for Random-Feature PDE Networks

Replace uniform collocation for a fixed random-feature neural PDE solver with sampling from the leverage-score density of the operator-applied features. Whiten the retained residual feature space before solving for output coefficients, so the sampled least-squares matrix has an identity-like expected Gram rather than inheriting severe anisotropy from the differential operator. The same construction can be used for a linearized neural network by treating Jacobian features as the trial functions.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Residual-Christoffel Sampling for Random Feature Collocation of Linear PDEs arXiv:2607.13382
Unverified 2026

Nested Bandwidth Feature Curriculum

For bandlimited or progressively higher-frequency targets, construct a nested random Fourier layer whose frequency window grows according to the paper's bandwidth laws instead of sampling all frequencies from one fixed range. Train with a low-bandwidth subset first, then activate additional frequency blocks. This creates a mathematically motivated spectral curriculum and may reduce early optimization difficulty while preserving high-frequency accuracy.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Spectral Convergence of Random Feature Method in Multiple Dimensions arXiv:2609.03401
Unverified 2026

Order-Parameter Mode Activation Schedule

Use the paper's order-parameter dynamics to initialize spectral feature modes with deliberately separated activation times. This creates a controlled progressive-learning curriculum in which dominant modes become available first and weaker modes activate later, potentially reducing early gradient interference.

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Neural Quadratic Forms: A Unified Minimal Model for Sudden Learning and Scaling Laws arXiv:2608.13335
Unverified 2026

Pivot-safe discrete LU initialization

Initialize an invertible neural linear layer from a bounded discrete random matrix only after checking that every leading principal submatrix is nonsingular and that its LU growth factor is below a prescribed threshold. This replaces blind random initialization with a cheap resampling rule designed to prevent zero pivots and excessive finite-precision amplification in reversible or flow-based networks.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: LU Factorization of Discrete Random Matrices arXiv:2608.08998