✗ Mechanism failed
2026
Replace an unconstrained recurrent transition with two coupled channels: one contracts under forward iteration and the other contracts under inverse iteration. Enforcing this structure should prevent long-horizon amplification of state, numerical, and teacher-forcing perturbations while retaining nontrivial memory through the backward-stable channel.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent generator with a skew-adjoint block lift whose projected first channel implements a non-skew effective generator. The hidden state evolves unitarily in the enlarged space, preventing exponential norm blow-up, while the projection can express transient amplification, damping, and non-normal dynamics unavailable to a purely orthogonal recurrent matrix.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a scalar Zubov head to a neural ODE, state-space model, or recurrent world model and train it to be invariant under a discounted Koopman action. The head should be near one for trajectories attracted to the target equilibrium and near zero for states with large accumulated deviation, providing a long-horizon stability signal and an off-distribution failure detector.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace noisy pointwise derivative matching in a neural state-space model with a weak-form Koopman-generator residual. An encoder maps observations to latent observables, while a learned matrix generator propagates those observables. Integration by parts removes the need to differentiate noisy trajectories and provides a controllable noise-averaging mechanism.
Useful8/10
Difficulty5/10
Novelty7/10
✗ 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
△ Mechanism confirmed, baseline not beaten
2026
Replace full-dimensional node or weight perturbation with perturbations in an input-conditioned d-dimensional tangent subspace, where d is the input or feature dimension and is much smaller than the reservoir width or parameter count. Estimate the update using only scalar self-supervised losses from positive and negative perturbations, then map the low-dimensional update back to the trainable parameters.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a standard recurrent state update or finite-order SSM filter with a causal relative-history operator using a weakly singular kernel k(s)=s^{p-1}m(s), where 0<p<1. The resulting layer retains information over a power-law range of timescales and introduces tunable frequency-dependent phase and attenuation, while remaining implementable through a small bank of exponentially decaying states.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the naive pseudospectral evaluation of a quadratic neural-operator nonlinearity with a two-point split-form product. Use the entropy-stable (alpha, beta) = (1/3, 2/3) split as the default, or learn alpha under the consistency constraint alpha + beta = 1 while monitoring energy growth. The goal is to suppress weakly underresolved aliasing and prevent long-horizon rollout blow-up without full 2/3-rule zero-padding.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the standard diagonal or identity preconditioner used when solving an implicit neural layer with a coarse/fine Schur-complement preconditioner. The hidden state is decomposed into a low-dimensional coarse subspace and its orthogonal complement; the coarse interaction is solved accurately, while the fine block receives a damped approximate inverse. The method is especially suitable for deep equilibrium models, implicit MLPs, and Newton or quasi-Newton training of residual dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Use a convergent kernel approximation of the Zubov invariant as a trust-region monitor for a learned dynamics model. The estimated Zubov sublevel sets become an inference-time gate that rejects, shortens, or dampens transitions predicted to leave the learned attraction region.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace a dense mixing or attention matrix on tokens arranged on a Cartesian grid by a product of learned or fixed one-dimensional concentration operators. The layer applies one axis operator at a time, reducing parameter and compute cost while enforcing that the global operator is a positive contraction with controlled spectral leakage.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
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 scale-blind pooling or downsampling with a coarse-graining block that carries an explicit relevant scale variable \(\eta\) alongside the feature field. The block is constrained to represent features in the memory-retaining form \(h(\xi,\eta)=\eta^{\alpha}F(\xi/\eta^{\beta})\), allowing both feature amplitude and profile shape to depend on the scale inherited from the input or previous RG step.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent or state-space transition with a finite quadrature of completely monotone memory modes. Couple the visible state and memory states as adjoint operators, so their cross terms cancel in the energy derivative and the layer is contractive even when visible-state damping is zero.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Reparameterize a recurrent or state-space layer so that its hidden-state update contains an explicit stabilizing feedback controller, while the neural network learns only a residual control in the feedback coordinates. Choose K to reduce finite-horizon state-propagation amplification, suppressing exploding hidden states and gradients on long sequences.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace an unconstrained second-order residual or state-space block with a position-velocity system whose damping is the gradient or subgradient of a convex function. Compute the next state implicitly, so the damping cannot inject energy and the resulting layer is robust to large learned damping nonlinearities, nonsmooth activations, and long rollouts.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Construct a spatiotemporal neural block from localized functions of a learned parabolic operator instead of unrestricted attention or convolution. Use one filter for fine-scale diffusion and another for coarse-scale temporal aggregation, with the scale ratio controlling information propagation. The block should suppress distant interactions while still permitting long-range mixing through coarse filters.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Build a recurrent or state-space layer whose transition matrix depends on a scalar pooled from the current hidden state. Estimate the local derivative of the scalar closure and penalize feedback gains that approach the fold threshold, preventing abrupt branch changes and excessive sensitivity.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a neural controller as a uniformly accurate surrogate of a trusted but expensive controller, and use a measured small-gain condition to decide whether the surrogate is safe for closed-loop deployment. The approximation tolerance becomes an interpretable residual-state budget instead of an opaque validation metric.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unrestricted recurrent state with a current input-driven state coupled to a fading average of its own history. The memory coupling provides a distributed dissipative channel, while the recurrent Jacobian is constrained below a measurable contraction boundary. This creates a recurrent or state-space block whose long-horizon sensitivity can be tested against explicit characteristic roots.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use two bounded self-adjoint transition operators in a recurrent or state-space block and penalize their normalized Hilbert--Schmidt commutator. When the penalty is small, the paper guarantees that the pair is close to exactly commuting operators, suggesting a controlled path to a shared eigenbasis and cheaper coordinate-wise dynamics. Add an optional numerical repair step that projects the learned pair toward a simultaneously diagonalizable pair.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained Fourier-domain linear mixer with a bank of positive spectral kernels and a max-times erosion aggregator. For a nonnegative Fourier magnitude f, each kernel produces a quotient response f/psi_k and the layer takes the pointwise supremum over kernels, giving exact positive homogeneity and monotonicity. This is most suitable as a drop-in spectral mixing block in a CNN, vision transformer, or state-space model.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained spatial residual block by a discretized transport evolution whose generator is skew-adjoint. Symmetric channel matrices and divergence-free spatial coefficients make the continuous operator energy-preserving, while a matrix exponential or Cayley transform gives an exactly norm-preserving discrete layer.
Useful6/10
Difficulty5/10
Novelty6/10