Training ideas

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

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

Phase-Aware Bias-Energy Trust Region

Use the envelope's phase transition to choose whether clipping should primarily control update energy or preserve the raw gradient and reduce clipping bias. In the energy-dominated regime, regulate the retained update energy; in the bias-dominated regime, regulate the removed-gradient residual and monitor rare outliers explicitly.

Useful7/10
Difficulty5/10
Novelty5/10
Paper: A Sharp Joint Bias-Energy Envelope for Radial Clipping arXiv:2608.18999
✓✓ Beats tuned baseline 2026

Constructive Two-View Gauge Initialization

Initialize latent coordinate-frame parameters analytically from two temporally separated neural predictions instead of starting joint optimization from arbitrary translation and orientation. This removes the continuous gauge before backpropagation and should prevent EKF-like or gradient-based failures caused by large yaw and position initialization errors.

Useful7/10
Difficulty4/10
Novelty8/10
Paper: Trajectory-Induced Self-Calibration for Hidden-Target Localization Through an Unknown-Pose Range-Bearing Relay arXiv:2608.09464
✓✓ Beats tuned baseline 2026

Laplacian-Coherence Graph Minibatches

Replace uniform node minibatches in a GNN with a coreset selected from a small random candidate set using local Laplacian-column coherence. Select nodes whose connectivity signatures are least redundant with already selected nodes, while retaining inverse-probability weights for unbiased loss estimates. This should improve coverage of weakly connected graph clusters and preserve smooth graph signals at the same batch size.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Scalable Graph Coreset Selection via Greedy Sampling arXiv:2607.27602
✓✓ Beats tuned baseline 2026

Spectral-Width Prethermal Training Schedule

Use the paper's lifetime law as a controller for training or rollout difficulty. Estimate the active perturbation bandwidth R of hidden states or forecast errors and reduce the residual gain, increase the dispersion order W, or inject controlled bandwidth whenever the estimated prethermal lifetime becomes too short.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: From stable periodic orbits to many-body chaos: doubly tunable prethermalization via engineering of an emergent band structure arXiv:2607.12355
✓✓ Beats tuned baseline 2026

Small-gain-certified surrogate controller

Train a neural controller as a uniformly accurate surrogate of a trusted but expensive controller, and use a measured small-gain condition to decide whether the surrogate is safe for closed-loop deployment. The approximation tolerance becomes an interpretable residual-state budget instead of an opaque validation metric.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Approximate Feedback Linearization for a Nonlinear Hyperbolic PDE Class -- Part II: Neural Operator arXiv:2607.04362