✗ 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
Replace derivative-based latent-dynamics fitting with an integral regression and maintain a history stack selected by the smallest eigenvalue of its information matrix. The model should perform aggressive parameter updates only when the estimated latent regressors are sufficiently exciting, while a perturbation bound prevents false excitation caused by inaccurate hidden-state estimates.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add an observability objective to an RNN so that a finite trajectory of selected hidden coordinates preserves information about the initial hidden state. The regularizer maximizes the smallest singular value or log determinant of the finite-horizon observation Jacobian, counteracting ReLU activation masks that erase hidden-state directions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Split a learned transition model into a contractive nominal branch and a high-capacity excursion branch, and blend them using calibrated epistemic uncertainty. The nominal branch is used exclusively in the well-supported region, while the excursion branch is activated when the current latent state leaves that region, preventing flexible model errors from being recursively amplified during ordinary rollouts.
Useful8/10
Difficulty5/10
Novelty6/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
Replace ordinary modality-specific residual fusion with a switched observer whose latent correction depends on the currently available channel. The individual channels are allowed to be insufficient to reconstruct the latent state; stability is enforced over the full switching cycle, so complementary intermittent observations can jointly maintain a stable representation.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a conventional recurrent hidden state with a phase oscillator state whose stored memories are exponentially stable phase-locked configurations. Each memory has a coupling matrix or low-rank coupling parameter, while an external context selects which coupling landscape is active; this separates representation storage from sequence routing.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use an online estimate of the positive feedback gain among logits, routing probabilities, and representations to adjust the softmax temperature. Increase temperature when the estimated cyclic gain approaches the instability regime, preventing exponential amplification and router collapse without globally weakening all layers.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Insert an online errors-in-variables subspace estimator into a latent state-space neural network. A fixed recent window of encoder features and controls is used to estimate a noise-corrected low-dimensional state subspace and refit the latent transition and readout matrices, allowing the model to follow sensor degradation or changing operating conditions without replaying the entire dataset.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained linear recurrent or state-space memory with a finite-history recurrence whose coefficients are nonnegative and sum to one. The resulting companion transition is nonnegative and row-stochastic, guaranteeing spectral radius at most one while retaining a neutral constant-history mode at eigenvalue 1.
Useful8/10
Difficulty5/10
Novelty7/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
Model a residual network, recurrent update, or optimizer as a switched linearized system in which each layer type, token, data batch, or optimizer regime selects a matrix mode. Constrain the worst-case product growth over admissible switches, rather than merely constraining every individual Jacobian, so arbitrary mode sequences remain contractive.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Add a non-autoregressive continuation layer to an RNN, SSM, or world model that predicts a future trajectory by solving for coefficients of a library of past trajectory windows and reusing those coefficients on the corresponding future windows. Unlike nearest-neighbor retrieval, the coefficients interpolate across multiple behaviors and can generalize to unseen systems whose output-visible eigenvalues are represented in the library.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace unconstrained residual updates with blocks whose Jacobian is monitored through a Davis–Wielandt shell. The shell simultaneously measures directional dissipation and non-normal amplification, yielding a per-block step-size or residual-scale bound that is stronger than checking only the largest eigenvalue or spectral norm.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace uniform minibatch sampling by a fixed-size determinantal point process whose similarity matrix is a diffusion kernel on the training-data k-NN graph. The sampler repels nearby or redundant examples while preserving multiple diffusion modes, so a small batch should cover intrinsic data geometry and provide lower-variance estimates of losses and gradients.
Useful8/10
Difficulty6/10
Novelty5/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
Use the paper's certified-well geometry to turn continuous localization into a cheap grid proposal stage followed by fixed-step refinement. Threshold the projection-residual score on a coarse grid, then run a bandwidth-calibrated gradient map only from accepted points and merge converged duplicates. This avoids dense optimization from every possible coordinate and is suitable for neural slot or source heads that must return a variable number of continuous locations.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Replace random Fourier or random NTK features by a weighted deterministic quadrature rule for the kernel's feature integral. The resulting feature map uses the same linear-model interface as random features but can approximate the leading Gram-matrix eigenvalues substantially better at the same feature count, improving conditioning and reducing the width required for a target kernel approximation.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Use a spectral eigenvalue-counting function to bracket each target mode before neural optimization. The network then solves only within an interval containing exactly one eigenfrequency, preventing optimization from repeatedly collapsing to the lowest mode or jumping between modes.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a deterministic graph propagation layer by a stable stochastic linearized latent dynamics whose frequency-resolved covariance matrix defines spectral bands. Train or initialize the graph operator so that a selected covariance band has a nonzero Chern number and remains separated by a measurable spectral gap, producing representations that are robust to local perturbations and can support boundary-localized responses.
Useful7/10
Difficulty7/10
Novelty8/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
✗ Failed on benchmark
2026
Treat the input- or minibatch-dependent Jacobians of a recurrent or state-space network as a random derivative cocycle, and regularize its second Lyapunov exponent away from the first while independently placing the top exponent in a target stable range. This transfers the paper's equivalence between quasi-irreducibility, projective contraction, and a vertical spectral gap into a measurable training objective and a long-horizon stability monitor.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a fixed DPSS/prolate projection before an expensive neural block, retaining exactly the modes whose time-frequency concentration eigenvalues exceed a target threshold. Use the paper's tail-quantile formula to choose the projection rank from sequence length, effective bandwidth, and tolerated energy loss, then optionally learn a small correction in the retained coordinates. Unlike a Fourier truncation, the basis is optimized for simultaneous localization in the finite input window and the…
Useful7/10
Difficulty5/10
Novelty7/10