✗ Failed on benchmark
2026
Replace selected residual, recurrent, or state-space blocks by modules whose input-output Jacobians satisfy an IODP inequality throughout a prescribed activation domain. The constraint controls incremental amplification between two trajectories without requiring either trajectory to remain near one fixed equilibrium, so it should improve robustness to changing contexts and prevent exploding long-horizon sensitivities.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Build a neural ODE or invertible transformation whose primitive layers are flows of learned gradient vector fields, then synthesize non-gradient directions using short Lie-bracket commutator products. The paper's bounded-bracket-generation result predicts that restricted gradient primitives can approximate a much larger class of diffeomorphisms than a plain stack of gradient flows.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
Useful8/10
Difficulty6/10
Novelty7/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
✗ Failed on benchmark
2026
Use discovered infinitesimal generators to create small continuous transformations of hidden states and force a neural predictor to commute with those transformations. This converts symmetry discovery into self-supervised augmentation without prespecifying a group, canonical coordinates, or hand-designed equivariant layers.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace recurrence or nearest-neighbour analogue lookup with a learned delay-coordinate observer that continuously corrects a latent state using the current observation. Constrain the observer's closed-loop Jacobian or linear state matrix to have spectral radius below one, so prediction error contracts geometrically and required burn-in grows logarithmically with target accuracy.
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
For a recurrent or graph neural network with known local connectivity, estimate each node's local Jacobian row using only graph neighbors rather than all hidden coordinates. Use the resulting sparse Jacobian both to compute a contraction certificate and to regularize training toward dynamically local interactions, reducing estimator variance and the number of samples required for reliable stability decisions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained token mixer or feed-forward residual map with a feature-conditioned rational operator whose transfer matrix is positive real on the positive orthant. Apply it through a resolvent, rather than an additive residual, so that the accretivity certificate yields a nonexpansive implicit update and suppresses activation explosions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a conventional linear decoder in an autoencoder or latent state-space model with an explicit quadratic manifold decoder, allowing a small latent vector to represent curved and transport-like state trajectories. Add a dynamics-aware invariance loss that penalizes the discrepancy between the time derivative of the quadratic manifold and the neural dynamics evaluated on that manifold.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use predicted covariance reduction as a differentiable gate for selecting tokens, views, sensors, or retrieved demonstrations. The gate favors inputs with high expected information gain while accounting for acquisition cost, turning attention and data collection into active observability optimization.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct the sparse transition matrix and input projection of a recurrent or state-space layer so that every hidden-state row is covered by a matching in the controllability core. This prevents hidden directions from becoming unreachable from the input sequence, especially in multi-input systems and across a distribution of transition matrices or task conditions.
Useful7/10
Difficulty5/10
Novelty7/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 linear restoring drift in score-based sampling, latent dynamics, or stochastic regularization with a state-dependent nonlinear restoring term that is at least as contractive globally and more contractive away from the origin. This should reduce stationary variance without changing the worst-case local contraction certificate.
Useful7/10
Difficulty5/10
Novelty7/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
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
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
✗ Failed on benchmark
2026
Attach a model-free residual-dynamics observer to a neural multi-step forecaster. Instead of asking the network to relearn persistent periodic or autoregressive disturbances, maintain a Hankel dictionary of recent forecast errors and use ridge reconstruction to predict the next residual sequence online. Add the predicted residual to the network forecast with a confidence-dependent correction gain.
Useful6/10
Difficulty4/10
Novelty7/10