✗ 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
✓✓ Beats tuned baseline
2026
Replace dense pairwise interactions between all forecast horizons with nested time-shell summaries. For sorted horizons, the readout at shell j receives a cumulative embedding of all coefficients or queries assigned to later horizons, reproducing the paper's dependence on products such as \(\Pi_j=\prod_{l>j}e^{\alpha_l}=e^{\sum_{l>j}\alpha_l}\). This gives an \(O(Kd)\) multi-horizon interaction instead of an \(O(K^2d)\) temporal attention block and should work best for weak-memory…
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
For coupled recurrent or state-space modules that represent oscillatory or periodic signals, explicitly account for communication or attention delay in the characteristic equation. Tune the coupling gain or add a phase-lead compensator so that the desired latent frequency remains a closed-loop mode instead of being shifted by small delays.
Useful7/10
Difficulty6/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
✓✓ Beats tuned baseline
2026
Estimate the leading complex resonances of the noise-averaged hidden-state dynamics of a stochastic RNN and use them to detect or control statistically persistent oscillations. The key design principle is to treat resonance radius and Lyapunov growth as independent signals: hidden trajectories can be Lyapunov-stable while the annealed dynamics still produce narrow-band ringing because a transfer-operator eigenvalue lies close to the unit circle.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a recurrent or state-space neural network in a sampled-data feedback loop: latent states evolve continuously or at every fine solver step, while a constrained optimizer updates the control, adapter, or residual-gating vector only every M steps. Between optimizer updates, use zero-order hold or linear interpolation and reject updates that violate a learned Lyapunov decrease condition. This should prevent large transient latent explosions caused by aggressive optimizer updates while…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a slow routing state and an intermediate hysteresis variable between a neural memory and its next-state selector. The hysteresis prevents small prediction fluctuations from repeatedly changing the active attractor, while the slower router learns transition probabilities independently of the attractor parameters.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a large diagonalizable recurrent or state-space transition operator by a sparse set of retained oscillatory modes selected according to their contribution to the output autocorrelation. Unlike magnitude-based pruning, the objective is to preserve the power-law return signal generated by pairwise spectral differences, enabling long memory with far fewer modes.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained linear recurrent update with a two-dimensional oscillator state per hidden feature and use amplitude-dependent damping: negative damping below a target radius and positive damping above it. The cell should preserve phase information over long sequences while preventing hidden-state explosion or collapse.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Penalize short positive feedback cycles in an iterative neural module by suppressing products of absolute Jacobian blocks around the cycle. This targets the mechanism responsible for exponential temperature sensitivity rather than merely penalizing the total Jacobian norm, allowing strong feed-forward paths while controlling recurrent amplification.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's localized truncation residual as an online certificate for whether the current polynomial lift is expressive enough. Start with a low-degree edge lift and activate additional degree blocks or a learned closure only when the residual exceeds a calibrated threshold, avoiding the cost and instability of always using a large polynomial dictionary.
Useful7/10
Difficulty4/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's stability-switching mechanism as a training and inference schedule: begin with a short or broadly distributed delay inside the stable region, then increase the mean delay or concentrate the kernel only when oscillatory or multistable dynamics are useful. The schedule is controlled by the predicted characteristic-root crossing rather than by training step count alone.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or state-space network together with a periodic hidden-state trajectory, then use the Fourier-domain Hill operator of its linearized dynamics to penalize positive Floquet growth rates. The method can retain algebraic hidden-state constraints, avoiding the inaccurate practice of treating a singular descriptor matrix as invertible.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Partition optimizer state space into regions and assign each region a different update rule, such as two learning rates, momentum values, or preconditioners. Fit the local radial normal form of the resulting piecewise-smooth training dynamics and switch to the branch whose first nonzero coefficient predicts contraction toward the stationary point.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace repeated iterations of an expensive high-dimensional update S with iterations of a lower-dimensional latent map T, then decode the resulting latent state with D. Train E, D, and T with explicit intertwining losses so that encoding a full update agrees with updating the latent state, and decoding a latent update agrees with applying the original update.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a stationary optimizer by a periodic two- or multi-phase schedule, such as alternating large and small learning rates, SGD and momentum, or gradients from different loss components. Stability is assessed over the complete period using the product of phase-wise linearized update maps, allowing a phase that is individually expansive to be safely combined with a contracting phase.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use small-gain diagnostics to jointly learn module normalization and a communication partition rather than imposing a fixed global spectral constraint. Clusters should be formed around high-gain feedback loops, because grouping weakly related modules cannot improve the certificate and only adds bookkeeping.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Grow a neural network by appending a trainable block together with an analytically initialized inverse block, so the newly added depth is exactly the identity at insertion time. After insertion, untie and optimize the two blocks independently; this preserves the current function while providing additional trainable degrees of freedom. For architectures with one expensive mixing operation followed by cheap channelwise blocks, the same construction can increase depth without repeatedly paying for…
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Use the KS ratio to decide how many message-passing layers to execute per graph or per node, rather than selecting a fixed depth. In the subcritical regime, stop once the predicted remaining effect is below a tolerance; in the supercritical regime, continue until the observed logit change becomes small or a larger budget is reached.
Useful7/10
Difficulty5/10
Novelty5/10