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
Select the coordinates of a sparse adapter or sparse fine-tuning mask using both Fisher width and inverse-Fisher width. The mask should avoid parameter subsets that are cheap in the Fisher geometry but extremely large in the inverse-Fisher geometry, or vice versa, thereby controlling both prediction sensitivity and estimator-like uncertainty.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a density-weighted kernel operator whose features are multiplied by sqrt(rho) on both input and output sides. Under bounded kernels, changing the density by L1 distance changes the operator in Hilbert-Schmidt norm only at square-root order, giving a directly testable robustness guarantee for adaptive attention or graph layers.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Convert a density-dependent operator acting only on active coordinates into an ambient neural layer by embedding with sqrt(rho) and setting its action to zero on the zero-density defect. This produces the minimum-norm extension and prevents arbitrary or unstable outputs on coordinates that the current density declares unobservable.
Useful6/10
Difficulty4/10
Novelty7/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
Build a low-rank trilinear attention module in which query, key, and value factors are constrained to the unit sphere and refined through a few proximal alternating sweeps. The proximal terms suppress factor oscillation and make each sweep improve a well-defined tensor interaction objective, offering a stable alternative to unconstrained tensor-power iterations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct the connectivity mask of a sparse MLP or MoE layer so that every active feature group is covered by a matching to an independent input or sample group. If the mask contains unmatched vertices, repair it with the fewest additional edges or low-rank skip connections before training. The goal is to avoid width- or sparsity-induced singular regimes that can produce sharp interpolation-like loss and generalization spikes.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's effective-rank and eigengap-dependent covariance estimation rates to construct a confidence-aware low-rank bottleneck for transformer activations or key/value tensors. The bottleneck is enabled only when the top-p empirical eigenspace can be estimated more accurately than the desired compression error; otherwise the layer remains full-rank.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Cast minibatch parameter optimization as a finite-horizon stochastic control problem and let a positive-semidefinite task matrix determine the covariance and control penalty of artificial parameter-space dynamics. At each adaptation interval, evaluate several candidate task matrices on the same perturbation trajectories using importance weights, then select the candidate with the smallest estimated path-integral upper bound instead of hand-tuning a fixed optimizer preconditioner.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct sparse attention masks as regular or almost-regular hypergraphs: every query selects exactly w keys, while every key receives nearly equal incidence within each score or locality class. This preserves a fixed sparsity budget while removing systematic positional and head-level load imbalance that can cause hot keys, uneven memory traffic, and unstable gradients.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's mode decomposition to choose between ordinary DIGing and augmented ATC-DIGing/AugDGM according to the communication spectrum and curvature. The augmented scheme changes the disagreement feedback gain mode by mode, which can reduce the dominant pole radius on well-connected graphs without changing the neural-network architecture.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Model an RNN as a linear state-space system in feedback with its slope-restricted activation, then search for a finite-horizon IQC multiplier instead of relying only on a spectral-radius or OZF-style condition. Penalize or reject parameter settings for which the strict IQC/LMI certificate has insufficient margin, yielding a directly testable stability criterion for long unrolled sequences.
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Replace magnitude-only pivot selection in an approximate symmetric eigensolver with a perturbation score that divides squared off-diagonal coupling by the spectral gap between the associated diagonal entries. In covariance whitening or second-order preconditioning, this should spend a limited number of rotations resolving nearly degenerate eigenspaces while ignoring harmless couplings between well-separated modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a generic optimizer for equality-constrained neural-network updates with an augmented KKT solve that separately preconditions parameter and constraint variables. Add a positive semidefinite constraint penalty to the parameter block; this does not change an exactly feasible solution but makes the primal block better conditioned and the constraint Schur complement more robust.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Encode K input vectors at Chebyshev nodes with a Berrut rational interpolant, send different evaluations of that interpolant to N workers, and let every worker run the same neural function on its encoded input. The master reconstructs the desired outputs at the original data nodes from worker responses, allowing stragglers to be omitted and enabling robust rejection of inconsistent responses.
Useful6/10
Difficulty6/10
Novelty7/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
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
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
Unverified
2026
Build a low-dimensional basis for the principal module generated by the all-ones vector, then perform adjacency and degree propagation in compressed coordinates. On forests, the paper states that this module equals the automorphism-orbit module, so the reduced representation can preserve principal adjacency-degree information while using far fewer coordinates than the number of vertices.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a graph neural network with features generated by noncommutative words in the adjacency matrix and diagonal degree matrix. Ordered patterns such as AD^2A and DADA distinguish where degree information occurs along a walk; the paper proves that the full scalar moment family determines every tree.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Partition network parameters or output-head parameters into two coupled groups, C and D, and use a Schur-complement preconditioner rather than one shared scalar learning rate. The update approximately accounts for the response of group C before applying the curvature seen by group D, reducing the effect of cross-group gradient coupling and large condition numbers.
Useful6/10
Difficulty6/10
Novelty5/10