Training ideas

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

✗ Failed on benchmark 2026

Finite-Excitation Latent Replay

Replace derivative-based latent-dynamics fitting with an integral regression and maintain a history stack selected by the smallest eigenvalue of its information matrix. The model should perform aggressive parameter updates only when the estimated latent regressors are sufficiently exciting, while a perturbation bound prevents false excitation caused by inaccurate hidden-state estimates.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Adaptive Observer of Nonlinear One-Sided Lipschitz Systems Using Estimated State Regressors With Finite Excitation arXiv:2608.30977
✗ 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

Integral Sparse Dynamics Training

Train a recurrent or neural-ODE state transition with an integral residual instead of matching noisy finite-difference derivatives. Enforce sparse regulator-to-state connectivity with group sparsity, so the model learns a compact dynamical mechanism while avoiding the severe variance amplification caused by estimating derivatives from sampled data.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Decoding Gene Regulatory Networks from Single-Cell RNA Velocity arXiv:2608.09722
✗ Failed on benchmark 2026

Analytic covariance initialization for switched state-space models

Use the paper's finite-dimensional second-moment equations to compute the stationary covariance induced by a Markov-switched recurrent layer before training, then whiten or scale each mode's hidden state using that covariance. This can prevent mode-specific saturation and eliminate a long burn-in period in long-context RNNs and state-space models.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Spectral Characterisation of Covariance Existence in Markov-Switching Affine Recurrences arXiv:2607.09994