✗ Failed on benchmark
2026
Replace pointwise spectral-norm contraction in a recurrent or state-space model with an average logarithmic contraction certificate for an input-conditioned fibre update. Let a base state carry expressive, possibly noncontractive dynamics, while an auxiliary latent fibre contracts on average. This should preserve useful variability in the base while preventing long-horizon fibre explosion and making the fibre converge to an input-dependent invariant section.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Equip a learned dynamics model with an adaptive parameter estimate and an explicit component-wise uncertainty box. Require a nominal backup-policy rollout to remain inside a safety margin equal to the rollout's worst-case parameter sensitivity, producing a conservative filter for reinforcement learning and world-model planning that becomes less conservative as the model identifies its parameters.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a standard recurrent update with a two-state absolute-value cell whose local dynamics are exactly piecewise affine. Train the coupling parameters while enforcing discrete-time Schur inequalities inside each activation quadrant, preventing exploding recurrent trajectories while retaining nonsmooth gating and richer dynamics than a globally contractive linear cell.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Partition a neural network into independently trained or independently monitored modules and constrain their cross-module interaction gain using a compositional contraction certificate. This enables stable deep modular MLPs, graph blocks, or recurrent modules without estimating the full network Jacobian, while providing an explicit coupling threshold for when the architecture loses contraction.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or state-space update with a block whose state Jacobian is contractive and whose input Jacobian has a controlled gain. This should make hidden-state discrepancies caused by initialization, quantization, or input noise decay geometrically rather than explode, while retaining a finite and predictable response to persistent input perturbations.
Useful8/10
Difficulty5/10
Novelty5/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
✗ Failed on benchmark
2026
Train a low-dimensional projection of embeddings against centered pairwise geometry instead of only using raw-distance preservation or a JL-style guarantee. The loss removes the population or minibatch distance baseline before comparing distances, forcing the bottleneck to retain the fluctuations that carry ranking and task information.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace independent feature, expert, or edge dropout by sampling subsets from a forest-induced strongly Rayleigh distribution. The distribution is multiaffine and negatively dependent, so selecting one computational route suppresses redundant correlated routes without the positive correlations created by independent or blockwise heuristics. Use the sampled subset as a structured mask during training and compare it against Bernoulli dropout at equal expected sparsity.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace ordinary row-softmax attention with a doubly stochastic Sinkhorn attention plan W, and periodically recover a gauge-fixed pairwise cost from W using the exact double-centering identity. Use this recovered cost to initialize or regularize a structured attention score, making the attention geometry identifiable despite arbitrary query and key row and column offsets.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
For sparse conditional supports, replace enumeration of all possible four-cycles with a graph-theoretic cycle basis. Construct the bipartite support graph, choose a spanning forest, and penalize one residual for each non-tree edge and its induced fundamental cycle. In log space, every other cycle constraint is a linear combination of these basis constraints, yielding a principled sparse regularizer.
Useful7/10
Difficulty5/10
Novelty8/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
Replace an unconstrained recurrent transition by a ring-coupled cubic vector field whose radial component drives hidden states toward a prescribed sphere. The angular component remains trainable and can encode information, while the radial Lyapunov dynamics suppress exploding and vanishing state norms during long rollouts.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a multi-input interaction by several single-input edge channels and enforce conservation only after their signed contributions are summed at the vertices. This provides a neural architecture for composite interactions in which different channels have different drivers, while preventing the node update from inventing or destroying net internal flow.
Useful7/10
Difficulty4/10
Novelty5/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
✗ Failed on benchmark
2026
Partition neural-network parameters into blocks and update each block using a stochastic proximal best response, followed by Krasnoselskii relaxation. The relaxation factor and minibatch size become explicit stability knobs: aggressive stochastic updates are damped, while larger batches are used when the estimated update variance approaches the mean-square stability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a recurrent update by a time-inhomogeneous random choice among candidate maps, and regulate the candidate Jacobian gains so that the expected product of gains contracts geometrically. This should make hidden-state distributions forget their initial state even when the map family and selection probabilities vary over time, improving long-horizon stability without requiring every individual candidate map to be strongly contractive.
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
△ 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
△ Mechanism confirmed, baseline not beaten
2026
Replace a neural-network penalty loss for differentiable equality constraints with a primal-dual update that solves one positive-definite linear system per step and then updates multipliers using the actual nonlinear constraint residual. Keep the penalty coefficient fixed instead of increasing it during training, reducing the usual penalty-conditioning tradeoff while directly controlling constraint violation.
Useful7/10
Difficulty6/10
Novelty6/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 neural transition to map a compact learned-state region strictly into its interior, creating a neural analogue of the paper's maximal attractor. Unlike simple spectral normalization, this permits a nontrivial invariant set and can preserve task-relevant recurrent dynamics while preventing long-horizon state escape.
Useful7/10
Difficulty5/10
Novelty7/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
Attach an SU(2) transport matrix to every directed edge of a graph neural network and penalize nontrivial plaquette holonomies instead of penalizing individual edge transformations. The regularizer is invariant to arbitrary local changes of latent representation frame, encouraging path-consistent relational features without requiring all edges to share one global coordinate system.
Useful7/10
Difficulty6/10
Novelty7/10