Training ideas

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

✗ 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
✗ Failed on benchmark 2026

Mode-Aware Mask Schedule

Train masked predictors with an explicit mixture of high-visibility masks, low-visibility masks, and a small atom at the fully masked input. High-visibility masks preserve ordinary denoising quality, while low-visibility and fully masked examples force the network to learn global mode frequencies that are invisible when nearly all context is shown. Tune the low-visibility mass using unconditional-mode recovery as an auxiliary validation metric.

Useful7/10
Difficulty3/10
Novelty5/10
Paper: On the Identifiability of Masked Prediction: Mode Blindness and Mask Schedules arXiv:2608.01383
Unverified 2026

Sparse-Cost Temperature Calibration

Use a small set of known or trusted pairwise costs to estimate the effective entropic temperature of a Sinkhorn attention or mixture-of-experts routing layer directly from its observed transport plan. This provides a calibration controller that can detect over-concentrated routing and adjust epsilon without backpropagating through a costly temperature search.

Useful6/10
Difficulty4/10
Novelty8/10
Paper: An exact and fast solution of the inverse Regularized Optimal Transport problem arXiv:2609.01278
Unverified 2026

Parity-Copula High-Order Interaction Benchmark

Construct training and evaluation examples whose every (d-1)-variable marginal is exactly independent, but whose full d-variable distribution contains a parity interaction. This isolates genuine high-order reasoning from shortcuts based on pairwise or lower-order statistics and can expose whether attention or MLP architectures learn the intended interaction.

Useful6/10
Difficulty3/10
Novelty6/10
Paper: How far are $d$-dimensional copulas with uniform $(d-1)$-marginals from (total) independence? arXiv:2608.18286
Unverified 2026

Fano-Calibrated Multi-User Watermark Budget

Use the paper's attribution converse to calibrate watermark strength and sequence length for a registry of N users, rather than tuning detection and attribution thresholds independently. A dual controller allocates a per-token information and KL budget so that the learned key information approaches the minimum required for reliable attribution, avoiding both underpowered marks and unnecessarily visible perturbations.

Useful6/10
Difficulty4/10
Novelty6/10
Paper: Watermark Forensics for Generative Models: An Information-Theoretic Perspective arXiv:2607.13003
Unverified 2026

Entropy-Gated Surrogate Slopes

Adapt the slope of each spiking neuron's surrogate derivative using the normalized entropy of its block's attention distribution. High centered entropy uncertainty increases the slope, while low uncertainty decreases it, and a dead zone holds the default slope fixed for ordinary fluctuations. The adaptation exists only in backpropagation, so the forward spike function, parameter count, and inference cost remain unchanged.

Useful5/10
Difficulty4/10
Novelty5/10
Paper: SAGE: Surrogate-gradient Adaptation via Attention-Guided Entropy for Spiking Transformers arXiv:2608.13702