Unverified
2026
Add a degree-conditioned neighborhood-profile penalty to a GNN so that its effective message-passing graph has a controlled hub-neighborhood trend. The regularizer can either target a rank-one null profile, where neighbor degree is approximately independent of root degree, or deliberately target a learned/reference logarithmic trend when preferential-attachment-like structure is useful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
When clients optimize the same publicly known pair of losses but have private trade-offs, protect only the ratio of objective weights rather than the complete weight vector. Communicate a ratio-conditioned mixed gradient or controller statistic, with sensitivity defined over bounded ratio changes. This can reduce the required privacy noise when common rescaling of all objective weights carries no meaningful private information.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a multiplicative renewal clock to decide when a neural module is updated, rather than updating at every wall-clock tick or using a fixed iteration schedule. The resulting computation allocates many updates early and increasingly long intervals between later updates, while preserving a tunable stochastic distribution of update times; this is intended for anytime recurrent refinement, continual learning, or adaptive inference where late updates have diminishing marginal value.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace the usual mean performance objective for a policy or predictor with a positive-margin CVaR objective over sampled deployment perturbations. The network is rewarded only when the mean of the worst perturbation tail remains above a chosen margin, which should suppress brittle solutions that perform well nominally but fail under a small subset of adverse conditions.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Select the coordinates of a sparse adapter or sparse fine-tuning mask using both Fisher width and inverse-Fisher width. The mask should avoid parameter subsets that are cheap in the Fisher geometry but extremely large in the inverse-Fisher geometry, or vice versa, thereby controlling both prediction sensitivity and estimator-like uncertainty.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary sign-gradient or fixed-range gradient quantization in distributed training with a non-adaptive one-bit refinement block. Workers generate all localization and multiscale residue bits using public randomness before the server knows the current aggregate gradient; after decoding a coarse center, the server chooses which stored phase and scale interpretation to use. This should reduce clipping and variance for heavy-tailed gradients without requiring a second communication round.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Model a checkpointed validation metric as a finite asymptotic expansion in known decay features, such as powers of training step, and estimate its limiting value using sliding least squares. Use a ridge-stabilized fit and require agreement across multiple windows before stopping, preventing the controller from reacting to transient non-asymptotic behavior.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Wrap a neural estimator with V leave-fold-out refits and use the dispersion of fold pseudo-values to produce uncertainty intervals without deriving an influence function or relying on unstable parameter-space Hessians. The same construction can be applied to scalar metrics, predictions at fixed inputs, dose-response curves, or vectors of logits and probabilities.
Useful6/10
Difficulty5/10
Novelty6/10
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
Treat the binary outputs of the hyperplane head as a noisy channel and decode with reliability-weighted likelihood rather than unweighted Hamming distance. Estimate each bit's flip probability on validation data and give unreliable hyperplanes less influence, while retaining the logarithmic code-length scaling.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use a transport map \(Q_\theta\) from a fixed latent reference distribution to a data distribution, but expose only its locally averaged version \(\bar Q_{\theta,\sigma}(z)=\mathbb E_{u\sim K_\sigma(\cdot-z)}Q_\theta(u)\). Latent-space mollification integrates the pole-type influence singularity instead of allowing one training sample near \(Q_\theta(z)\) to dominate the quantile feature or its gradient.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Augment diffusion score matching with a penalty on the exponential moment of the score residual, targeting the sub-Gaussian error regime identified as necessary for tractable sampling. This penalizes rare, catastrophic score errors much more strongly than an L2 loss and should improve robustness of reverse-time sampling in low-density regions.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a scalar feature or critic for oscillator-based neural dynamics that is invariant under the transformations imposed by free harmonic motion and elastic collisions. For finite-size rods, the module should represent only quantities compatible with common oscillator-phase rotations and momentum permutations, preventing a learned world model from inventing coordinate-dependent pseudo-conserved quantities that disappear after collisions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a statistical-complexity maximization term to attention rows or MoE routing distributions so that each probability vector is encouraged to contain a small dominant core and a nearly uniform low-probability halo. Unlike ordinary entropy regularization, this explicitly favors an intermediate concentration regime and predicts a two-level structure: one or a few large probabilities and all remaining probabilities close to one another. The regularizer should use a small coefficient because its…
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a data-dependent threshold for future cumulative safety violations using the paper's decision-centric large-deviation profile instead of a plug-in estimate. For binary violation increments, the threshold explicitly accounts for both uncertainty in the historical violation rate and the probability that the future process produces an unusually large maximum.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Require the calibrated state posterior to remain unchanged when evidence is presented through information-equivalent prompt templates. Compare state distributions after semantic aggregation rather than raw token probabilities, and add a total-variation consistency penalty during calibration or fine-tuning.
Useful6/10
Difficulty4/10
Novelty6/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
Choose the diffusion noise schedule to maximize the minimum DSM sensitivity to important distribution parameters, such as mixture weights. This should reduce mode amplification and improve recovery of rare modes without changing the score-network architecture.
Useful6/10
Difficulty6/10
Novelty7/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