Unverified
2026
Augment a neural router with the age of its current expert or latent regime and use an age-dependent hazard to determine when switching is likely. Unlike ordinary token-wise softmax routing, the router can learn non-geometric residence times, suppressing unstable expert oscillations while still allowing rapid transitions when the current regime becomes inappropriate.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
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
Unverified
2026
Replace iid dropout or iid activation noise on spatial tokens with fluctuations generated by a conserved diffusing density. Each token receives a positive mass variable whose total mass is preserved, while Poissonian stochastic flux produces correlated perturbations that explore coherent local patterns rather than independently corrupting every feature. The density is autonomous and detached from autograd, so the regularizer adds little computational overhead.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
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
Unverified
2026
Replace a recurrent token-mixing operation with a finite-state carrier scan over binary or quantized token features. The local transition table is constrained to conserve a scalar token weight and to be bijective, making the mixer reversible, constant-memory, and less prone to activation drift than a generic recurrent layer.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Train a neural representation so that its affine acceptance or margin region has high probability under deliberately inflated Gaussian feature noise. The comparison theorem then transfers this guarantee to every centered Gaussian perturbation with a smaller covariance, as long as the inflated-covariance acceptance probability is at least one half. This provides a mathematically justified alternative to heuristic Gaussian noise augmentation for one-sided robustness.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the diffusion graph's Dirichlet energy and almost-isometry inequalities to score whether a candidate minibatch preserves the low-frequency structure of losses, logits, or gradients over the dataset. Reject or augment batches that distort these quantities, producing a geometry-aware batch acceptance rule rather than relying only on random or loss-based sampling.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Add a training-time regularizer that keeps the empirical joint covariance of hidden activations on multiple inputs close to the recursively predicted NNGP covariance. The regularizer targets the finite-width fluctuations quantified by the Wasserstein result, and is particularly appropriate for recurrent networks and attention blocks with shared weights, where hidden states at different positions or time steps are statistically coupled.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
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
Unverified
2026
Turn row dropout into an adversarial conditioning problem rather than independent Bernoulli noise. At each training step, search for a subset of surviving channels or measurements with unusually small least singular value, train the downstream network on that subset, and gradually increase the search strength so training directly exposes failure modes hidden by average-case dropout.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Regularize the end-to-end Jacobian singular-value distribution of a deep network toward the explicit free small-loss law generated by independently mixed projection-like layers. The target controls several gradient-spectrum moments, including the predicted fraction of nearly preserved directions, instead of controlling only the average gradient norm.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the first dense layer on q-ary categorical features by a Fourier interaction layer containing only monomials whose coordinate support is at most s. Use a Bohnenblust–Hille-inspired quasi-norm on coefficients, separately for each interaction order, to prevent a small number of high-order interactions from dominating the output. The resulting model has an explicit interaction-order knob and can be tested against a dense MLP at matched parameter count.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained scalar activation or nonnegative gate with a finite positive mixture of rational Bernstein basis functions. The learned function is monotone and concave on the nonnegative half-line, while its derivatives have controlled alternating signs; this can prevent pathological feature amplification and gives an interpretable shape prior. Use the paper's sharp exponent restriction τ≤1/2 rather than treating the power as an arbitrary hyperparameter.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
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
Compress a directed graph into a small set of landmark vertices while guaranteeing that every node receives a distinct restricted adjacency signature. Use these signatures as structural positional features and as the only graph-to-token interface for a graph transformer, reducing landmark-mediated connectivity from O(n^2) to O(ns).
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace repeated full-curvature factorizations when evaluating many Bayesian neural-network hyperparameter settings with one shared low-rank approximation of the data-induced precision update. Reuse the same curvature subspace while changing prior precision, observation-noise precision, or layerwise regularization, evaluating each candidate through a small rank-r matrix and Woodbury solves.
Useful6/10
Difficulty5/10
Novelty5/10
✓ Mechanism works
2026
Replace a flat MoE or graph-pooling assignment with recursive partitions selected by interaction evidence after removing each item’s expected degree effect. Tokens, nodes, or examples that are frequently active for purely popularity-related reasons should not automatically form an expert or cluster. Recursion stops when a candidate split has nonpositive degree-corrected evidence, producing an adaptive hierarchy rather than a fixed number of equally sized groups.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a continuous scalar latent or probability with a stochastic count Y generated by Y|X=x ~ Binomial(n,x), and feed Y/n to the downstream network. Regularize the aggregate count distribution toward the beta-binomial distribution induced by the arcsine input X~Beta(1/2,1/2), while maximizing the mutual information carried by the count. This creates a compact discrete representation with an analytically specified, nonuniform prior that places more mass near the extreme counts without…
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace an unconstrained softmax gate over a finite set of neural experts with exponential weights whose temperature is chosen to satisfy the paper's explicit stability condition. The goal is to prevent low-temperature expert collapse while retaining the model-selection rate when the expert losses are bounded and strongly convex in the prediction.
Useful6/10
Difficulty4/10
Novelty3/10
✗ Mechanism failed
2026
Use the divergence's data-processing principle as a consistency objective between predictions before and after a stochastic augmentation or feature bottleneck. Penalize disagreement under transformations while retaining the asymmetric power-law weighting of the r-deformed divergence.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace cross-entropy or ordinary Renyi loss between a target distribution and a model distribution with the paper's r-deformed alpha-z divergence. The deformation parameter r provides a controllable power-law alternative to the logarithm, allowing experiments that emphasize hard, low-probability target events differently from standard log losses.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace ordinary one-token-to-one-expert or one-token-to-one-attention routing with a local latent subset router: a pooled observation can be explained by a compatible subset of tokens. Pairwise compatibility scores assign probability to subsets, and each token receives the marginal probability that it belongs to the selected subset. This should help when tokens represent overlapping objects, occluded entities, or multiple features that should be processed jointly.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a free-form order-dependent gate with a positive mixture of Mellin powers $(1+s)^{-a}$. This gives a small, interpretable module whose response across the order variable is automatically generated by a positive measure and therefore inherits complete monotonicity, log-convexity, and Hankel-moment structure.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Attach predictive distributions to successive information-update steps of a recurrent, state-space, iterative, or diffusion model and penalize violations of the measure-valued martingale condition. The model may become more certain as information arrives, but its later forecasts must not exhibit systematic conditional bias relative to earlier forecasts.
Useful6/10
Difficulty4/10
Novelty6/10