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
Use SPINE's nested entropy profile on the singular values of each trainable weight matrix to discover spectral bands online, rather than choosing a fixed rank or a fixed number of learning-rate groups. Assign smaller step sizes or stronger decay to dominant singular-value bands and larger step sizes to weak bands, while updating the grouping only when the entropy-boundary signal is persistent.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent edge or pair-token features and propagate them with a convex mixture of two normalized channels: transitions through shared vertices and transitions through shared triangles. This preserves higher-order connectivity that an ordinary graph convolution loses, while the mixing coefficient q controls whether information follows pairwise support or genuine triangular structure.
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
Augment node features with eigenvectors corresponding to negative eigenvalues of the Bethe-Hessian H(t,G), rather than using only Laplacian or adjacency positional encodings. The diagonal D-I correction is designed for sparse, locally tree-like graphs and should suppress degree-fluctuation artifacts near the connectivity threshold. Feed the resulting coordinates to a GNN through a learned gate so the model can ignore them when they are uninformative.
Useful6/10
Difficulty5/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
Treat a small activation, gradient, or parameter perturbation as a seed and measure the number of newly affected downstream units or layers. Use the estimated branching ratio to control the optimizer step size or residual gains, keeping training in a subcritical regime where perturbation cascades have finite expected size instead of amplifying through the whole network.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a raw minibatch gradient with an unbiased control-variate estimator that subtracts predictable components of per-example gradients and adds back their exactly or cheaply known population mean. Select the control-variate directions using leading eigenvectors of an online covariance operator, rather than using arbitrary scalar baselines. This should reduce gradient variance at fixed batch size and permit fewer examples per optimization step.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a fractional Sobolev penalty to the spatial output of a neural field or reconstruction CNN, rather than relying only on pixelwise weight decay or total variation. The fractional order s continuously controls high-frequency suppression, allowing an experiment to test whether s less than 1 preserves edges better than the classical integer-order penalty while still reducing noise and unstable oscillations.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Modify decentralized parameter averaging or graph message passing so that each communication edge is classified using its observed delay and the spectrum of the instantaneous communication graph. Fast edges retain cooperative coupling, while excessively stale edges are attenuated or treated as antagonistic in a signed-Laplacian stability test. This should prevent a small number of very stale links from destabilizing otherwise stable asynchronous training.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a single local message-passing or convolution operator by a spectrally controlled mixture of fractional and ordinary diffusion. The exponent σ is learned or scheduled, while a crossover gate forces the model to change parameterization near the renormalization-group threshold σ*=2, allowing long-range propagation when useful without retaining an unnecessarily nonlocal operator at short scales.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a purely diagonal or block-diagonal optimizer preconditioner with a truncated Woodbury correction selected in interaction coordinates. Per-example gradient combinations are ranked by their response through the base inverse preconditioner, so the retained directions are those most affected by curvature after normalization rather than merely those with the largest raw gradient norm.
Useful6/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace a dense neural interaction graph by a dynamically activated graph whose edge $(u,v)$ is retained only when its effective coupling exceeds the local spacing of response modes. The network remains sparse below the connectivity transition but becomes globally communicating once a giant component forms, providing a controllable alternative to arbitrary magnitude pruning.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a distributed spectral positional encoding to a graph neural network, graph transformer, sparse-attention model, or MoE router by computing the dominant eigenvector of the current weighted adjacency matrix with a few warm-started power iterations. Unlike a Fiedler-vector feature, this encoding uses only local neighbor aggregation, is naturally nonnegative for nonnegative adjacency weights, and can be updated incrementally when the graph or edge weights change.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Use the OT spectral bound as a conditioning signal for optimizing parameters of a neural cost or inverse-OT objective. Adapt the parameter step size and add a covariance floor whenever the estimated Jacobian lower bound collapses, preventing optimization from entering regions where Sinkhorn outputs become insensitive to the learned cost.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense translation-invariant interaction matrix with a positive-definite Toeplitz kernel K_n(e^f) whose log-spectrum is parameterized by a small number of Fourier coefficients with 1/|k| decay. Use the paper's explicit quadratic term as a spectral-volume budget, allowing long-range structure while discouraging uncontrolled determinant growth and ill-conditioning. Subtracting this term from a log-determinant regularizer leaves a residual intended to capture higher-order deviations from…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Search sparse reservoir wiring in graph space rather than repeatedly testing every candidate with its full nonlinear dynamics. Use graph descriptors to predict validation accuracy and nonlinear feature selectivity, then spend exact simulations on candidates with high predicted performance or high surrogate uncertainty.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Constrain a recurrent or state-space transition matrix so that its eigenvalues avoid a configurable annulus around the unit circle. This creates a stable/unstable decomposition and should reduce the accumulation of numerical, quantization, and activation-update errors over long sequences while preserving controlled long-term memory.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace fixed graph message weights with a source-node activity gate that amplifies or suppresses every outgoing message from that node. Use the linearized epidemic growth condition to calibrate the residual propagation strength so that the dominant graph mode is near, but below, an explicitly chosen stability threshold rather than being determined accidentally by the graph spectrum.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a proximal layer after a graph, mesh, or spherical convolution that groups all coordinates belonging to the same Laplacian eigenspace and applies one shared shrinkage gate to the whole group. Unlike coefficientwise spectral pruning, the result is unchanged if the eigenvectors inside a repeated eigenspace are rotated, preventing arbitrary basis-dependent feature selection.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build neural computation graphs with explicitly phase-budgeted serial and parallel branches, treating serial compositions as SRG products and parallel residual branches as SRG sums. Allocate phase centers theta_i so that every loop or branch aggregate stays away from -1, enabling stability-aware architecture search and constructive control of branch gains.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace unconstrained attention score vectors by normalized SU(2) coherent-state responses of a positive operator on an (N+1)-dimensional spin space. Each query produces a smooth bounded response over a fixed spherical grid, while values are aggregated normally. The coherent-state kernel imposes geometric structure and exposes a controllable concentration parameter N.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a random cyclic filter bank or patch projection with the Weyl–Heisenberg orbit of one normalized learnable prototype. Regularize the prototype so that all nonzero shift and modulation correlations have a large and nearly equal magnitude, maximizing the smallest eigenvalue of the induced feature Gram matrix and preventing poorly observed feature directions.
Useful6/10
Difficulty5/10
Novelty6/10