Unverified
2026
Replace fixed-period federated averaging or distributed all-reduce with a Bernoulli communication decision whose probability is selected from estimated network connectivity and optimization conditioning. Local workers continue making corrected updates between communication events, while the contraction theorem exposes when communication is worth its cost.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper’s observation that the fully irreducible vertex is approximately local after crossed-channel ladders are removed to build a block-local curvature correction for neural-network optimization. Estimate a cheap bare covariance and subtract the inverse full covariance to obtain a local irreducible correction, avoiding a dense four-point model while retaining interaction effects that ordinary diagonal preconditioners miss.
Useful6/10
Difficulty6/10
Novelty7/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 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
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
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
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
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
Use a symmetric positive-definite, non-diagonal mobility matrix to couple updates of parameter groups, analogous to drag-modified Onsager mobility coupling ionic species. Estimate local block curvature and select the learning rate from the generalized spectrum of mobility times curvature, targeting rapid loss decay without the instability of aggressively scaled diagonal optimizers.
Useful6/10
Difficulty5/10
Novelty6/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
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
Replace the usual inverse-eigenvalue weights in a low-rank feature-covariance preconditioner by inverse weights with an estimated isotropic floor subtracted. Retain only the top r eigendirections and require every corrected denominator to exceed a margin, preventing the shifted inverse from approaching a pole. This should undo systematic under-updating of predictive directions when many weak feature directions inflate the empirical covariance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Partition parallel neural-network replicas, experts, or parameter blocks into clusters and communicate their parameters through a directed nonnegative weight matrix whose dominant eigenvector is constant within each cluster. The optimizer contracts within-cluster disagreement while retaining separate cluster-level parameter states, providing controlled specialization instead of destructive global averaging.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat each neural-network block as a local strength system and measure how perturbations in its input channels affect multiple output observables, rather than using a single gradient norm. Use the estimated maximum directional gain to cap residual updates or assign a layerwise learning-rate multiplier, preventing weak high-gain layers from destabilizing training while allowing strong layers to move faster.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a Lanczos chain for the neural-network vector field or hidden-state evolution, separately within bins of approximately constant loss, energy, or activation norm. Use the resulting Krylov complexity and Lanczos-coefficient growth as an early-warning signal for unstable training or long-horizon hidden-state amplification, then reduce the learning rate or recurrent integration step only in the unstable shells.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use nested parameter-confidence sets to control how far a neural optimizer may move when its local loss dynamics are uncertain. Estimate a local linear model of parameter or gradient evolution, propagate a homothetic tube for possible next iterates, and impose a trust-region radius that shrinks when the estimated contraction margin is insufficient. This gives a model-based alternative to heuristic gradient clipping and predicts a sharp learning-rate boundary tied to the largest uncertain…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a response-sensitive regularizer to networks whose outputs should react predictably to a control input, using the stationary Markov sensitivity equation as a certificate. Instead of only penalizing large neural gradients, the method attributes amplification to the generator resolvent and can distinguish amplification caused by a nearly slow latent mode from amplification caused by uncontrolled parameter growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use multilevel sensitivity of the global interaction margin to identify which neural block, connection, or parameter group is responsible for instability. This provides a targeted alternative to uniformly shrinking the learning rate or regularizing every layer.
Useful6/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a noisy or expensive per-layer spectral-norm estimate with a sharp upper bound obtained by maximizing the largest squared singular value subject to several layer spectral moments. The bound uses the paper's few-distinct-values structure, so the optimization scales with the number of moments rather than the width of the layer.
Useful6/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a large positive semidefinite neural operator as the sum of two Kronecker products and regularize an efficiently computed upper bound on its largest eigenvalues. The bound controls not only the spectral norm but every top-k eigenvalue sum, allowing a tunable penalty on concentrated or unstable directions without constructing the exponentially larger operator.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a scalar neuron activation with a matrix function of a learned Hamiltonian. Fixed Hermitian interaction operators are combined as a trainable linear Hamiltonian, the activation is applied to its eigenvalues, and the resulting observable is measured on an input quantum state. Noncommuting interaction terms provide a controlled source of expressivity beyond an ordinary scalar neuron.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace an unpreconditioned conjugate-gradient solve for a damped Gauss–Newton step with a two-level algebraic preconditioner derived from local Jacobian-row supports. Use overlapping local parameter blocks as Schwarz subdomains and a coarse basis containing low-energy local modes, so the optimizer can correct both localized and globally coupled parameter errors.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Use the diffusion graph's Dirichlet energy and almost-isometry inequalities to score whether a candidate minibatch preserves the low-frequency structure of losses, logits, or gradients over the dataset. Reject or augment batches that distort these quantities, producing a geometry-aware batch acceptance rule rather than relying only on random or loss-based sampling.
Useful6/10
Difficulty7/10
Novelty7/10