✗ Mechanism failed
2026
Approximate the minibatch loss Hessian by a positive-semidefinite bulk curvature plus a small signed transverse correction, and treat only the correction with explicit negative-curvature steps. This imports the paper's observation that all unstable directions can be confined to a low-dimensional subspace, producing a curvature-aware optimizer whose step-size boundary is governed by a small matrix rather than the full Hessian.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Add a sensitivity-aware stability monitor and regularizer to an RNN, neural state-space model, or linearized sequence model. Instead of evaluating the model at many perturbed inputs or parameter settings, estimate how each perturbation changes the dominant eigenvalues of the local hidden-state Jacobian, then penalize perturbations predicted to push eigenvalues toward the unit circle. This should improve long-horizon behavior while identifying a quantitative perturbation radius at which…
Useful8/10
Difficulty6/10
Novelty7/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 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
Replace an unconstrained recurrent or state-space transition Jacobian by a passive Gram-like component plus a controlled non-reciprocal perturbation, and regularize the resulting resolvent norm. The goal is not merely to reduce eigenvalue magnitude: it is to suppress soft and highly non-normal modes whose transient amplification can destabilize long-horizon inference even when all eigenvalues appear stable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a single polynomial graph filter or dense inverse with a multiscale layer that applies unitary propagations at dyadic times and combines them according to the dyadic resolvent identity. For a symmetric graph operator, this implements a stable rational spectral filter that can selectively retain or suppress frequency bands while exposing logarithmic multiscale structure.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace magnitude-based channel or expert pruning with a subset-selection objective that maximizes the weakest direction in the candidates' activation span. Relax the binary mask to continuous gates, optimize an entropic soft minimum eigenvalue, and round the gates to retain a fixed number of channels or experts. This should preserve diverse representations and reduce redundant feature directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed Fourier or spectral resolution in a neural operator or sequence model with a data-adaptive spectral cutoff. Keep only modes whose estimated signal energy exceeds the noise-amplification and discretization floor implied by the available number of trajectories and samples per trajectory. This should reduce overfitting to high-frequency sensor noise and preserve accuracy when the same model is deployed at different sampling resolutions.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Use the diffusion graph's Dirichlet energy and almost-isometry inequalities to score whether a candidate minibatch preserves the low-frequency structure of losses, logits, or gradients over the dataset. Reject or augment batches that distort these quantities, producing a geometry-aware batch acceptance rule rather than relying only on random or loss-based sampling.
Useful6/10
Difficulty7/10
Novelty7/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