Unverified
2026
Replace unconstrained predicted pairwise similarities with a correlation matrix whose diagonal is exactly one and whose spectrum is explicitly prevented from entering the nearly singular regime typical of high-dimensional elliptope samples. Add a soft spectral barrier during training and use a PSD-safe factorization at inference, so the model can represent dense correlations without relying on an unstable nearest-correlation-matrix repair.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the mode-wise instability condition as a controller for a learned cross-channel transport gain. During training or inference, estimate the linearized feature dynamics and adjust the chemotactic strength to remain below a stability margin for robust processing, or deliberately cross the threshold during a controlled pattern-forming stage. This replaces blind gain tuning with a measurable dynamical criterion.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace expensive global spectral analysis of a sparse graph propagation matrix, banded SSM transition matrix, or linearized layer with smallest-singular-value calculations on overlapping local sections. Penalize local sections whose pseudospectrum enters a forbidden region, adding the paper's explicit C0/L safety margin so that the resulting constraint has a principled finite-window error tolerance.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a 2D recurrent or residual neural lattice with slowly varying local couplings, while parameterizing those couplings so that an anisotropy invariant remains constant across all spatial and depth locations. The network obtains controlled local propagation velocities rather than arbitrary inhomogeneous amplification, enabling depth-dependent receptive fields while preserving near-critical signal propagation.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a structural penalty to a learned hypergraph or sparse routing graph that measures the gap between its conjugate vertex-degree spectrum and the squared spectrum of its up-Laplacian. The paper's identity says this gap equals twice the number of failed elementary shifts, so minimizing it encourages an ordered incidence structure rather than merely matching degree statistics or sparsity.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Parameterize continuous representation sectors using the Hodge geometry of the character torus rather than arbitrary Euclidean coordinates. Use the resulting metric to encode sector locations and impose local spectral smoothness, allowing a model to interpolate between geometrically nearby twists while retaining non-topological variation.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a recursive product implementation of a rational spectral filter with an additive sum of independently evaluated resolvents. Use the layer on a graph Laplacian, token-similarity operator, or other sparse feature operator to obtain a high-order filter without multiplicative roundoff and gradient amplification; the independent solves can also be batched or distributed across devices.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a symmetric token affinity matrix and approximate only its spectrally outlying token-mixing modes using a small set of sampled landmark columns. The resulting low-rank operator replaces an \(O(n^2)\) dense mixer by two skinny matrix multiplications, while the paper's residual guarantee predicts that large-magnitude global interaction modes are preserved.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct one reference Lanczos basis for a symmetric propagation operator H, then derive several seed-specific spectral responses for Q_a(H)x_0 through finite-band polynomial connectors. With degree-r seeds, each transformed basis vector uses at most 2r+1 neighboring reference basis vectors, avoiding a separate Lanczos factorization for every seed.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an ordinary dense or floating-point eigendecomposition of small Hessian or Fisher blocks with a sequence of rational Jacobi rotations. The rotations preserve Euclidean norms and can be stored using fixed-point coefficients, while approximately diagonalizing curvature so the optimizer can use separate coordinate-wise step sizes. This is especially relevant to low-precision training and blocks with mixed-sign curvature.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an expensive global resolvent calculation for a recurrent or state-space transition operator by measurements on overlapping finite patches. Penalize patches whose shifted operator has small minimum gain, while adding the paper's explicit O(1/n) truncation penalty so that increasing the patch size produces a predictable tightening of the stability certificate. This targets non-normal transient amplification that is invisible to ordinary eigenvalue or spectral-radius regularization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an SVD-based pseudoinverse of a learned rectangular matrix with a low-degree polynomial initialization followed by a few Newton–Schulz iterations. The polynomial approximates the inverse Gram operator, while a cheap residual test accepts it only when the iteration is contractive and otherwise selects a conservative transpose-scaled initialization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Track the dominant rank-r subspace of the gradient covariance online, then use that basis to construct a low-rank adaptive update or a controlled preconditioner. Unlike offline PCA refreshes, the Oja flow continuously follows changing training geometry while preserving orthonormality, potentially reducing the cost of second-order or Shampoo-like methods.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a recurrent cell that uses a filtered predecessor state and explicitly accounts for stale communicated features, following the paper's delay-augmented state-space construction. The cell is trained under variable activation delays and constrained so that local closed-loop dynamics remain stable, targeting robustness of long-horizon rollout rather than only one-step prediction.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a selective redistribution branch to recurrent or graph propagation layers whose local Jacobian gains are too large. Instead of globally shrinking the layer, blend the unstable update at only the offending coordinates with a volume-weighted average of those coordinates and their upstream neighbors, using the paper's explicit threshold as the minimum stabilizing blend.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace slow primal-coordinate Gibbs sampling of a graph-structured Gaussian latent feature field with Gibbs sampling in the Fourier-dual factor graph. Use the primal convergence formula to determine when dual sampling is worthwhile, and map dual samples back to neural features through the graph incidence operator.
Useful6/10
Difficulty7/10
Novelty7/10
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
Replace random edge dropout in a GNN with an order-aware filtration that removes edges in decreasing local spectral coherence. High-coherence edges are those whose rank-one Laplacian perturbations align strongly with the current local Laplacian, so their removal creates structured, spectrally meaningful augmentations rather than arbitrary damage. Train the GNN jointly on the original graph and several filtration states using supervised loss plus prediction or embedding consistency.
Useful6/10
Difficulty4/10
Novelty7/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
Use the slow-mode content of a neural network's local optimization dynamics to choose between a near restart and a deliberately larger restart concentrated in fast-curvature directions. The larger perturbation is predicted to recover faster when it has substantially smaller overlap with the slowest Hessian modes, producing an explicit Mpemba crossover in loss or validation recovery.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Parameterize a large linear layer as a sum of binary tensor products, W = Σ_l A_l ⊗ B_l, and regularize a factor-level upper bound on its top-k singular-value sums. The bound controls all Ky Fan norms of W while requiring SVDs only of the small factors, making it suitable for tensorized MLP or attention projections.
Useful6/10
Difficulty5/10
Novelty6/10
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
Regularize a learned self-adjoint contraction so that its eigenvalues move toward 0 or 1 rather than accumulating in the transition interval. This suppresses ambiguous mixing modes and can enable a smaller binary spectral approximation at inference.
Useful6/10
Difficulty4/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