✗ Failed on benchmark
2026
Replace independent residual-block parameters by a stationary correlated sequence and set the residual multiplier according to the sequence's long-memory exponent and Hermite rank. This preserves a nontrivial O(1) input-output transformation as depth grows, while avoiding activation explosion or identity collapse caused by inappropriate residual scaling.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Use the renewal Age of Information model to schedule refreshes from heterogeneous federated clients, sensors, retrieval indexes, or world-model observation streams. Sources with high downstream importance and reliable, cheap updates receive shorter refresh periods, while unreliable or expensive sources are refreshed less often. Pack the resulting requests into a non-overlapping communication schedule.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Add an interacting-multiple-model monitor to a recurrent or distributed neural training loop, with one state estimator for each candidate feedback delay. The monitor detects when gradients, hidden-state feedback, or parameter acknowledgements become stale, allowing the system to reduce the learning rate, discard delayed updates, or switch to a safe synchronous mode before delayed feedback destabilizes training.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a conditional-law head that maps a compact representation of an initial distribution and a shared-noise trajectory to a Gaussian mixture, then computes downstream predictions as analytic expectations under that mixture. This can replace expensive particle rollouts or particle pooling in stochastic world models and conditional diffusion systems while retaining multimodality.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the single global MoE capacity factor with expert-specific capacity reservations chosen from a small reliability menu. Experts with highly variable or operationally important token loads receive larger robust buffers, while predictable experts run closer to their mean load. This should reduce token dropping and padding waste simultaneously, especially under distribution shift or bursty routing.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Train an admission or MoE routing gate not only to reduce its immediate workload, but also to preserve the ordering between a controlled trajectory and a baseline trajectory under the same request stream. Penalize counterfactual events in which the controlled system, after initially rejecting work, later exceeds the baseline workload because its changed state causes a large job to be admitted.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a fixed distributed gradient-reduction topology with a topology selected from recent estimates of each shard's mean and variance. The selector minimizes the paper's predicted second-moment rounding cost, favoring shallow placement for high-variance coordinates and Huffman-like placement for unequal-variance blocks, while retaining the same number of additions and communication volume.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Construct a neural activation bottleneck by projecting hidden states into a fixed covariance-eigenbasis and retaining only the d largest-magnitude coordinates per sample. For Gaussian, decorrelated activations, the paper proves that adaptive top-d selection in the PCA basis has no greater expected residual energy than adaptive top-d selection after any other orthogonal rotation. This provides a principled alternative to learning an unrestricted rotation before sparsification.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Construct a finite-range, translation-equivariant recurrent convolutional module with an absorbing inactive state, then train its local dynamics so that seeded activity crosses coarse-grained space-time blocks with probability above an oriented-percolation threshold. This should produce reliable long-range propagation without dense global attention while remaining robust to non-monotone local updates and perturbations. Block statistics also provide a diagnostic for vanishing propagation or…
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a purely pairwise embedding similarity used for set alignment with a sum of rooted-tree contraction scores. Each tree feature aggregates products of several coordinate-level interactions and can preserve correspondence information under an unknown orthogonal transformation, allowing matching from moderate correlation rather than nearly identical embeddings. Use the resulting score matrix for Hungarian matching, contrastive loss, or a differentiable Sinkhorn assignment.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
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
✗ Failed on benchmark
2026
Replace the usual hand-designed expert-load penalty with a heterogeneous survival penalty derived from a susceptibility distribution. Each expert receives an availability factor q_e=G(A_e), where A_e is its cumulative recent routing pressure and G_e is a learned or fixed mixture of exponentials; highly used experts are suppressed smoothly, while heterogeneous experts can have different resistance to pressure. The mixture produces adaptive curvature and long-tailed penalties that may reduce…
Useful6/10
Difficulty4/10
Novelty6/10