Unverified
2026
When the Schrödinger generator is learned, regularize its spectrum and eigenvectors so that the magnitude trajectory remains well-conditioned for recovering hidden complex states. Penalize small singular values of the squared-eigenvector matrix and near-colliding eigenvalue pair sums, preventing a learned dynamical layer from becoming spectrally invisible or phase-ambiguous.
Useful6/10
Difficulty6/10
Novelty7/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
Represent every predicted displacement and velocity as the sum of a prescribed boundary lift and a learned residual that is identically zero on the Dirichlet boundary. Feed the boundary velocity into the model through an explicit distributed-port feature and train an energy-balance residual so that the learned interior dynamics cannot inject arbitrary energy at the constrained boundary. This should eliminate boundary drift and reduce the burden on penalties or projection layers.
Useful6/10
Difficulty5/10
Novelty6/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
Insert a differentiable layer that enforces multiple affine consistency constraints by running several short strings of relaxed projections and averaging their outputs. Change the strings and weights across training steps, but impose bounded string length, positive averaging weights, and an almost-cyclic coverage rule so every constraint is revisited regularly. This creates an architecture-level analogue of dynamic string-averaging rather than applying one fixed projection order.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
For a learned recurrent or state-space model, estimate leading Koopman or transfer-operator modes and force their evaluations on a small set of latent states to be linearly independent. This transfers the paper's generic invertibility construction and discourages duplicated, weakly observable, or spectrally collapsed dynamical modes, potentially improving long-horizon prediction and interpretability.
Useful6/10
Difficulty6/10
Novelty8/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
Replace a single hidden state or a finite-order covariance/cumulant closure by an ensemble of independently propagated mean-field particles. The network output is reconstructed from particle averages, allowing bimodal and strongly non-Gaussian hidden-state distributions without explicitly evolving third- and higher-order tensors.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a learned latent transition not merely to fit one-step data, but to require only a small operator correction before its selected spectral modes become exact eigenmodes. The correction is a measurable backward error, so the regularizer penalizes models whose apparent eigenstructure is highly sensitive to noise or finite-sample error. At inference time, the correction norm can trigger conservative rollout or mode suppression.
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 standard recurrent update with a slow-fast oscillator whose fast hidden state is coupled across feature channels by a graph-Laplacian diffusion term. The slow-fast structure permits sharp transient transitions, while diffusion suppresses unstable disagreement modes and should make long unrolled computation less sensitive to initialization and perturbations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/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
Represent an attention or routing state as a symmetric projector or fixed-spectrum positive semidefinite matrix and refine it using the paper's double-bracket flow instead of unconstrained gradient steps. The update rotates the state toward a task-derived Hermitian cost matrix while preserving its eigenvalues, so rank, trace, and spectral diversity remain fixed by construction.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary momentum SGD with a two-state position/velocity update whose damping and gradient coupling are explicitly constrained by the discrete Schur-stability region identified for the paper's linearized PSO dynamics. Estimate a conservative local maximum curvature and choose the effective gradient step so that the largest Hessian mode remains inside the stability triangle, allowing more aggressive steps without the loss spikes commonly caused by momentum overshoot.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace fixed sparse masks with a stochastic birth-death process for neural connections or spatial units. A diffusing morphogen-like utility field controls where connections are added or removed, while a local simple-point test rejects removals or additions that would disconnect a layer or alter a prescribed computational topology. This creates an adaptive sparse architecture with a tunable compact-to-branched transition rather than unconstrained magnitude pruning.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the spectral time constant of a memory operator to decide when a sequence layer should retain state, refresh it, or bypass expensive long-memory computation. A mode with eigenvalue near one is treated as valuable long memory, while unstable modes are suppressed, yielding an adaptive-computation mechanism driven by operator dynamics rather than token magnitude alone.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a residual network with two coupled feature streams and deliberately non-reciprocal cross-stream interactions represented by a skew-symmetric coupling matrix. Decay the coupling strength with depth according to the RG picture of an irrelevant perturbation, allowing early layers to exploit rotational mixing while forcing deep layers toward reciprocal equilibrium-like dynamics. This should preserve transient expressivity without producing depth-dependent amplification or oscillatory…
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
Add a controlled periodic phase to an optimizer, then use a near-identity normal-form transform to remove rapidly oscillating gradient components instead of allowing them to perturb parameters directly. The optimizer follows averaged drift for non-resonant frequencies but explicitly preserves Fourier components near resonance, where they can create a secular update.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build an RNN from fast nonlinear units coupled through a spectrally contractive slow state. The fast component can generate rich transients, while the slow component has a provable absorbing radius because its linear recurrence contracts and its neural forcing is bounded. Cross-coupling strength is swept to detect the onset of expressive high-dimensional attractors without permitting state explosion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a deterministic torus phase to a recurrent or state-space model and average predictions over a quasi-periodic phase orbit using a frequency-aware normalized window instead of a uniform average. The window is chosen to attenuate Fourier modes near the orbit frequencies, transferring the paper's cancellation mechanism to reduce coherent long-horizon oscillation and bias without requiring a highly smooth predictor.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a slow meta-controller that governs an explicit neural-network reference, such as task weights, target-risk tradeoffs, exploration level, or an auxiliary-loss coefficient, while a fast optimizer trains the model under the current reference. The controller changes the reference only after delayed outcome evidence indicates mismatch, and should be disabled or accelerated when the evidence delay exceeds the environment's objective-drift timescale.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use BB1 for inexpensive curvature adaptation, but monitor the projective gradient state for the periodic behavior identified in the paper. When the normalized gradient and scalar step size approximately repeat after seven iterations, temporarily switch to BB2 or a damped gradient step to destroy the attracting cycle, then return to BB1.
Useful6/10
Difficulty5/10
Novelty7/10