✗ Failed on benchmark
2026
Replace a diagonal learning-rate or preconditioner matrix with a small full block matrix and communicate a worker's updated gradient or parameter only when its local state has drifted sufficiently from the last communicated state. Jointly select the block preconditioner and the largest safe trigger threshold using robust Lyapunov inequalities over several empirical Hessian or Gauss-Newton matrices. The expected gain is fewer synchronization events without the instability normally caused by…
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Add an online receptive-field expansion monitor to a graph neural network and use it to gate message-passing depth or invoke graph pooling. For a sampled node set F and propagation neighborhood K, continue fine-scale propagation only while the growth ratio |KF|/|F| is close to one; when it is persistently expansive, replace further propagation with pooling, local attention, or long-range skip messages. This transfers the paper's Følner-versus-paradoxical mechanism into an architecture-level…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Run multiple optimizer workers, neural-network branches, or expert replicas with delayed parameter messages, using diffusive coupling for agreement and a separately slowed local gradient vector field. The delay should preserve the collective descent direction to first order while multiplying its evolution speed by a predictable factor, allowing communication-delay robustness to be tested independently from ordinary stale-gradient behavior.
Useful7/10
Difficulty6/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
Add a response-spectrum monitor to recurrent, state-space, or deep-equilibrium networks by treating products of hidden features as composite observables. Estimate the full susceptibility and a bare susceptibility, reconstruct an irreducible interaction vertex, and damp the state update whenever the leading Bethe–Salpeter eigenvalue approaches one. This targets collective failure modes that ordinary single-feature Jacobian checks can miss.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace an unconstrained high-dimensional neural dynamical model with a low-dimensional latent chart whose image is trained to be an approximately invariant spectral submanifold. Tie the encoder, decoder, and latent vector field to a known symmetry representation, so symmetry-related states share parameters and reduced rollouts cannot violate the system's group action.
Useful7/10
Difficulty6/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
Use the paper's saddle-node sensitivity mechanism to decide which message-passing edges should be added, strengthened, or rejected. In a graph neural ODE, neural consensus layer, or recurrent graph block, estimate the critical coupling at which node representations become phase-locked or contractive, then prefer candidate edges whose predicted sensitivity lowers that threshold. This avoids the assumption that more connectivity always improves propagation and gives a topology-aware alternative…
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace unrestricted continuous batching with a fairness-constrained scheduler that only inserts a waiting request when its predicted decode footprint remains within a normalized distance of the longest request already in the batch. The fairness budget should be tuned away from the mathematically worst midpoint and validated against real arrival distributions, with the goal of reducing wasted max-driven decode work without falling back to inefficient one-request-at-a-time serving.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace fixed chunked-prefill settings in an LLM serving engine with a feedback controller that decreases the number of prompt tokens processed per scheduling quantum as GPU saturation or long-context load increases. The controller targets a high-quantile bound on the absolute GPU-power ramp while preserving the existing peak-power ceiling and measuring the resulting latency-throughput tradeoff.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Keep the empirically effective post-LMO sign update, but reject it whenever a fresh minibatch estimates that it is poorly aligned with the gradient. Fall back to the gradient-side error-feedback candidate in those cases. This converts the paper's constructive divergence warning into an inexpensive runtime safeguard rather than assuming that any sign placement is universally safe.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary graph message passing by diffusion over a simplicial complex or hypergraph, using incidence matrices to propagate information through nodes, edges, and higher-order faces. Mix the local higher-order walk with a teleportation operator so that the layer remains globally connected and avoids the slow mixing or oversmoothing caused by poorly connected complexes.
Useful7/10
Difficulty5/10
Novelty6/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 a neural sequence model's unconstrained multi-step latent rollout with a data-driven LPV predictor acting on a learned latent state. Build the predictor from Hankel matrices of past latent observations, inputs, and scheduling features, then use an LQ factorization to project the large data coefficient matrix into a fixed-dimensional coordinate system. The model preserves scheduling-conditioned dynamics while making rollout cost independent of the number of training trajectories.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Design distributed training workers so checkpoint service is anonymous: every active writer receives a throughput determined only by the current number of active writers, not by worker identity, age, or phase. For identical compute periods and checkpoint durations shorter than the period, this removes pairwise phase attraction and prevents deterministic checkpoint synchronization; controlled timing jitter can then be added when rapid phase mixing is desired.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct the sparse transition matrix and input projection of a recurrent or state-space layer so that every hidden-state row is covered by a matching in the controllability core. This prevents hidden directions from becoming unreachable from the input sequence, especially in multi-input systems and across a distribution of transition matrices or task conditions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Encode a continuous or sampled multivariate time series as degree-N log-signatures on m local intervals, choosing (m,N) to minimize the number of stored scalars under an explicit linear-CDE approximation budget. Unlike fixed-size temporal patches, the representation increases temporal resolution when the path is oscillatory and increases algebraic degree when the path is smooth but strongly nonlinear.
Useful7/10
Difficulty5/10
Novelty6/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
Use computable upper and lower error bounds to reject quantized-depth configurations that cannot reach the desired accuracy before training. The planner separates irreducible library mismatch from finite-depth synthesis, codebook metadata, and execution errors, then selects the smallest depth and metadata budget whose estimated bound passes the target.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a cheap shared multi-task probe briefly, extract one semantic embedding per task, and use density-based clustering to determine which tasks should share a neural trunk. After clustering, replace the globally shared trunk by one trunk per discovered cluster, with task heads remaining separate; this preserves cooperation among related tasks while isolating destructive task interactions.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace ordinary graph propagation by diffusion with a positive node-dependent mass matrix \(\mathbf V\), so high-volume nodes update slowly and low-volume nodes update rapidly. Use node volumes as fixed metadata, a function of degree, or learned positive gates; this makes the architecture sensitive to dynamical localization that degree-normalized GCNs cannot represent.
Useful7/10
Difficulty5/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 overlapping attention windows from a block design instead of using one dense sequence-by-sequence attention matrix. Every token appears in exactly $r$ windows and every token pair co-occurs in exactly $\lambda$ windows, giving uniform coverage and avoiding the uneven connectivity of arbitrary sparse masks.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a capacity-penalty-only MoE router with a nonnegative shadow price for each expert, capacity bucket, or hardware resource. Route each token using predicted utility minus the relevant price, while computing a decomposed optimistic objective that certifies how much utility remains above the feasible routed value.
Useful7/10
Difficulty4/10
Novelty5/10