△ Mechanism confirmed, baseline not beaten
2026
Use the paper's localized truncation residual as an online certificate for whether the current polynomial lift is expressive enough. Start with a low-degree edge lift and activate additional degree blocks or a learned closure only when the residual exceeds a calibrated threshold, avoiding the cost and instability of always using a large polynomial dictionary.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or state-space network together with a periodic hidden-state trajectory, then use the Fourier-domain Hill operator of its linearized dynamics to penalize positive Floquet growth rates. The method can retain algebraic hidden-state constraints, avoiding the inaccurate practice of treating a singular descriptor matrix as invertible.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a stationary optimizer by a periodic two- or multi-phase schedule, such as alternating large and small learning rates, SGD and momentum, or gradients from different loss components. Stability is assessed over the complete period using the product of phase-wise linearized update maps, allowing a phase that is individually expansive to be safely combined with a contracting phase.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build an autoencoder whose decoder outputs a monotone quantile function rather than an unconstrained spatial field. The latent representation can be compressed with POD or a neural bottleneck in CDT space, while the decoder guarantees valid transport maps and therefore avoids negative densities, mass drift, and spurious oscillations common in unconstrained reduced-order neural decoders.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use small-gain diagnostics to jointly learn module normalization and a communication partition rather than imposing a fixed global spectral constraint. Clusters should be formed around high-gain feedback loops, because grouping weakly related modules cannot improve the certificate and only adds bookkeeping.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Grow a neural network by appending a trainable block together with an analytically initialized inverse block, so the newly added depth is exactly the identity at insertion time. After insertion, untie and optimize the two blocks independently; this preserves the current function while providing additional trainable degrees of freedom. For architectures with one expensive mixing operation followed by cheap channelwise blocks, the same construction can increase depth without repeatedly paying for…
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace raw molecular orientation vectors with local scalar features invariant under common three-dimensional rotations and the apolar transformation u_i -> -u_i. Feed these channels to a CNN autoencoder, VAE, or contrastive encoder so that configurations on the same physical symmetry orbit have identical inputs or latent codes. This should improve unsupervised phase discovery without supplying order-parameter labels.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace unconditional stochastic MGDA in a multi-task network with a regularity-gated update. Compute the conflict-avoidant simplex combination when the objective-gradient geometry is sufficiently regular, but use a fixed scalarization weight when the MGDA solution is near a degenerate simplex face or changes sharply between mini-batches. The gate targets the paper's distinction between 1/2-Hölder behavior in the worst case and Lipschitz behavior on regular subproblems.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Turn a path-complete graph into a stability regularizer for a recurrent or state-space neural network whose update can switch among M learned operators. Maintain a neural quadratic or positive scalar certificate V_alpha for each graph node and penalize every graph edge that violates contraction under its corresponding operator. The resulting architecture is designed to remain stable even when the mode sequence is arbitrary rather than generated by a trained gate.
Useful7/10
Difficulty6/10
Novelty8/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 confirmed, baseline not beaten
2026
Replace ordinary gradient descent or momentum with a discrete PI update whose integral gradient state is accumulated only while the gradient direction remains consistent. When the proportional gradient term changes sign, reset the integral state, preventing stale gradients from producing overshoot near minima or after sharp curvature changes.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent block with two coupled modules: a contractive perceptual estimator and an input-to-state-stable cognitive state transition. Spectral normalization and a controlled Euler residual step enforce a quantitative gain condition, preventing hidden-state explosion while retaining long memory when the contraction factor is chosen close to one.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace independent expert activation or ordinary softmax routing with an exact fixed-m external-field subset router. Parameterize expert weights by logits, use the subset covariance as the Fisher matrix, and precondition router gradients with its Moore-Penrose pseudoinverse on the sum-zero subspace. The paper's resistance bound supplies a data-dependent ceiling for pairwise logit updates, preventing unstable motion when some experts have low inclusion variance.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use a two-mode optimizer: a learned preconditioned update for normal training and a bounded contractive fallback when the learned update is predicted to increase a monitored energy. Use separate entry and exit thresholds so minibatch noise does not cause rapid switching.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a network head that independently predicts coupled physical source terms with a low-dimensional rate head followed by a fixed stoichiometric map. This makes conservation of total mass or other linear invariants exact by construction and leaves the network responsible only for learning the kinetics of admissible exchange channels.
Useful7/10
Difficulty3/10
Novelty6/10
✗ Failed on benchmark
2026
Build a periodic neural vector field \(f_\theta(x)\) whose Fourier coefficients are explicitly estimated, then penalize Fourier energy at modes nearly orthogonal to a desired drift direction \(\rho\). The penalty controls the small-denominator quantity used by the paper's contraction argument, producing a certificate that trajectories remain within bounded distance of \(\rho t\) over arbitrarily long horizons when the contraction margin is satisfied.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Train a matrix-valued neural layer under an exact or near-exact Stiefel constraint while using an l1 or row-group sparsity penalty. During early training, use manifold proximal-gradient steps to identify a stable nonzero support; once the support stops changing, switch to Newton-CG steps restricted to the smooth intersection of the Stiefel tangent space and the fixed-support subspace. This can reduce the number of optimizer iterations needed to obtain sparse, well-conditioned projections.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add an exact linear-constraint projection to the output solve of a neural operator or physics-informed model. The network produces an unconstrained prediction or coefficient vector, while a small constrained least-squares layer removes the component violating known conservation laws and separately penalizes residuals that cannot be enforced exactly.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural dynamical block whose hidden state contains differential variables and Lagrange multipliers, with a singular descriptor matrix enforcing constraints during propagation. This avoids the drift and ill-conditioning that can arise when exact constraints are represented only by a penalty term.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace repeated time-stepping of a stiff linear state-space block with a quadrature approximation to its inverse Laplace transform. The layer propagates a hidden state using a small set of complex shifted linear solves, which can be batched and reused across many time steps or parameter values.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Use a low-rank Tucker reconstruction as a structured backbone and quantize only its residual after an orthogonal rotation. The rotation preserves residual energy but redistributes it across coordinates, reducing dynamic-range imbalance and making 2- or 4-bit uniform quantization less damaging than direct quantization of the original KV tensor.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the extreme-eigenvector marginal test to decide whether a Kronecker preconditioner is condition-optimal, rather than blindly running expensive factor refinement. If the certificate fails, construct a low-cost factor correction from the mismatch between tensor marginals of the worst-conditioned spectral states and accept it only with a condition-number line search.
Useful7/10
Difficulty7/10
Novelty8/10