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
Replace a dense order-p tensorized neural layer with a sparse random hypergraph tensor whose support probability is alpha = c/N^{p-1}. Assign independent zero-mean marks to active hyperedges, so every tensor moment scales as N^{-(p-1)} while the total variance entering each output remains controlled. The resulting locally tree-like computation graph should reduce parameters and multiply-adds without immediately destroying signal propagation.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace fixed sparse masks with a stochastic birth-death process for neural connections or spatial units. A diffusing morphogen-like utility field controls where connections are added or removed, while a local simple-point test rejects removals or additions that would disconnect a layer or alter a prescribed computational topology. This creates an adaptive sparse architecture with a tunable compact-to-branched transition rather than unconstrained magnitude pruning.
Useful6/10
Difficulty6/10
Novelty6/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
Replace ordinary sign-gradient or fixed-range gradient quantization in distributed training with a non-adaptive one-bit refinement block. Workers generate all localization and multiscale residue bits using public randomness before the server knows the current aggregate gradient; after decoding a coarse center, the server chooses which stored phase and scale interpretation to use. This should reduce clipping and variance for heavy-tailed gradients without requiring a second communication round.
Useful6/10
Difficulty6/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
Train a coordinate MLP or neural operator using locations selected by an ordinary-kriging estimate of the unresolved field rather than by uniform random sampling. At each acquisition round, estimate the local reconstruction variance from the current labeled set and query points with the largest variance, optionally weighted by their application importance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a residual network with two coupled feature streams and deliberately non-reciprocal cross-stream interactions represented by a skew-symmetric coupling matrix. Decay the coupling strength with depth according to the RG picture of an irrelevant perturbation, allowing early layers to exploit rotational mixing while forcing deep layers toward reciprocal equilibrium-like dynamics. This should preserve transient expressivity without producing depth-dependent amplification or oscillatory…
Useful6/10
Difficulty5/10
Novelty8/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
Train a primal neural PDE solver and a separate physical-adjoint neural solver, then use their first-order-system residuals to adaptively allocate collocation points toward regions that control a chosen quantity of interest. Instead of minimizing only the primal residual uniformly, prioritize points according to a balanced combination of primal and adjoint local residuals, because the target-output error is controlled by their global product.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual independently normalized MoE router scores with a small system of tropical inequalities controlling expert load, score margins, and capacity slack. Each inequality induces a local max-plus policy selecting its currently dominant expert or constraint; policy improvement detects positive-weight cycles that would cause oscillatory routing and applies the smallest bias correction that removes them. This provides a non-differentiable but cheap controller around the router…
Useful6/10
Difficulty6/10
Novelty6/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
Use the small dielectric-anisotropy estimate to replace expensive nonlocal electrostatic solves with a local field-energy surrogate during most neural-network updates. Periodically evaluate the exact field, estimate the approximation constant, and trigger correction solves only when the observed error exceeds the predicted quadratic scale.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Model a checkpointed validation metric as a finite asymptotic expansion in known decay features, such as powers of training step, and estimate its limiting value using sliding least squares. Use a ridge-stabilized fit and require agreement across multiple windows before stopping, preventing the controller from reacting to transient non-asymptotic behavior.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Condition a temporal neural network on a tempo or dilation ratio through a homomorphism from multiplicative positive scales to additive latent shifts. A ratio composed from several scale changes then produces the sum of their learned effects, allowing interpolation and extrapolation to rates absent from training instead of using an independent embedding per rate.
Useful6/10
Difficulty4/10
Novelty5/10