Training ideas

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

✗ Failed on benchmark 2026

TD-to-PDE Continuation Training

Train a neural value or latent-dynamics model with temporal-difference targets before enforcing a stiff differential-equation residual, and ramp the physics weight only after the critic has become predictive. For a stochastic dynamical model, the residual is computed using the infinitesimal generator, while terminal, safe, and failure boundary conditions are imposed through separate penalties.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Physics-informed Reinforcement Learning for Stochastic Reach-Avoid Analysis arXiv:2608.17117
△ Mechanism confirmed, baseline not beaten 2026

Lyapunov-Calibrated Multiplicative Noise

Use measured local Jacobian growth to set the variance of dropout, feature noise, or stochastic-depth perturbations, implementing the paper's fluctuation-response idea that multiplicative noise is tied to the positive scrambling or Lyapunov rate. The controller maintains a target growth regime instead of applying a fixed noise schedule throughout training. It predicts a stability transition when the estimated growth rate crosses zero and a variance-growth proportionality that can be tested…

Useful7/10
Difficulty4/10
Novelty6/10
Paper: Effective Field Theory of Operator Scrambling from Strong-to-Weak Symmetry Breaking arXiv:2607.24925
✗ Failed on benchmark 2026

Barrier-Controlled Basin Switching

Use a learned quasipotential barrier as feedback for optimizer noise and restart control. Increase stochasticity when training is trapped in a high-loss metastable basin and reduce it near a desirable basin, with switching thresholds determined by the estimated barrier rather than by a fixed patience schedule.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Stochastic Dynamics of the Two-Dimensional Low-to-High Transition System Driven by Multiplicative Noise arXiv:2607.23186
Unverified 2026

Local-complexity adaptive gradient clipping

Replace one global gradient-clipping threshold with an example- or parameter-block-specific threshold derived from the local metric complexity of its stochastic gradient process. High-complexity examples receive stronger clipping or downweighting, while locally simple examples retain more of their useful gradient signal.

Useful6/10
Difficulty6/10
Novelty5/10
Paper: Pointwise Majorization for sub-Weibull and Mixed Tail Processes with Applications in Quadratic Chaos and Ergodic Diffusions arXiv:2609.01576
△ Mechanism confirmed, baseline not beaten 2026

Transient-risk certificate for Langevin training

Attach a quantitative upper bound to the probability that noisy parameter updates enter a predefined unsafe region during training. Use the bound to select a minimum burn-in time or reduce Langevin noise once the transient term is small, preventing the failure mode in which the final stationary distribution is safe but the training trajectory temporarily swells into the unsafe set.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Avoiding unsafe sets when training with Langevin Dynamics arXiv:2607.07538
Unverified 2026

Finite-Population Binomial Rate Layer

Replace a deterministic population activation or router fraction by a finite-population random rate whose noise is derived from an explicit binomial transition law. The layer preserves the desired mean activation while injecting variance that decreases with population size, creating a controllable stochastic bottleneck rather than uncalibrated Gaussian noise.

Useful5/10
Difficulty3/10
Novelty5/10
Paper: Mechanistic bridges from receptors to whole-brain dynamics: mean-field reductions, validity domains, and computational trade-offs arXiv:2608.00306