Unverified
2026
Replace an unconstrained recurrent transition with a two-dimensional damped rotation whose parameters are induced by a learnable circular reorientation distribution. The first Fourier mode controls both memory persistence and phase rotation, giving the network an interpretable oscillatory memory while guaranteeing contraction when the effective decay rate is positive.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace dense graph self-attention with two parallel branches: exact softmax attention only over graph neighbors and a global linear-attention branch that summarizes all nodes through feature-space statistics. A learned node-wise gate interpolates between the branches, allowing locally structured nodes to use sparse attention while retaining a global-information path.
Useful7/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace Muon's single momentum matrix with a weighted mixture of fast and slow relaxation modes. The fast mode tracks rapidly changing gradients while the slow mode preserves a longer-horizon direction; their mixture is semi-orthogonalized and applied as the matrix update.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Train a neural controller or learned dynamics model against a finite-horizon set-valued certificate rather than only sampled trajectories. Represent uncertain states and bounded disturbances with hybrid zonotopes, propagate them through affine dynamics and a piecewise-linear neural network, and penalize reachable-set violations and failure to contract into a terminal set. This turns rare worst-case failures into a directly optimized geometric objective.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or state-space network from heterogeneous dynamical modules and characterize each module through sampled frequency-response passivity and Davis–Wielandt shell bounds. Constrain inter-module coupling so that the composed frequency response retains a positive passivity margin, providing a model-based alternative to blindly shrinking all recurrent weights.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained neural ODE or recurrent update field with the negative gradient of a learned scalar energy \(E_\theta(z,t)\). The resulting hidden-state dynamics have an exact Lyapunov certificate: energy decreases continuously, bounded trajectories cannot exhibit nonstationary recurrence, and the Łojasiewicz mechanism predicts convergence to a single equilibrium rather than persistent oscillation or chaos.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Construct an efficient recurrent or state-space layer whose impulse response follows Mittag-Leffler relaxation instead of a single exponential. A bank of stable diagonal state channels approximates the long power-law tail, allowing the layer to retain information over widely separated timescales with only \(K\) states per feature.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace AdamW's single exponentially decaying second-moment accumulator with a small bank of accumulators whose combined impulse response approximates fractional relaxation. The resulting preconditioner remembers rare or old gradient directions with a power-law rather than geometric decay, which may improve optimization on nonstationary, sparse-gradient, or long-horizon problems.
Useful7/10
Difficulty4/10
Novelty6/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
✗ Mechanism failed
2026
Use a convex uncertainty region over latent item scores to select the next ranked-list query, rather than training separate pairwise preference predictors. Sort the centroid of the current region to obtain a proper ranking; every returned pairwise counterexample intersects the region with a halfspace and removes a constant fraction of its volume under the centroid-cut guarantee. This provides an active-learning procedure for preference models, reward models, or ranking heads that remains…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the forward-backward reversal error as an online reliability signal: save more checkpoints or increase the low-rank dimension only when reversing a block produces a large defect. This turns the paper's observations about chaotic low-rank trajectories and rank deficiency into an adaptive memory-versus-gradient-accuracy controller.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use componentwise Gauss--Hermite quadrature to compute the differential entropy of a Gaussian-mixture output head instead of estimating entropy with samples. This gives a low-variance, differentiable uncertainty regularizer for mixture-density networks, latent world models, or policies whose predictive distribution is multimodal.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a cheap graph or token-mixing operator by partitioning nodes into k blocks using the bottom nonconstant eigenvectors of P squared, then replacing dense pairwise mixing with conditional averaging inside each block followed by one baseline propagation step. Unlike ordinary spectral clustering, the bottom modes target partitions where block labels are rapidly destroyed by P, producing an aggressively mixing representation layer rather than a community-preserving pooling layer. The…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace Euclidean momentum for selected neural parameters with a mirror or Bregman update, while using the paper's accelerated Newton direction for the objective step. Entropy geometry is especially suitable for softmax MoE routers, while Euclidean or log-barrier geometries can be used for unconstrained or positive parameters.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an explicit attention step by an implicit Euler step that solves a proximal subproblem involving the Hopfield energy. The new state is evaluated inside the softmax self-consistently, which makes the method less sensitive to large step sizes and can prevent explicit attention from overshooting or tunneling between attraction basins.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace flat all-pairs attention with attention neighborhoods induced by a compatible tree over tokens, patches, nodes, or retrieved items. Retain exact or approximate attention inside nearby tree subtrees and add a path-monotonicity regularizer so semantically distant endpoints are not more similar than intervening tree neighbors.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Represent a rotation-dependent scalar or feature field by truncated Wigner-D coefficients and apply Lie derivatives, gradients, and divergence using fixed generator matrices in frequency space. This replaces noisy coordinate-space finite differences and gives an exactly band-limited rotational differential layer with predictable computational cost.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a recursive Bayesian state estimator to a neural sequence classifier. The network produces per-step emission likelihoods, while a persistent Markov transition model propagates beliefs between steps; when inputs are missing, marginalize the missing emission instead of replacing it with a sentinel or arbitrary imputation. This should suppress isolated logit oscillations and remain robust when missing data arrive in bursts.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a low-width network by repeatedly selecting a normalized neuron that is maximally correlated with the current residual, then refit all output coefficients jointly. This gives a constructive alternative to random initialization of all hidden units and exposes an empirical width-versus-error curve that can guide early stopping or architecture selection.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Augment Adam with a layerwise stability monitor based on the paper's normalized frozen stability parameter. Estimate each layer's local sharpness and reduce that layer's learning rate whenever c eta S divided by sqrt(v)+epsilon approaches or exceeds 2. This directly tests whether the one-dimensional edge-of-stability boundary is useful as a safety controller in practical neural-network training.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace full PSD self-attention with a pivoted Cholesky/Nyström approximation whose landmarks are sampled from the unexplained diagonal mass. Tokens with large residual self-similarity are more likely to become landmarks, so the rank budget is spent on difficult regions rather than uniformly selected tokens.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Build a label-free router for a finite library of neural operators by estimating one shared physical target response from an anchor prediction and using it to rank every candidate through inner products with candidate differences. The method avoids running a full residual-based diagnostic independently for every expert and can be used either to select the best expert or to form a corrected weighted combination.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Use the trajectory martingale decomposition to separate predictable training updates from genuinely unpredictable residual updates, then scale the residual according to its estimated response to future loss. The method targets stochastic or event-driven optimization with history-dependent samples and predicts that response-weighted residual energy, rather than total gradient variance, controls update noise and instability.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Treat hidden-state communication, stale activation caches, or asynchronous distributed updates as bounded delays and impose a delay-dependent Lyapunov–Krasovskii certificate on the recurrent Jacobian. The network is accepted only when an LMI is feasible for the measured or conservatively bounded delay, producing an explicit maximum-delay prediction rather than relying only on empirical stability.
Useful7/10
Difficulty7/10
Novelty7/10