✗ Failed on benchmark
2026
Replace a Markovian recurrent update with an MPS-valued temporal influence state that couples adjacent pairs of memory sites, mimicking the paper's CDU3 two-column construction. The hidden state retains structured correlations across multiple past time steps while computation remains linear in sequence length and polynomial in the bond dimension, rather than exponential in the memory horizon.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a model-free critical-slowing-down monitor to hidden states, actions, residuals, or losses generated by a recurrent neural controller or state-space model. When the monitored dynamics show increasing variance and lag-one autocorrelation, reduce the controller gain or optimizer learning rate, increase damping, shorten the rollout horizon, or switch to a fallback policy before the neural system reaches an unstable regime.
Useful7/10
Difficulty4/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 unconstrained input perturbations or generic distribution shifts with a conditional adversarial generator whose samples remain on a prescribed generator manifold. For each context x, maximize downstream loss over generator parameters within a debiased Sinkhorn-divergence radius of the nominal conditional generator, then minimize predictor loss against the resulting worst-case samples.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's sharp sK approximately equal to 1 phase transition to choose between conservative Fejer averaging and higher-order polynomial filtering. When the local fixed-point spectrum is separated from eigenvalue 1, use a Jackson-type filter; near the critical regime, use the safe Fejer filter instead of unrestricted Anderson extrapolation.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
When a neural state-space model has latent directions that are invisible under normal inputs, add a small structured carrier to the input or hidden-state update during selected training windows. The carrier changes local measurement and transition projections, analogous to the paper's carrier-dependent measurement and force projections, and can reveal modes that passive training leaves unconstrained.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add finite-horizon observability and reachability objectives to a recurrent or state-space neural model so that its latent modes are both inferable from outputs and influenceable by available inputs. This directly penalizes the failure mode identified in the paper: a large latent perturbation with nearly zero first-order output projection.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Implement a momentum optimizer as a contact Hamiltonian splitting rather than as a direct Euler discretization. Introduce an auxiliary scalar contact state and compose exact kinetic, potential, and damping subflows; this produces a second-order conformal integrator whose modified contact energy should decay more reliably at moderately large learning rates.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use a learned quasipotential barrier as feedback for optimizer noise and restart control. Increase stochasticity when training is trapped in a high-loss metastable basin and reduce it near a desirable basin, with switching thresholds determined by the estimated barrier rather than by a fixed patience schedule.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary gradient descent in a chosen approximately linear parameter block with gradient descent plus a controlled negative quadratic penalty, and stop before the unstable directions explode. The finite-time spectral filter can amplify well-supported directions while retaining shrinkage or limited exposure on weak directions, which is unavailable to a stable negative-ridge endpoint.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained latent ODE or recurrent update with Hamiltonian dynamics on a product of Euclidean coordinates and a Lie-algebra momentum. The momentum dynamics contain the explicit coadjoint term generated by the Lie-group structure constants, allowing the model to represent rotational or frame-dependent memory without learning this antisymmetric coupling from data.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Attach uncertainty to neural value targets by estimating the empirical one-step Bellman perturbation and propagating it through the discounted closed-loop transition operator. Use the resulting uncertainty to downweight high-variance Bellman targets or regularize the critic toward conservative predictions, especially in offline or model-based reinforcement learning.
Useful7/10
Difficulty6/10
Novelty6/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
Augment a neural recurrent or state-space model with an explicit slowly varying disturbance state that absorbs contact effects, friction, hysteresis, actuator mismatch, and other systematic residuals. The network predicts nominal dynamics, while the disturbance channel provides offset-free correction without forcing the main model to memorize every operating-condition-dependent bias.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace deterministic LoRA importance scores with one-sided tests of whether each rank-one update has population contribution at least a user-selected threshold. Maintain empirical contribution samples during fine-tuning, estimate their uncertainty, and prune the components with the weakest statistical evidence while respecting the target rank budget. The method should avoid deleting components merely because their latest minibatch gradient was small.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct a robust covariance estimate of layer activations by replacing each feature with its empirical Gaussian normal score before eigendecomposition, then applying coordinate-wise nonlinear eigenvalue shrinkage rather than multiplying all eigenvalues by one scalar. Use the cleaned covariance to whiten activations or precondition updates to the associated linear layer. This targets unstable directions caused by small batches, heavy-tailed activations, and rare outliers while retaining…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Add a differentiable orientation-pooling layer after steerable filters or an orientation-bin expansion. It aggregates unoriented line evidence using doubled-angle vectors, so a feature at angle θ is identical to one at θ+π, while symmetric orientations cancel naturally instead of producing an arbitrary mean angle. Feed the network both the Cartesian order parameter and its magnitude-based confidence.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a neural-network optimizer's globally fixed learning-rate geometry with an adaptive quadratic trust region. At every update, construct a local curvature model, accept or reject the step using the ratio between realized and predicted loss decrease, and expand or contract the radius accordingly; the same controller should automatically become conservative in nonconvex regions and Newton-like near a well-conditioned minimum.
Useful7/10
Difficulty6/10
Novelty6/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
Train a latent recurrent or state-space model with separate equilibrium and source-sink transition matrices instead of forcing one transition matrix to explain all latent dynamics. Use the equilibrium matrix for stationary occupancy and reversible statistics, and use a recycling matrix for directed hitting times, committors, and source-to-target flow; this should remove fixed-lag coarse-graining bias in latent world models.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace independent Gaussian diffusion noise across sequence positions with a positive, persistent variance chain and conditionally Gaussian perturbations. This gives the denoiser exposure to heavy tails and volatility clustering without requiring a more expressive neural architecture; keep the denoiser blind to the realized variance when the goal is for generated samples to retain this structure.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the paper's finding that smooth approximations of a circular current limiter can generate spurious Hopf bifurcations to audit smooth bounded operations in optimizers and networks. Compare exact projection with a differentiable surrogate, continue both dynamics in clipping threshold or step size, and reject a surrogate if it introduces a unit-circle crossing absent from the exact map.
Useful7/10
Difficulty5/10
Novelty6/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
Replace the raw DFA outer-product update with a damped left-right preconditioned update that whitens both presynaptic activity directions and local-error directions. The activity factor removes nuisance-dominated input anisotropy, while the error factor equalizes postsynaptic credit coordinates; separate damping prevents noisy error covariances from destabilizing training.
Useful7/10
Difficulty5/10
Novelty5/10