Unverified
2026
Construct a deep sequence model as a layered channel network with fixed random K-regular connections between neighboring depth layers, instead of dense or independently random weight matrices. Use norm-preserving edge normalization and a reversible residual update so that geometric randomness controls information transport while trainable nonlinear readouts provide task-specific computation. The architecture exposes a tunable crossover between quasi-one-dimensional ballistic or localized…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use normalized scheduling variables and explicitly cap the degree of their products in a neural LPV or mixture-of-dynamics model. Instead of allowing every multiplicative interaction between scheduling coordinates and past or future features, retain only monomials below a chosen degree threshold. This produces a controllable approximation knob between a purely linear model and a full lifted predictor, while avoiding unstable extrapolation caused by poorly scaled high-degree features.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a single graph or token-mixing operator with two coupled channels: an antisymmetric, coherence-preserving transport channel and a state-dependent dissipative diffusion channel. The local feature state controls the dissipative edge rates, so strongly occupied or conflicting regions are smoothed while weakly interacting regions retain rapid coherent propagation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Treat the hidden-state Jacobian of an RNN, SSM, or graph neural network as a directed matrix-weighted network and decompose repeated block couplings into scalar interaction layers. Use layer-specific structural controllability to select input, skip, reset, or readout channels that can reach all hidden dimensions, and reject architectures with structurally unreachable states before training.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense token or state-mixing matrix with an inverse-capacitance operator whose couplings decay with graph distance, while introducing trainable heterogeneous diagonal capacitances to break spatial symmetries. The layer is cheap because the capacitance matrix is sparse and banded, but its inverse produces global responses with controllable locality.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace one spatial convolution block by a recurrent Fourier-domain layer that couples every mode k to its opposite mode -k and gives the strongest amplification to a nonzero selected wave number k*. The layer crosses a controlled Turing-like instability at k* and uses cubic saturation to produce bounded structured features instead of unbounded activation growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Construct a recurrent or graph-neural layer on a finite state space with a known bijection T, such as a modular cat map, and use the diagonal resolvent gain (1 − α^kx)^−1 as a state-dependent self-return or memory coefficient. States on short periodic orbits receive larger amplification, while long-period states receive weaker amplification, producing deterministic localization without learned disorder.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Condition a temporal neural network on a tempo or dilation ratio through a homomorphism from multiplicative positive scales to additive latent shifts. A ratio composed from several scale changes then produces the sum of their learned effects, allowing interpolation and extrapolation to rates absent from training instead of using an independent embedding per rate.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Augment a causal sequence model with a small hierarchy of prefix summaries weighted by powers of the logarithmic rank of each preceding token. The summaries retain order-sensitive deviations from a baseline representation while costing O(KNd) for sequence length N, hierarchy width K, and hidden dimension d, instead of O(N^2d) dense attention.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a large stable linear state-space or recurrent layer by a lower-order balanced realization computed from frequency-targeted controllability and observability Gramians. Use generalized low-rank ADI with imaginary-axis shifts concentrated at frequencies that dominate the training data, then retain states associated with the largest approximate Hankel singular values. This should reduce recurrent inference cost while preserving the layer's input-output response in the selected frequency…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a shallow neural interpolation controller to a neural ODE or state-space model so one shared vector field matches prescribed derivatives at several anchor trajectories. At every control time, compute controller weights from a small linear system instead of learning all task-specific parameters by backpropagation.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a scalar feature or critic for oscillator-based neural dynamics that is invariant under the transformations imposed by free harmonic motion and elastic collisions. For finite-size rods, the module should represent only quantities compatible with common oscillator-phase rotations and momentum permutations, preventing a learned world model from inventing coordinate-dependent pseudo-conserved quantities that disappear after collisions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unsigned two-hop cyclic mixer by the paper's alternating signed circulant. The sign pattern preserves one-step and two-step interactions while reducing the exact spectral radius from 4 to 2√2, allowing a larger raw mixing coefficient under the same operator-norm stability constraint.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace or augment a residual neural layer with a Fourier-domain scale-selective flow containing a learned second-order term and a fourth-order stabilizer. The block permits controlled low-frequency amplification, as required by the KS infrared mechanism, while damping high-frequency feature noise and preventing unbounded spectral growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a learnable semigroup layer that evolves features according to a positive operator combining frequency damping and spatially varying confinement. Unlike isotropic Gaussian smoothing, the layer can damp selected frequencies differently along different axes and can suppress activations in learned spatial regions, while the positive-semigroup construction prevents amplification.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a parameter-heavy recurrent transition, or use this as a fallback, with a two-parameter nearest-neighbor successor blend in latent space. Given a query latent state, retrieve the closest state from an in-context trajectory and combine the query, the retrieved state, and its observed successor; this gives a zero-shot dynamical forecast with almost no trainable transition parameters.
Useful6/10
Difficulty4/10
Novelty5/10
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
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 purely recurrent or state-space history summary with two explicitly separated paths: a fixed-size state channel for compressed sequence mixing and a query-dependent indexed channel for exact or near-exact retrieval. Train a lightweight gate to invoke top-k retrieval only when the recurrent state has insufficient evidence for the current query, preserving near-constant cost on ordinary tokens while preventing catastrophic failures on long-range exact-recall tasks.
Useful6/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace the linear state transition in a small recurrent or state-space module by a circulant matrix acting on a vector over a finite field. The hidden state then has only finitely many possible values and follows an exactly periodic orbit after at most \(q^n\) states, eliminating numerical drift on modular-counting and symbolic-memory tasks. A learned real-valued encoder and decoder can surround the discrete core, while the transition itself is fixed, searched, or trained with a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a dense token-mixing matrix in a sequence model with a fixed or learnable SBP derivative operator D=P^{-1}Q. The discrete integration-by-parts identity makes the interior mixing energy-neutral or boundary-dissipative, reducing exploding activations in deep residual stacks while preserving directional information along the sequence.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a rational-like feature transformation with an auxiliary state y constrained by polynomial equations G(x,y)=0, and update x and y jointly along the tangent space of that constraint manifold. This creates residual blocks in which nonlinear feature identities remain consistent over many layers or time steps, reducing auxiliary-variable drift and potentially stabilizing rational activations and implicit recurrent dynamics.
Useful6/10
Difficulty5/10
Novelty8/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