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
✓✓ Beats tuned baseline 2026

Jacobian-Free Short-Trace Backpropagation

Use a full primal-dual optimization solve in the forward pass, but backpropagate only through the last r iterations starting from a detached warm-start iterate. This avoids storing the full solver trajectory while preserving the forward solution, and provides a tunable bias-versus-memory tradeoff: r=0 is a cheap surrogate gradient, while increasing r should converge toward the implicit equilibrium gradient.

Useful8/10
Difficulty4/10
Novelty6/10
Paper: Truncated Differentiation Through Primal-Dual Solvers for Inverse Potential Mean-Field Games arXiv:2608.00217
△ Mechanism confirmed, baseline not beaten 2026

Compiled forward second-order jet residuals

Build a forward-mode second-order jet interpreter for the PINN and evaluate the entire PDE residual in one compiled graph. Each intermediate carries its value, first derivative, and Hessian with respect to the collocation coordinates, avoiding repeated nested reverse-mode autodiff calls for every residual component.

Useful8/10
Difficulty5/10
Novelty6/10
Paper: A user's guide to PINNs in geometric analysis: lessons from the asymptotic Plateau problem arXiv:2607.28733
✗ Mechanism failed 2026

Recorded-Mesh Neural ODE Backpropagation

Run an adaptive neural ODE solver once to determine accepted step sizes, then train using a regular fixed-length replay of those steps rather than differentiating through adaptive accept/reject logic. The replay can be fused across a batch of trajectories and differentiated with an ordinary reverse sweep, giving the exact discrete gradient of the replayed solver and predictable GPU work.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: GRADSOLVE: fast exact gradients for ODE ensembles on GPUs arXiv:2609.02876
✗ 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
Unverified 2026

Stochastic Operator Stability Monitor

Instrument selected neural-network operators with cheap stochastic perturbations and estimate how much their outputs change under finite-precision perturbations. Use the resulting per-operator score to identify unstable kernels and selectively switch them to FP32, compensated accumulation, or a stable reformulation instead of running the entire model at high precision.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Automated Numerical Stability Analysis of Deep Learning Operators arXiv:2607.25494