Unverified
2026
Parameterize a multi-channel two-dimensional convolutional operator through a learned filter bank B, then use the composed operator B*B as the layer response. Its Fourier response is positive semidefinite exactly at every spatial frequency, enabling stable smoothing or diffusion-like residual updates without frequency-grid penalty terms.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a cheap spectral gate to a state-space model or recurrent event detector that decides whether multi-step lookahead can change the threshold decision. If the learned threshold readout is approximately a nonnegative left eigenvector of the transition matrix, use the current state only; otherwise activate predictive heads and search over a small horizon. This avoids unnecessary rollout computation while preserving early-warning behavior in oscillatory or rotating dynamics.
Useful6/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace one deterministic residual update with a short cyclic composition of learned vector fields evaluated for randomized, short run times. Because finite compositions of noncommuting flows generate directional-derivative and Lie-bracket terms, changing the cycle order gives the network an explicit, low-cost way to learn drift directions that are unavailable from the individual vector fields alone.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent a time-dependent Hamiltonian system on the reduced state $(q,t,p_q)$ rather than on the redundant extended state $(q,t,p_q,p_t)$. A neural Hamiltonian section predicts one canonical representative of each affine cotangent fiber, while an optional symmetry loss enforces consistency under transformations that translate time.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a one-step recurrent update with a causal convolution over past affine innovations using an exponential-fractional kernel. Add mean reversion and calibrate the innovation amplitude so that activation mean and variance remain approximately invariant across sequence position while retaining long-range, power-law-like memory.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace or augment a low-dimensional recurrent transition with affine maps whose linear parts belong to a structured unipotent holonomy family, and train the cell so that positive accumulated translation produces a controlled projective attractor. This creates a measurable two-basin long-horizon behavior: hidden-state perturbation directions should align with a learned direction X or its antipode according to the sign of a scalar functional, rather than exhibiting unconstrained rotation or…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Insert a fixed reversible lattice shear into a residual network so successive blocks follow a structured monodromy orbit rather than using unrelated learned transformations. Apply the transformation to a small learned subspace of hidden channels while leaving the remaining channels unchanged. This creates deterministic phase-dependent feature mixing with no additional trainable parameters.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the fixed decay coefficient of a stochastic recurrent or state-space layer by an adaptive mean-reversion coefficient driven by the cumulative squared hidden-state energy. The controller approximates conditioning the latent trajectory on a small L2 norm: high-energy trajectories receive stronger restoring drift, whereas low-energy trajectories retain the base dynamics and noise.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Give a shared neural dynamical state multiple local readout operators, such as a site channel and a neighboring-pair channel, and measure their space-time responses separately. Add a loss that encourages each channel to have its own dominant propagation velocity while constraining every channel to remain inside a common maximum-speed cone. This transfers the paper's result that spectroscopic selection rules reveal complementary dynamical pathways that are invisible in a single response function.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a positivity-preserving fractional Schrödinger resolvent into a 1D neural sequence block. Given a nonnegative learned potential V, the layer transforms an input signal f using V^a(-Delta+V)^(-a)f, allowing the network to learn where to smooth or suppress features while retaining an L1 bound independent of the potential magnitude. Use a in (0,1] as a fixed hyperparameter or a clipped learned scalar.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a time-homogeneous recurrent update by a sequence of parameterized maps f_t, and regularize late-time pairs of updates to approximately commute: applying block f_t followed by f_r should agree with applying f_r followed by f_t. This should make long-horizon predictions robust to local time-step reorderings and schedule perturbations, while proximal statistics provide a diagnostic for whether trajectories repeatedly approach one another rather than diverging permanently.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Parameterize the time-dependent coefficients of a latent neural ODE in a Chebyshev system instead of an unconstrained neural network, and train the resulting Poincare residual to have a prescribed number of simple zeros. If the relevant Melnikov function belongs to a certified Chebyshev span, the model obtains an explicit upper bound on the number of isolated periodic latent trajectories and limits uncontrolled oscillatory behavior.
Useful5/10
Difficulty7/10
Novelty9/10
Unverified
2026
Apply the paper's augmented cusp-map construction to an implicit neural layer or recurrent equilibrium, treating selected weights, gains, or input statistics as bifurcation parameters. The scanner detects parameter values where an equilibrium loses uniqueness through a fold or cusp, allowing the model to avoid unstable regions or deliberately exploit controlled multistability. Unlike merely monitoring exploding gradients, it provides a local certificate based on residual size, inverse-Jacobian…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent a continuous-time neural dynamical system as a symbolic Markov chain over regions together with a positive learned roof function giving the time spent in each region. Weight local reconstruction and prediction errors by the predicted vector-field speed, following the paper's scaled Hölder coding relation, so that the model does not over-penalize arbitrarily small coordinate errors near equilibria. This produces a hybrid latent model with discrete long-range structure and continuous…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the determinant of the constrained Fourier system as a frequency-aware conditioning certificate. Frequencies close to the characteristic planes receive stronger Tikhonov damping or lower supervision weight, preventing a neural inverse solver from amplifying measurement noise in modes where analytic inversion is unstable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a spatiotemporal neural model with spectral penalties corresponding to several temporal-spatial scaling laws rather than using a single isotropic smoothness penalty. The model can remain spatially detailed while suppressing temporal oscillations, or learn the opposite preference when the data demand it.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Augment a hidden representation with positively homogeneous interaction features built from approximate eigenmodes of a linear layer. Fractional products of mode magnitudes and phases provide nonlinear channels whose transformation laws are inherited from the spectrum of the underlying operator, potentially representing oscillatory or multiplicative dynamics more compactly than a generic MLP.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace the linear state transition in a recurrent layer with a bank of odd-power modified Emden oscillators. The nonlinear terms provide state-dependent interactions while the paper's odd-q result preserves period T=2π/ω independently of amplitude, giving the model a stable internal phase clock for long sequences. External inputs should modulate the oscillator through a bounded forcing or readout gate rather than directly destroying the autonomous isochronous dynamics.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a learned causal mixing profile by a monotone profile followed by a prefix-average Hardy mixer. The monotonicity constraint makes the mixer provably non-degenerate in the BMO sense: localized variation in the profile cannot be reduced below a calibrated factor by prefix averaging. This is a cheap alternative to dense causal attention for tasks where importance or state profiles are expected to decay along sequence position.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Add a trajectory-level loss that matches the empirical distribution of consecutive velocity turning angles between observed and generated sequences. Because turning angles are unchanged by a common rotation of all coordinates, the model is forced to reproduce hidden anisotropic and temporally correlated motion without being given a fixed laboratory-frame orientation.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Equip a latent transition model with a near-identity polynomial coordinate transform that conjugates the nonlinear transition to a linear latent operator, at least locally around a reference state. Train the transform jointly with the dynamics using both the usual prediction loss and the paper's splitting/intertwining residual, so that multi-step prediction is performed partly in approximately linearised coordinates.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace or augment an exponential state-space memory branch with a causal convolution whose lag-j weight is exp(-lambda j) ell(j)/j. The 1/j boundary provides broad logarithmic memory, while lambda supplies an explicit finite memory scale and prevents uncontrolled accumulation from an untempered long-memory kernel.
Useful5/10
Difficulty5/10
Novelty5/10