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
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
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
Unverified
2026
When training a neural state-space model, SSM, or recurrent world model from trajectories, constrain the data-generation policy or augmentation process to satisfy both a Hankel-rank condition and a task-weighted frequency-coverage condition. The rank condition prevents unidentifiable dynamics, while the frequency condition concentrates samples at frequencies that affect the target prediction horizon, tracking objective, or closed-loop controller instead of merely producing broadband-looking…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a shallow neural interpolation controller to a neural ODE or state-space model so one shared vector field matches prescribed derivatives at several anchor trajectories. At every control time, compute controller weights from a small linear system instead of learning all task-specific parameters by backpropagation.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a learned scalar ordering to a directed graph attention layer and retain only forward edges, producing a DAG attention mask without requiring a supplied topological order. Train the ordering with a differentiable surrogate for weighted surplus, and regularize it toward the paper's explicit half-weight-minus-l2 certificate. This supplies a principled alternative to random masking or unconstrained bidirectional graph attention when causal or hierarchical information flow is desirable.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Set the residual propagation coefficient of a simplicial neural layer from a cheap upper bound on the operator spectrum instead of tuning it blindly. The degree-majorization theorem supplies a bound on the largest eigenvalue, while the Brouwer-type inequality supplies a topology-count-based bound on sums of the top eigenvalues.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use the conjugate degree sequence of codimension-one faces as a mathematically justified upper envelope for the spectrum of a simplicial up-Laplacian. Penalize violations of the corresponding top-k eigenvalue budgets in a simplicial message-passing layer, discouraging a few dominant propagation modes that cause oversmoothing or unstable amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Compose independently parameterized neural dynamical modules through power-preserving skew coupling instead of equality penalties or projected constraints. This creates a modular graph or world model in which information exchanged between modules is antisymmetric, so internal coupling cannot create or destroy total latent energy.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Compute separate doubled-angle orientation order parameters for left and right image regions, then expose their sum and difference as symmetric and antisymmetric global features. This gives a network a low-dimensional inductive bias for global vertical structure versus left-right imbalance, while retaining magnitude channels that indicate when either readout is undefined because orientations cancel.
Useful6/10
Difficulty5/10
Novelty7/10