✗ 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
Estimate the largest certified input perturbation radius for a neural network using nested reduced primal and dual linear programs rather than solving the complete verification LP immediately. The primal sequence gives certified feasible robustness reserves, while the dual sequence gives valid upper bounds; verification may stop as soon as the interval width is below a prescribed tolerance.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a neural policy together with a positive neural Lyapunov function so that the learned closed-loop transition decreases the function at every sampled state in a prescribed operating region. This converts policy learning from an unconstrained reward problem into a constrained dissipativity problem and provides an inference-time monitor that can reject or damp actions when the certificate is violated.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Represent a small neural state-update map or optimizer update by polynomial constraints and certify decrease of a polynomial Lyapunov function on the nonnegative activation or state region using successive Parrilo SOS levels. Use the monotone shift-threshold construction to distinguish genuine instability from failure of a weak certificate, and raise the SOS level only when necessary.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
For z neural branches that share a target, state, or routing observation, add a penalty on fluctuations in the branch direction visible to that shared signal. This implements the paper's centered-square conditioning mechanism: branches remain locally independent in hidden directions, while collective deviations that would produce inconsistent shared outputs are suppressed.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Predict a scalar excess free-energy functional of a complete density field and obtain the direct-correlation output by automatic differentiation, instead of independently predicting each output-site value. This enforces the integrability and reciprocity constraints of a thermodynamic force field and gives a Lyapunov-like scalar that can control iterative density inference.
Useful8/10
Difficulty6/10
Novelty7/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
Use the paper's self-normalized martingale bound to monitor cumulative stochastic gradient noise in covariance-whitened coordinates. Convert its time-uniform confidence boundary into a trust-region multiplier: retain the normal optimizer update while the observed noise is within the boundary, and shrink or clip the update after an exceedance.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Use interval outer enclosures and branch decomposition to detect all plausible fixed-point branches of an equilibrium network over an operating-domain box, instead of selecting whichever equilibrium a single initialization reaches. Penalize training configurations that produce unresolved or excessively wide equilibrium sets, and expose branch multiplicity as a measurable operating-regime signal.
Useful7/10
Difficulty6/10
Novelty8/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
Use a two-stage residual augmentation loop: first let a residual network explain model mismatch, then project its learned vector field onto a physically constrained candidate library and replace the flexible residual with the accepted sparse terms. This turns an unconstrained neural correction into a low-complexity dynamical law that is easier to roll out over long horizons and can expose unsupported hidden-state explanations.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Train a sequence model so that measured perturbation responses and spontaneous hidden-state correlations satisfy the paper's off-diagonal fluctuation–response identity. This discourages arbitrary non-reciprocal dynamics while preserving a controlled antisymmetric response that can encode directional temporal dependencies.
Useful7/10
Difficulty6/10
Novelty8/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
Use the degree-resolved phase-separation mechanism as a diagnostic and regularizer for graph and recurrent networks. Penalize unintended divergence between peripheral-node and hub representations, or deliberately preserve bounded divergence when heterogeneous specialization is useful.
Useful7/10
Difficulty4/10
Novelty8/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
Augment an RNN or state-space model with a region-valued latent state, such as an ellipsoid or polytope, rather than propagating only a point estimate. Train every transition to map the successor region inside the predecessor-compatible region with a positive margin; this creates a neural version of the paper’s nested coder and makes long-horizon predictions robust to small parameter and input perturbations. A point prediction is decoded from the intersection of the propagated regions, while…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add auxiliary constraint nodes generated from linear combinations of existing constraints, creating a new message-passing graph while preserving the original feasible error set. Use a neural BP layer on the augmented graph so auxiliary nodes provide alternate paths around harmful cycles without changing the target constraints.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the standard K-1 separate targeted robustness optimizations for a sample with one shared optimization whose scalar objective is the smallest correct-versus-target logit margin over every incorrect class. The same hidden-state relaxation and lifted SDP variables are shared across classes; only K-1 linear margin constraints remain. This should substantially reduce wall-clock time when K is large, while preserving the exact logical meaning of a full robustness certificate.
Useful7/10
Difficulty6/10
Novelty7/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
Construct a sparse radius graph over input samples or learned node embeddings, compute its cycle space, and remove the subspace generated by sufficiently short cycles. Feed the remaining quotient-cycle coordinates or Betti-rank estimate to a graph neural network as a global topological feature, or use them to guide pooling so that local redundant loops are collapsed while global loops are retained. The paper predicts that the threshold L approximately equal to |log r| graph hops is the critical…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed ridge coefficient in a neural network's final head with a controller driven by inverse spectral mass and hard-edge mass. The head can remain weakly regularized when the feature spectrum is healthy, but automatically increases ridge strength when small eigenvalues signal a high-risk interpolation regime.
Useful6/10
Difficulty4/10
Novelty5/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