✗ Failed on benchmark
2026
Attach a probabilistic reachable-set head to a neural world model so that long-horizon predictions produce both a mean trajectory and an uncertainty envelope. Train or calibrate the model using the probability that the predicted envelope intersects an unsafe region, allowing early-warning losses to penalize risk before an actual violation appears. The transferable signature is a predictable monotone increase in warning probability as the reachable set approaches or intersects a forbidden set.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a Markovian recurrent update with an MPS-valued temporal influence state that couples adjacent pairs of memory sites, mimicking the paper's CDU3 two-column construction. The hidden state retains structured correlations across multiple past time steps while computation remains linear in sequence length and polynomial in the bond dimension, rather than exponential in the memory horizon.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
When a neural state-space model has latent directions that are invisible under normal inputs, add a small structured carrier to the input or hidden-state update during selected training windows. The carrier changes local measurement and transition projections, analogous to the paper's carrier-dependent measurement and force projections, and can reveal modes that passive training leaves unconstrained.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add finite-horizon observability and reachability objectives to a recurrent or state-space neural model so that its latent modes are both inferable from outputs and influenceable by available inputs. This directly penalizes the failure mode identified in the paper: a large latent perturbation with nearly zero first-order output projection.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace ordinary gradient descent in a chosen approximately linear parameter block with gradient descent plus a controlled negative quadratic penalty, and stop before the unstable directions explode. The finite-time spectral filter can amplify well-supported directions while retaining shrinkage or limited exposure on weak directions, which is unavailable to a stable negative-ridge endpoint.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained latent ODE or recurrent update with Hamiltonian dynamics on a product of Euclidean coordinates and a Lie-algebra momentum. The momentum dynamics contain the explicit coadjoint term generated by the Lie-group structure constants, allowing the model to represent rotational or frame-dependent memory without learning this antisymmetric coupling from data.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Augment a neural recurrent or state-space model with an explicit slowly varying disturbance state that absorbs contact effects, friction, hysteresis, actuator mismatch, and other systematic residuals. The network predicts nominal dynamics, while the disturbance channel provides offset-free correction without forcing the main model to memorize every operating-condition-dependent bias.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Construct a robust covariance estimate of layer activations by replacing each feature with its empirical Gaussian normal score before eigendecomposition, then applying coordinate-wise nonlinear eigenvalue shrinkage rather than multiplying all eigenvalues by one scalar. Use the cleaned covariance to whiten activations or precondition updates to the associated linear layer. This targets unstable directions caused by small batches, heavy-tailed activations, and rare outliers while retaining…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Add a differentiable orientation-pooling layer after steerable filters or an orientation-bin expansion. It aggregates unoriented line evidence using doubled-angle vectors, so a feature at angle θ is identical to one at θ+π, while symmetric orientations cancel naturally instead of producing an arbitrary mean angle. Feed the network both the Cartesian order parameter and its magnitude-based confidence.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace ordinary graph propagation by diffusion with a positive node-dependent mass matrix \(\mathbf V\), so high-volume nodes update slowly and low-volume nodes update rapidly. Use node volumes as fixed metadata, a function of degree, or learned positive gates; this makes the architecture sensitive to dynamical localization that degree-normalized GCNs cannot represent.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a latent recurrent or state-space model with separate equilibrium and source-sink transition matrices instead of forcing one transition matrix to explain all latent dynamics. Use the equilibrium matrix for stationary occupancy and reversible statistics, and use a recycling matrix for directed hitting times, committors, and source-to-target flow; this should remove fixed-lag coarse-graining bias in latent world models.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace the raw DFA outer-product update with a damped left-right preconditioned update that whitens both presynaptic activity directions and local-error directions. The activity factor removes nuisance-dominated input anisotropy, while the error factor equalizes postsynaptic credit coordinates; separate damping prevents noisy error covariances from destabilizing training.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Construct overlapping attention windows from a block design instead of using one dense sequence-by-sequence attention matrix. Every token appears in exactly $r$ windows and every token pair co-occurs in exactly $\lambda$ windows, giving uniform coverage and avoiding the uneven connectivity of arbitrary sparse masks.
Useful7/10
Difficulty5/10
Novelty6/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
✗ 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
✗ Failed on benchmark
2026
Construct a neural activation bottleneck by projecting hidden states into a fixed covariance-eigenbasis and retaining only the d largest-magnitude coordinates per sample. For Gaussian, decorrelated activations, the paper proves that adaptive top-d selection in the PCA basis has no greater expected residual energy than adaptive top-d selection after any other orthogonal rotation. This provides a principled alternative to learning an unrestricted rotation before sparsification.
Useful7/10
Difficulty3/10
Novelty5/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
✗ Failed on benchmark
2026
Compress a transformer KV cache by selecting actual past tokens whose key or hidden-state columns form a stable basis for all cached tokens. Instead of retaining tokens with the largest attention scores or leverage scores independently, compute rank-revealing pivoting of the leading right-singular-vector matrix and retain its pivot columns, then evaluate attention using the representatives plus an optional low-cost residual correction.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's stable periodic orbits and border-collision transitions as an intentional memory mechanism in a recurrent module. Different input-dependent parameter settings can place the same cell in fixed-point, period-2, or higher-period regimes, allowing a compact state to encode discrete modes without allocating one separate neural attractor per mode.
Useful7/10
Difficulty7/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
✗ 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
✗ Failed on benchmark
2026
Train a neural surrogate to predict outputs in a source-domain ZCA-whitened space, then adapt to a shifted domain using only the shifted domain's output mean and covariance. At inference, transport the network prediction through the target covariance square root, yielding a weight-free correction that preserves output-coordinate semantics and can be applied to MLP, CNN, graph-NN, or transformer regressors.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Constrain each member of a wide recurrent or neural-ODE population to use the same time-dependent vector field whose spatial components generate a finite-dimensional Lie algebra. Store m fundamental trajectories and one fixed invariant label per node, then reconstruct every node state with the Lie-Scheffers superposition map instead of integrating all n states independently. The resulting layer has an exact md-dimensional dynamical core and should preserve the full network trajectory up to…
Useful7/10
Difficulty6/10
Novelty8/10