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
✗ Failed on benchmark 2026

Reversal-Defect Adaptive Rank and Checkpointing

Use the forward-backward reversal error as an online reliability signal: save more checkpoints or increase the low-rank dimension only when reversing a block produces a large defect. This turns the paper's observations about chaotic low-rank trajectories and rank deficiency into an adaptive memory-versus-gradient-accuracy controller.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: A Memory-Efficient Adjoint State Optimization Method Based on Time-Reversible Dynamical Low-Rank Approximation arXiv:2608.21545
✗ Failed on benchmark 2026

Marginal-Stability Disorder Schedule

Use the disorder-controlled stability boundary as a training schedule. Start with strong damping so optimization is well behaved, then reduce the damping margin toward zero to create long-lived oscillatory state memory after the network has learned useful representations.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Disorder induced time crystal in athermal random field Ising model with non-reciprocal interactions arXiv:2607.28781
Unverified 2026

p-Consensus Synchronization for Federated Replicas

Add asynchronous nonlinear consensus steps between local-SGD updates in a federated or decentralized system. Instead of averaging a participating client with all peers, replace one client parameter vector by the coordinatewise p-mean of neighboring replicas, allowing sparse communication and reduced sensitivity to atypical client models.

Useful5/10
Difficulty5/10
Novelty7/10
Paper: Consensus time for asynchronous $\ell^p$ relaxation: graph dependence arXiv:2609.03856