Unverified
2026
Split the optimizer state into a passive descent sector and an explicitly nonequilibrium current-like sector, then constrain the local update Jacobian to be block triangular. The active sector may perturb the passive update, but passive perturbations cannot feed back into the active sector at first order, making its decay rate measurable and preventing uncontrolled oscillatory feedback. A second design objective tunes the two decay rates to reproduce the paper's slow-mode splitting and uses the…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace pointwise high-order derivative residuals in an eigenvalue PINN by an assembled dynamic-stiffness residual \(\mathbf W(\omega)q_\theta\), where each element matrix is obtained from homogeneous PDE solutions. The network predicts nodal degrees of freedom or element boundary traces, while the exact frequency-domain operator enforces the physics without differentiating the network multiple times with respect to coordinates.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the momentum update in a gradient optimizer by inertial motion plus a gradient-difference term, which discretely approximates Hessian-driven damping. Choose the damping coefficient and step size using the paper's refined stability inequality instead of the older restrictive bound, and adapt them whenever the estimated smoothness changes.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use two bounded self-adjoint transition operators in a recurrent or state-space block and penalize their normalized Hilbert--Schmidt commutator. When the penalty is small, the paper guarantees that the pair is close to exactly commuting operators, suggesting a controlled path to a shared eigenbasis and cheaper coordinate-wise dynamics. Add an optional numerical repair step that projects the learned pair toward a simultaneously diagonalizable pair.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace random node or token subsampling by a subset selected to preserve the averages of low-frequency graph signals exactly or approximately. Build a graph over nodes or tokens, compute its Laplacian eigenspace, and choose a fixed-cardinality subset whose eigenvector moments match those of the full graph; use the retained subset for graph pooling or downstream attention.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Model dynamic routing as a multitype branching process: an active token of type d probabilistically creates child activations of type d'. Estimate the corresponding mean offspring operator and regulate its Perron root to a target reproduction rate, typically near one. This should make adaptive-depth or recursively routed networks use sparse computation without producing either rapidly vanishing paths or uncontrolled activation explosions.
Useful6/10
Difficulty5/10
Novelty6/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
Treat the component of minibatch-gradient noise that is coherent across iterations as an unknown periodic disturbance, estimate its phase and frequency with a latent oscillator, and subtract an anti-phase update from the optimizer step. Unlike fixed momentum or a fixed low-pass filter, the oscillator estimates the disturbance frequency online and therefore does not require prior knowledge of the data period, sequence period, or model-specific time scale.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When a recurrent or graph coupling matrix is approximately rank one, replace expensive full spectral monitoring with a scalar small-gain controller. Adapt a residual mixing coefficient so that the dominant coupled mode remains below a prescribed contraction threshold.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the weighted feature Gramian to remove nearly dependent Fourier, sinusoidal, or dictionary features during training instead of relying only on magnitude pruning. The criterion detects redundant directions even when their learned coefficients are individually large, improving conditioning of the linear readout and reducing inference cost.
Useful6/10
Difficulty4/10
Novelty5/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
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
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 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
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
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 the fixed number of Sinkhorn iterations used to normalize an attention kernel with a per-example stopping rule based on the local spectral contraction factor. Estimate the remaining marginal error geometrically and stop early on easy examples while retaining extra iterations on difficult or nearly disconnected examples.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Track where the loss Hessian's eigenvectors are most sensitive to the current minibatch perturbation, rather than using only eigenvalues or a global learning-rate estimate. Apply extra damping only to spectral bands with high geometric response, allowing flat and well-separated curvature modes to retain a larger step size.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Use a low-degree residual polynomial of the neural-network Hessian rather than an interval-only Chebyshev polynomial, with the polynomial minimized over the bulk Hessian spectrum and isolated outlier eigenvalues simultaneously. The method should reduce oscillation caused by rare sharp directions without shrinking the learning rate for the bulk spectrum.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the scalar learning rate of SGD or Adam's outer update by a blockwise Barzilai--Borwein estimate computed from consecutive parameters and gradients. Use gradient smoothing, denominator checks, and clipping so that the curvature estimate remains usable with stochastic neural-network gradients.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a learned dense token-mixing matrix or residual-state transition with a sparse diffusive mixer whose Laplacian has a deliberately small largest Jordan block. Balance the two chain lengths around the central coupling/core, because the paper proves that this minimizes the worst defective transient among the tridiagonal family. Use a scalar residual step size to move the non-consensus spectrum inside the unit disk while preserving the sparse structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Implement f(A)b inside a neural network with a short Lanczos recurrence instead of an eigendecomposition or dense matrix-function operation. Use an SPD operator A such as a regularized graph Laplacian or feature covariance matrix, and choose the number of iterations by monitoring successive approximations. For Stieltjes functions, Lanczos is guaranteed to be close to the best vector in the same Krylov subspace.
Useful6/10
Difficulty5/10
Novelty6/10