Unverified
2026
Replace mean-only readout from a noisy recurrent or Langevin reservoir by concatenating empirical first, second, and fourth raw moments of each hidden coordinate. The second and fourth moments retain input-dependent width and tail information generated by nonlinear confinement, while multiple independently initialized reservoirs can be concatenated before the final linear classifier to preserve complementary features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Parameterize a recurrent or state-space layer by a matrix-valued Blaschke lift instead of an unconstrained transition matrix. The resulting causal filter is contractive for inputs inside the unit disk and energy-preserving on the unit circle, while its value at z=0 is a freely learned strict contraction.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment a recurrent cell with multiple hysteresis memory branches whose states remain unchanged while the input stays within a branch-specific radius, then move toward the current input only when that radius is exceeded. The resulting cell has explicit persistence and bounded state changes, giving it an inductive bias for temporal hysteresis and reducing the need for the network to learn long-term memory behavior from scratch.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a polynomial graph filter or repeated matrix multiplications in a graph neural network with a small rational filter evaluated at several shifts. Treat the incoming feature matrix as a block of probes rather than processing scalar probe vectors independently, allowing one set of shifted solves to expose multiple spectral directions simultaneously. The expected gain is higher approximation quality at the same number of operator applications, especially when the target filter has sharp or…
Useful6/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a conventional leaky recurrent update with a population of stochastic membrane potentials that evolve only while subthreshold, emit an event at threshold, undergo a delayed reset, and receive feedback from a filtered population firing rate. Add a shared noise source alongside independent neuron noise to regularize the layer while preserving coordinated population-level dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Add a slow latent two-state gate to a recurrent, state-space, or world-model network so that separate experts represent two qualitatively different dynamical regimes. Train the gate using the paper's two-state population and fluctuation mechanism rather than allowing an unconstrained softmax to average incompatible regimes. The model should allocate extra capacity near the gate's susceptibility peak, where regime uncertainty and forecast variance are predicted to be largest.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Augment a neural router with the age of its current expert or latent regime and use an age-dependent hazard to determine when switching is likely. Unlike ordinary token-wise softmax routing, the router can learn non-geometric residence times, suppressing unstable expert oscillations while still allowing rapid transitions when the current regime becomes inappropriate.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained input-conditioned recurrent transition with a bilinear latent update, so controls modulate a fixed linear latent dynamics matrix through low-rank state-input interactions. The resulting cell preserves the computational simplicity of linear propagation while representing multiplicative effects of actions that an additive control term cannot capture efficiently.
Useful6/10
Difficulty5/10
Novelty5/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
✗ Mechanism failed
2026
Represent each latent state as a Heisenberg-group element and replace Euclidean interpolation in an upsampling or recurrent transition block by a four-point horizontal refinement plus the exact central signed-area correction. The module preserves the geometry of noncommutative composition, allowing the central latent coordinate to encode path-dependent information that ordinary coordinate-wise interpolation discards.
Useful6/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Add a learned Riesz-transform branch that extracts normalized spatial gradients after diffusion by a positive parabolic operator. The diffusion branch carries smooth semantic content, while the Riesz branch represents boundaries, motion changes, and graph discontinuities. Resolvent smoothing makes the derivative branch less sensitive to feature noise than directly applying a finite difference.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Extract a small set of stable exponential modes from an observed neural sequence and use them to initialize a diagonal or block-diagonal state-space model. Hankel-pencil eigenvalues propose the modes, while persistence across shifts and contour margins reject modes caused by noise or a short-lived background.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use the paper's third-order phase-locked-loop equations as a recurrent neuron instead of a leaky integrate-and-fire unit. Emit a spike whenever the phase crosses a chosen threshold, allowing one state trajectory to represent both slow burst envelopes and fast within-burst oscillations.
Useful6/10
Difficulty5/10
Novelty7/10
✓ Mechanism works
2026
Replace unconstrained per-frequency recurrent dynamics in a Fourier neural operator or spectral state-space model with oscillators initialized from the plasma dispersion relation \(\omega_k=\sqrt{\underline{b}^{2}+|k|^{2}}\). Each Fourier mode first undergoes a norm-preserving rotation at its prescribed frequency, while a small learned residual and optional nonnegative damping account for task-specific dynamics. This should reduce phase drift and exploding or vanishing activations when modeling…
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a free-form order-dependent gate with a positive mixture of Mellin powers $(1+s)^{-a}$. This gives a small, interpretable module whose response across the order variable is automatically generated by a positive measure and therefore inherits complete monotonicity, log-convexity, and Hankel-moment structure.
Useful6/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.
Useful6/10
Difficulty5/10
Novelty7/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
Build a sparse recurrent graph-neural layer on a path-by-path, path-by-cycle, or cycle-by-cycle latent lattice using a skew-zero-forcing seed set and its forcing order as a causal update schedule. Only the currently forced target node is activated at each step, so a small number of anchor states can propagate through the complete lattice while retaining local connectivity and periodic-boundary structure. The exact seed-count formulas predict the minimum number of anchors required by the graph…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Regularize hidden-state trajectories so that their temporal statistics match the moments of an isotropic Haar-distributed state up to order k, while deliberately leaving moments above k unconstrained. Use k as a controllable mixing knob: k=1 or 2 suppresses drift and anisotropic variance, whereas larger k imposes stronger distributional invariance and may remove useful temporal information.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace an unrestricted GRU or attention-based history encoder with a fixed companion-form shift register driven by the current action and observation, followed by a learned nonlinear policy. The register stores a structured finite history, while a learned matrix or MLP readout maps that history to a control-relevant latent state. This should provide a cheaper and more interpretable memory mechanism for partially observed environments, especially when the relevant dynamics are approximately…
Useful5/10
Difficulty4/10
Novelty6/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
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
Replace unconstrained recurrent-state decay with a one-dimensional latent defect field whose states evolve by local diffusion and pair reactions. Defects can move over long distances and persist, while creation and removal occur only in pairs, giving the memory a structured cancellation mechanism that is potentially better suited to delayed-event and parity-like sequence dependencies than a standard GRU or diagonal SSM.
Useful5/10
Difficulty5/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