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

Input-Subspace Perturbation Learning

Replace full-dimensional node or weight perturbation with perturbations in an input-conditioned d-dimensional tangent subspace, where d is the input or feature dimension and is much smaller than the reservoir width or parameter count. Estimate the update using only scalar self-supervised losses from positive and negative perturbations, then map the low-dimensional update back to the trainable parameters.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Scalable Perturbation Learning for Online Self-Supervised Learning in Echo State Networks arXiv:2607.06079
△ Mechanism confirmed, baseline not beaten 2026

Greedy Singular-Value Delay Scheduler

Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: Stable Takens' Embedding Theorem for Non-Uniformly-Sampled Linear Systems arXiv:2608.14001
△ Mechanism confirmed, baseline not beaten 2026

Adaptive Ballistic-to-Diffusive Propagation Schedule

Use dephasing as a depth- or time-dependent control variable rather than a fixed regularizer: early layers retain coherent transport for feature discrimination, while later layers increase dephasing to eliminate unstable high-frequency oscillations. The schedule is selected from an observable spectral or correlation ratio, giving a falsifiable switch point instead of tuning noise blindly.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: Fermions on a 1D lattice: localized sources and sinks with dephasing arXiv:2607.22240
△ Mechanism confirmed, baseline not beaten 2026

Delay-Kernel Bifurcation Scheduler

Use the paper's stability-switching mechanism as a training and inference schedule: begin with a short or broadly distributed delay inside the stable region, then increase the mean delay or concentrate the kernel only when oscillatory or multistable dynamics are useful. The schedule is controlled by the predicted characteristic-root crossing rather than by training step count alone.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Macroscopic Multistability and Bifurcations in Theta-Neuron Networks with Distributed Delays arXiv:2607.17645
△ Mechanism confirmed, baseline not beaten 2026

Change-Gated Online Adaptation

Attach a CPDNet-like monitor to a sequential neural model and use its soft change probability to gate online parameter updates. The model should update little or not at all during nominal operation, but rapidly increase adaptation after residuals and internal features indicate a regime change, avoiding both stale parameters and continual self-training drift.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Change-Aware Self-Adaptive AI-Aided Kalman Filters With Neural Change Point Detection arXiv:2607.13387