✗ Mechanism failed
2026
Train a latent state-space neural network so that its effective pole geometry remains consistent when identified by low-frequency moments and finite-window trajectories. Penalize disagreement between the two reductions, and penalize proximity to the oscillatory/non-oscillatory boundary, to reduce spurious ringing after distillation or context truncation.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace ordinary topology-sensitive message passing with scalar-gated aggregation followed by an explicit correction that aligns local node states with a graph-wide consensus component. The correction should make node embeddings less sensitive to line or edge removals while preserving local information needed for prediction. This is suitable for graph neural networks and graph-based world models exposed to changing graph sizes or sparsity patterns.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use the behavior-subspace gap as a trust-region constraint when applying a shared update to multiple recurrent modules or experts. A proposed common update is accepted only when post-update behavior subspaces remain close to their leader and their graph subspaces remain sufficiently transverse, preventing one shared optimizer step from destabilizing dynamically different members.
Useful7/10
Difficulty6/10
Novelty9/10
✗ Mechanism failed
2026
Add a resonance-estimation module to a recurrent network or state-space model and regularize the decay spectrum of its observable correlations. Instead of using eigenvalues of a small projected recurrent matrix as memory timescales, estimate dominant poles from multi-step correlations and a resolvent/Krylov fit, thereby remaining valid when projection eigenvalues are ill-conditioned or hidden resonances occur. The method is intended to preserve useful long memory while suppressing unstable or…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or state-space network as a locally linear dynamical system and select a small set of hidden-state or module coordinates that have unusually high leverage on a target output through a dominant unstable or weakly damped eigenmode. Use the ranking both for red-team targeted perturbations and for defense: penalize, prune, or damp selected coordinates so that target amplification is reduced without uniformly shrinking all recurrent dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Apply the paper's distance-to-stabilization concept to the Jacobian of a recurrent or state-space neural layer. Estimate the smallest channel-wise diagonal perturbation that makes the local hidden-state dynamics contractive, then penalize models whose estimated radius is below a target margin.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or equilibrium network as a feedback interconnection of heterogeneous blocks, certifying some blocks through induced-gain bounds and others through phase or sector bounds. This avoids imposing a uniformly small Lipschitz constant on all blocks: dissipative or strongly contractive blocks use gain certificates, while approximately skew, oscillatory, attention-like, or state-space blocks use phase certificates. The network is accepted only when the local certificates satisfy the…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Track the covariance of a small recurrent population state and regulate its effective gain before finite-size fluctuations diverge. The controller uses the covariance Jacobian eigenvalues from the paper, making the distance to criticality an explicit adaptive regularization signal for recurrent or state-space neural networks.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace unconstrained residual gains in a deep residual network or state-space model with cooperative, depth-dependent gains whose local ratios satisfy the paper's sufficient non-identical string-stability conditions. Each layer receives both its own state and a communicated predecessor feature, so perturbations from early layers are actively regulated rather than independently amplified through depth.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace fixed PCA-rank selection in a hidden layer with a renormalization-group-inspired gate over covariance eigenvalue bands. The gate retains modes whose effective quartic interaction remains unstable or strongly scale-dependent, while pruning bands that flow toward the Gaussian noise fixed point. Unlike top-eigenvalue truncation, this is designed for extensive-rank signal distributed throughout the bulk spectrum.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Make the observation-injection gain state dependent, increasing it only when the projected unobserved dynamics approach the Hurwitz boundary. This creates a feedback controller for latent drift while avoiding the observation-noise amplification caused by using a globally oversized gain.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Regularize a recurrent or state-space model using finite-time Lyapunov exponents of its actual hidden-state transition products. Penalize collapsed adjacent exponents while also controlling the largest exponent, encouraging several useful state directions instead of one dominant direction or universal contraction.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Add a two-sided cone-restricted spectral penalty to a recurrent or state-space model. Instead of estimating growth using a symmetric singular-value surrogate, jointly optimize a positive right vector and positive left vector in the extended quotient from the paper, targeting a real generalized eigenvalue of the learned non-selfadjoint transition operator.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Add a Gaussian KL-UOT-inspired covariance discrepancy to a neural representation loss, using ridge-logdet terms that remain finite when minibatch covariance matrices are rank deficient. Set the unbalanced penalty to \(\tau=\kappa p\), where \(p\) is the feature dimension and \(\kappa\) is tuned over a small logarithmic grid, rather than using a dimension-independent covariance penalty. This directly tests the paper's claim that high-dimensional sample-covariance noise has a critical penalty…
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the random or gradient-aligned perturbation in sharpness-aware minimization with a unit perturbation direction selected by a polynomial of the local Hessian. With \(\mathscr{P}(s)=(s-\rho)^2\), the direction converges toward Hessian eigenspaces whose eigenvalues are closest to the target curvature \(\rho\), allowing regularization of a chosen curvature band instead of indiscriminately penalizing only the sharpest direction.
Useful6/10
Difficulty6/10
Novelty7/10