Unverified
2026
Impose a screened pair-correlation dynamics on stochastic neural replicas so that correlation fluctuations relax locally instead of propagating across the entire representation. The key control knob is a learned or scheduled relaxation rate \(\mu_{FB}\), which predicts a measurable correlation length \(\xi_{FB}=\sqrt{D_{eff}/\mu_{FB}}\). This can be used as a locality regularizer for token representations, diffusion trajectories, or recurrent hidden states.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a dense unconstrained channel-mixing matrix with a differentiable product of exponentials of a few skew-symmetric generators and their iterated commutators. The resulting layer is exactly orthogonal, preserves feature norms, and can express rotations in directions not explicitly stored as independent parameters. This is especially suitable for residual MLP blocks, recurrent state transitions, and networks processing rotation- or pose-valued features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the generic nonlinear drift in a two-dimensional continuous-time recurrent cell by a learnable piecewise-linear Lienard restoring force. Fold breakpoints and jump breakpoints become explicit architectural controls for creating multiple oscillatory attractors, allowing hidden states to encode phase, mode, or periodic memory. Weak input coupling can select or perturb attractors while preserving the autonomous cycle structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use paired recurrent channels with exactly reciprocal gains while applying a common phase rotation. One channel carries a controlled expanding mode and the other a matching contracting mode, creating a tunable hyperbolic memory spectrum without the optimization fragility of an unconstrained recurrent matrix.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Represent an iterative neural computation as a controlled dynamical system and learn sparse residual corrections that are active only for a finite prefix of iterations. Estimate local stable and anti-stable subspaces of the hidden-state Jacobian, increase the correction horizon only while the anti-stable component exceeds a tolerance, and force later controls to zero. This produces adaptive-depth inference with a quantitative stopping criterion.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a learned dense recurrent transition with a truncated lowest-weight \(\mathrm{su}(1,1)\) ladder acting on hidden coordinates indexed by \(n=0,\ldots,N-1\). The ladder coefficients create a nonuniform, analytically specified coupling that grows with state index, while a negative \(J_0\) term supplies controllable dissipation and the skew combination \(J_+-J_-\) supplies conservative mixing.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained message-passing or recurrent propagation matrix by a directed-edge operator with non-backtracking connectivity and orientation-dependent turning phases, inspired by the Kac–Ward construction. During training, monitor and control the zero-momentum spectral gap of \(\mathcal A(0)=I-K(0)\), keeping the model near but on the stable side of the critical surface to obtain long memory without uncontrolled amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Initialize a stable diagonal state-space layer with decay rates \(\omega_i=|\xi_i|\), where \(\xi_i\sim\mathcal N(\mu,\sigma^2)\), instead of using a narrowly clustered rate distribution. The nonzero density of rates near zero creates a population of slow modes whose aggregate impulse response has an algebraic tail, enabling long-horizon memory while every finite-dimensional mode remains exponentially stable.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Generate memory slots or attention keys by applying learned unitary transformations to one seed vector instead of storing every slot independently. Select transformations sequentially when they add a sufficiently new direction and reject phase-equivalent or highly coherent candidates, targeting a well-conditioned near-Parseval frame.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the length-L learned convolution kernel in a causal sequence layer with K Laguerre basis functions, where K is much smaller than L and the basis parameter controls the decay time scale. The layer retains a long receptive field but learns only K coefficients, while FFT or a fixed state-space realization evaluates the resulting convolution efficiently. This is especially appropriate for audio, sensor streams, and long-context regression where the desired impulse response is smooth or…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Apply the paper's weighted nuclear elastic-net principle to the transition matrix of a recurrent or linear state-space layer. Penalize low-rank structure after whitening by the observed hidden-state covariance, while retaining a ridge term that prevents poorly excited state directions from producing unstable or arbitrarily large transition weights.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a bounded routing state to an RNN, state-space model, or mixture-of-experts layer, with several neutral fixed points representing persistent modes. The state moves between modes when far from a fixed point but escapes each mode only polynomially when close to it, creating controllable long memory without setting a linear eigenvalue arbitrarily close to one. A temperature parameter selects between an entropy-rich phase using many modes and a low-entropy phase concentrated near one preferred…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained recurrent transition with a second-order resonant state whose restoring matrix is full-rank but whose damping is low-rank. The low-rank damping creates a small set of rapidly controlled bright modes and a large dark subspace with long memory, while a small optional damping term prevents numerical drift in completely dark modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a sparse recurrent network with positive edge weights and Leaky-ReLU updates so that one selected hidden node, observed over a finite time window, contains enough information to reconstruct the full hidden state. Add an auxiliary decoder from the observed trajectory to the initial state or current state, and use graph rewiring or edge-growth until every hidden node has a directed path to the sensor within the observation horizon.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Construct a recurrent module with a phase variable and a transverse memory coordinate modeled on a perturbed twist map. Train the transverse state to lie on an invariant graph over the phase, while the phase follows an approximately irrational rigid rotation. A KAM-inspired graph correction and residual penalty should reduce long-horizon drift in recurrent prediction.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a generic recurrent update by a positive-state continuous-time cell whose interactions are restricted to a quadratic zero-one reaction-network motif with three state variables and six reactions. Select a motif known to possess three positive equilibria, then use the two stable equilibria as binary memory states and the intervening unstable equilibrium as the separatrix. This creates an explicitly multistable RNN module with a bounded attractor count and a measurable stability…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a stable diffusive state-space model with pair states formed from products of slow latent modes. Single modes represent ordinary long-wavelength diffusion, while pair modes represent the interacting hydrodynamic operators responsible for late-time tails in quartic observables. Use the pair states only for selected readout channels or a low-rank subset of mode pairs, preserving near-linear inference cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent state update by a locally parameterized invariant manifold h equals K of z, where the latent dynamics z at the next step equal R of z and preserve slow modes near a degenerate fixed point. Train the embedding and reduced map jointly with an invariance residual, while a weighted lattice norm discourages perturbations in distant channels or spatial sites from growing.
Useful6/10
Difficulty6/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
Replace a recurrent sequence classifier's unconstrained hidden-state alarm head with an online truncated-signature state and a first-hitting-time linear detector. The module summarizes local order information and cross-channel interactions while preserving exact compositional updates, making it suitable for long streaming sequences and early-exit decisions.
Useful6/10
Difficulty5/10
Novelty7/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
Replace a single recurrent state with two coupled one-dimensional latent chains whose relative alignment is periodically shifted during inference. Ferromagnetic coupling preserves locally coherent patterns, while controlled sliding produces a nonequilibrium friction effect that can make global magnetization substantially longer-lived than in a static noisy chain. The shift velocity acts as a measurable memory-control parameter rather than an unconstrained architectural hyperparameter.
Useful6/10
Difficulty6/10
Novelty8/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