Unverified
2026
Add a deterministic torus phase to a recurrent or state-space model and average predictions over a quasi-periodic phase orbit using a frequency-aware normalized window instead of a uniform average. The window is chosen to attenuate Fourier modes near the orbit frequencies, transferring the paper's cancellation mechanism to reduce coherent long-horizon oscillation and bias without requiring a highly smooth predictor.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent the optimizer state or recurrent hidden state as an iterated map and estimate its natural invariant measure from a sliding-window occupation histogram or feature embedding. Use convergence of long-run observable averages and distances between successive empirical measures to detect whether training has entered a stable, periodic, or chaotic statistical regime, and optionally control the learning rate without forcing pointwise convergence.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Treat periodic update bursts from distributed training workers or parameter blocks as oscillator phases, and use a shared adaptive compute or learning-rate cap to create deliberately phase-repulsive coupling. When aggregate demand is high, throttle workers currently near their compute peak and preferentially release workers in low-demand phases, spreading communication and gradient-update bursts instead of allowing them to lock together. The controller should be disabled or retuned when its…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Apply the paper's dynamic truncation rule to per-example gradient norms or activation magnitudes: at each update, retain or downweight only samples whose score is below a threshold proportional to the current mean score, while explicitly compensating for the resulting selection bias. This creates a controllable tail-removal process whose fixed point and sensitivity to score variance can be measured before committing to large experiments.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Represent every pairwise training interaction as a directed edge and edge-color the interaction graph. Use one color class, or a small set of colors, as a microbatch: because a color class is a matching, no data example participates in two pairwise terms within that microbatch. This removes within-batch gradient collisions and provides a graph-dependent estimate of how many dependent strata are being combined.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the usual inverse-eigenvalue weights in a low-rank feature-covariance preconditioner by inverse weights with an estimated isotropic floor subtracted. Retain only the top r eigendirections and require every corrected denominator to exceed a margin, preventing the shifted inverse from approaching a pole. This should undo systematic under-updating of predictive directions when many weak feature directions inflate the empirical covariance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add an entropy-Lyapunov consistency term to a recurrent or state-space model whose learned dynamics are intended to reproduce a chaotic invariant distribution. The regularizer targets the equality condition h_mu(f) = sum_i max(lambda_i, 0), while a dominated-splitting diagnostic determines whether the theorem assumptions are approximately plausible instead of blindly forcing equality.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent input or parameter uncertainty locally by a low-order polynomial expansion of the network output, and compute only task-relevant directional third- and fourth-order moments. Add a penalty that calibrates or controls projected skewness and kurtosis, allowing the model to represent bent or elongated confidence regions without constructing a full dense moment tensor.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the conservation-law density to weight diffusion training examples by noise level instead of relying on uniform, cosine, or manually selected SNR weighting. This emphasizes noise regions whose local information contribution is largest while clipping the weights to prevent rare regions from destabilizing optimization.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a fixed ridge coefficient in a neural network's final head with a controller driven by inverse spectral mass and hard-edge mass. The head can remain weakly regularized when the feature spectrum is healthy, but automatically increases ridge strength when small eigenvalues signal a high-risk interpolation regime.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Train a neural dynamics predictor or policy output head against an empirical buffer of observed prediction-error scenarios rather than only nominal targets. For each input, require the predicted output plus every sampled residual trajectory to remain inside the admissible set, using an exact nonnegative slack penalty when robust feasibility is impossible. This should reduce rare but operationally important constraint violations while preserving nominal tracking accuracy.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's mean and variance dynamics to control exploration in a population of neural-network adapters. Estimate local reward curvature from the current candidates, then choose mutation strength so selection contracts diversity only when the reward landscape is locally reliable. Increase diffusion when reward noise or selection causes population collapse.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the usual unconstrained neural likelihood head with an unnormalized posterior potential that is linear in a learned coefficient vector over neural features. Optimize the exact partition-function-corrected posterior objective rather than only pointwise negative log-likelihood. This gives a globally convex final-layer problem and a positive-semidefinite covariance Hessian, reducing optimizer sensitivity and calibration failures.
Useful6/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Choose gradient clipping thresholds from an explicit worst-case tail probability implied by an observed kurtosis bound, rather than using a fixed norm threshold or an empirical percentile. For a standardized centered gradient coordinate, the threshold achieving target outlier probability \(\delta\) is obtained by analytically inverting the paper's sharp tail formula.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use the reciprocal arrangement as a probe of whether a learned representation has the intended angular response, and penalize deviations from the paper's universal beta distribution. This converts the theorem into a distribution-level regularizer rather than assuming that the reciprocal layer itself improves task loss.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the Gaussian approximation of a high-dimensional maximum to set a simultaneous coordinate-clipping threshold for minibatch gradients or activations. The threshold is sampled from a correlated Gaussian with the observed batch covariance, rather than treating coordinates as independent or estimating an unstable extreme quantile directly.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Monitor short histories from distributed training replicas and detect whether their fluctuations are independent or synchronized using pairwise correlations. Use the detected regime to switch learning rate, gradient accumulation, or communication policy: synchronized high-variance episodes can receive a smaller step, while independent episodes can use more aggressive updates. The detector intentionally uses pairwise correlation features instead of a raw-waveform neural classifier, making it…
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
For a neural module that forms causal or statistical ratios from minibatch covariances, replace raw denominator penalties and raw-scale uncertainty weights with a log-denominator or relative-error objective. The front-door covariance minor has variance proportional to its squared magnitude, so a small denominator is not intrinsically evidence of poor estimation under the Gaussian model. This should prevent the network from spuriously avoiding valid representations merely because their…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a weak regularizer that keeps categorical representations away from both uniformity and deterministic collapse by targeting an empirically selected information-variance level. Unlike entropy maximization, this objective does not reward the uniform distribution, because information-content variance is exactly zero at uniformity.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use a pressure objective to select expert-routing distributions by balancing task reward against route entropy, rather than optimizing task loss alone. The resulting router behaves like an equilibrium-state estimator: it should retain multiple high-performing branches when their combined entropy outweighs the advantage of a single branch.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use spatially correlated training points whose low-frequency structure factor vanishes instead of iid points. For neural fields, PINNs, image-coordinate MLPs, or spatially indexed minibatches, this should suppress long-wavelength quadrature and gradient-estimation noise while preserving the represented target dynamics. The finite-order prediction is that a design with structure factor S(k)=O(|k|^{2q}) produces lower variance for smooth losses than iid sampling, especially as the domain or batch…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
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
Unverified
2026
Add a learnable orthogonal rotation to a hidden representation and train it to make every channel projection have a small ψ2/L2 ratio. Unlike variance normalization, this explicitly suppresses directions with unusually heavy empirical tails while preserving the total quadratic energy of the representation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize the eigenvalue spectrum of a neural representation or attention Gram matrix using the paper's universal-kernel spread-complexity curve. The loss penalizes spectral profiles that exhibit excessive level clustering or near-degeneracy, while allowing the desired amount of eigenvalue repulsion to be selected by a GOE-like, Poisson-like, or empirically calibrated target.
Useful5/10
Difficulty5/10
Novelty7/10