✗ Failed on benchmark
2026
Add an observability objective to an RNN so that a finite trajectory of selected hidden coordinates preserves information about the initial hidden state. The regularizer maximizes the smallest singular value or log determinant of the finite-horizon observation Jacobian, counteracting ReLU activation masks that erase hidden-state directions.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use the paper's below-threshold bistability mechanism to distinguish local stability from actual recovery: a recurrent network may have a locally stable nominal state while a second stable state still captures trajectories. Add a perturbation-based basin test and retain stronger damping or reset actions until the network demonstrably returns to the desired branch, rather than disabling intervention immediately when the spectral threshold is restored.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace uniformly spaced history taps in a neural state-space encoder with a fixed or learned set of non-uniform delays. Regularize the resulting delay-observation matrix to have a large smallest singular value, which makes latent-state reconstruction less sensitive to irregular timestamps and observation noise. This is directly applicable to event-based data, missing timestamps, and systems with multiple time scales.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat multiplicative weight noise, quantization error, or structured parameter uncertainty in a recurrent or state-space layer as an i.i.d. random linear operator and explicitly control its second-moment growth. Add a differentiable penalty or projection based on the spectral radius of the Kronecker-lifted operator, so the network can tolerate stochastic perturbations without exploding hidden-state variance or collapsing useful memory.
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
✗ Failed on benchmark
2026
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an expensive nonlinear rollout of a recurrent or neural state-space model by a locally affine rollout whose Jacobian is evaluated once at the current state and then frozen over a short horizon. Use the resulting transition matrix as an explicit stability monitor and optionally penalize or clip its spectral radius, reducing exploding long-horizon predictions without forcing the entire nonlinear network to be globally contractive.
Useful7/10
Difficulty5/10
Novelty5/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 confirmed, baseline not beaten
2026
Constrain recurrent preactivations to remain nonnegative so that ReLU acts as the identity along realized trajectories. The hidden dynamics then admit a classical linear observability matrix, allowing principled hidden-coordinate selection and conditioning control instead of relying on potentially destructive activation masks.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
For a complex-valued recurrent or state-space layer, construct a positive envelope by replacing each factor matrix with its entrywise modulus. The envelope provably upper-bounds every entry of the complex product and therefore gives a cheap conservative estimate of worst-case amplification, while a learned phase-cancellation term can exploit complex interference without allowing unstable growth.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a deterministic graph propagation layer by a stable stochastic linearized latent dynamics whose frequency-resolved covariance matrix defines spectral bands. Train or initialize the graph operator so that a selected covariance band has a nonzero Chern number and remains separated by a measurable spectral gap, producing representations that are robust to local perturbations and can support boundary-localized responses.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Add a curvature-margin regularizer to a neural latent-state estimator or world model so that every initial-state direction is sufficiently constrained by the observation history and prior. The regularizer targets the smallest posterior-curvature eigenvalue, not total information, making the estimator resistant to systematic transition-model mismatch in poorly observed latent directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a local bifurcation monitor to a neural ODE, continuous-time RNN, or state-space model by computing the central determinant and central trace from characteristic invariants of the state Jacobian. Their directional derivatives along the zero-eigenvalue direction estimate the BT coefficients and predict whether the model is approaching a codimension-two transition, allowing training to avoid destructive criticality or intentionally preserve a useful long-memory regime.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Constrain a recurrent interaction matrix to a directed cycle, or initialize it near a cyclic block structure, and certify that the intended unstable or oscillatory mode survives independent gain perturbations. The cyclic topology makes the full network characteristic equation exactly reducible to one scalar loop equation. A robustness penalty can then preserve long-horizon oscillations under quantization, dropout-like gain errors, pruning, or hardware variation.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Treat the input- or minibatch-dependent Jacobians of a recurrent or state-space network as a random derivative cocycle, and regularize its second Lyapunov exponent away from the first while independently placing the top exponent in a target stable range. This transfers the paper's equivalence between quasi-irreducibility, projective contraction, and a vertical spectral gap into a measurable training objective and a long-horizon stability monitor.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace pointwise sequence reconstruction with reconstruction of overlapping past and future Hankel windows in a shared latent manifold. A first encoder compresses the delay-coordinate trajectory, while a second decoder or predictor reconstructs the future block from the latent state; training therefore penalizes representations that fit observations but do not preserve dynamical evolution.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a weighted reflection symmetry to an attention or graph-propagation matrix instead of requiring ordinary permutation equivariance. For paired positions or graph nodes related by an involution, penalize the failure of the propagation operator to commute with the weighted reflection; this makes all geometric multi-step propagations symmetry-compatible. The method is suitable for data with mirror, reversal, paired-agent, or left/right structure where the two sides have unequal importance…
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Make directed edge weights trainable while constraining optimization to remain away from eigenvalue collisions of the graph Laplacian. The network can learn task-specific interaction strengths while preserving a measurable diagonalizability margin and avoiding ill-conditioned modal dynamics.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Parameterize an entropic OT cost only in directions that can change the transport plan, removing row-plus-column potential directions that are invisible because of OT gauge invariance. Whiten the remaining feature coordinates using their empirical covariance, producing an OT layer whose identifiable parameters have substantially more uniform sensitivity.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the theta-SRG of each residual-block Jacobian to regularize its gain and phase spread, rather than constraining only its spectral norm. For an implicit or deeply unrolled residual network, maintain a positive distance between the SRG enclosure of the block composition and the critical feedback point -1, giving a directly testable invertibility margin for long-horizon propagation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the paper's explicit Hessian dependence on learned singular values to detect when a feature mode approaches a curvature transition, then adapt weight decay or learning rate before the mode destabilizes. This turns regularization from a static hyperparameter into feedback control based on mode-wise curvature and feature amplitude.
Useful7/10
Difficulty5/10
Novelty6/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