Training ideas

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

✗ Mechanism failed 2026

Slow Contextual Worst-Case Curriculum

Add a slowly updated adversarial sampler over training contexts, domain shifts, perturbation levels, or task instances. The neural network trains normally on samples from the current mixture, while a contextual bandit increases probability on contexts with high recent validation loss or catastrophic constraint violation. Unlike static domain randomization, this curriculum explicitly targets current failure modes without changing the model architecture.

Useful8/10
Difficulty4/10
Novelty5/10
Paper: A Distributionally Robust Multi-agent Reinforcement Learning Framework for Intelligent Intersection Control arXiv:2607.09899
✗ Mechanism failed 2026

Two-level local/coarse GNN training

Partition a large graph into induced subgraphs and perform most parameter updates using only local subgraphs, interleaving them with inexpensive global updates on a randomly subsampled coarse graph. The coarse correction preserves information about cross-partition dependencies while reducing full-graph message passing and communication cost.

Useful8/10
Difficulty5/10
Novelty6/10
Paper: Two-level domain-decomposition AdaGrad method for scalable training of graph neural networks arXiv:2608.22575
✗ Mechanism failed 2026

Frozen-Diffusion Parametrix Preconditioner

Replace the raw HJB residual loss of a neural PDE solver with a parametrix-preconditioned fixed-point target. At each local space-time patch, analytically propagate terminal values and source terms through a Gaussian kernel whose covariance uses a frozen diffusion matrix, while asking the network to learn only the variable-coefficient correction. This should reduce the burden on the network to represent stiff high-frequency diffusion dynamics and improve short-horizon convergence.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Finite-Horizon Hamilton--Jacobi--Bellman Equations with State-Dependent Diffusion in Spectral Barron Spaces arXiv:2609.00529
✗ Mechanism failed 2026

Conformal Early-Rejection for Diffusion Architecture Search

Attach a calibrated risk monitor to intermediate diffusion states and terminate mutations that are likely to violate hard architecture or performance constraints before full decoding and training. This transfers the paper's separation between proposal generation and authoritative external evaluation into an early-stopping controller for expensive neural architecture trials.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: From Generation to Discovery: Diffusion Mutation Kernels for Circuit and Physical Design arXiv:2608.27649
✗ Mechanism failed 2026

Closure-Decorrelation Memory Scheduler

Choose the neural operator's input-history length from the measured correlation time of the unresolved closure signal produced by coarse-graining. This avoids under-memory, which causes systematic closure error, and over-memory, which increases attention cost and can destabilize training. The same diagnostic can drive adaptive memory truncation across physical regimes.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Flux-form spatiotemporal neural operators for coarse-grained dynamics of multiscale PDEs arXiv:2608.18148
✗ Mechanism failed 2026

Spectral-Abscissa Early-Warning Scheduler

Use critical-slowing-down statistics from the delayed dynamical system to detect when training approaches an oscillatory instability. Rising lag-one autocorrelation and variance, together with a recovery-rate estimate approaching zero, trigger a learning-rate or momentum reduction before loss divergence occurs.

Useful7/10
Difficulty3/10
Novelty5/10
Paper: An Idealized Delay-Differential Model of Scuba Diver Porpoising and Runaway Ascent arXiv:2608.14978