✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
When a model, dataset, or parameterization has an involutive symmetry, transform gradients and curvature into symmetry sectors before applying adaptive updates. The Hessian and optimizer can then be handled as independent even and odd blocks, preventing curvature from one sector from forcing an unnecessarily conservative learning rate in the other.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace simultaneous parameter updates with sequential block updates whose order is selected using estimated cross-block sensitivity. The paper shows that sequential policy updates can have a substantially smaller local contraction factor than decoupled or differently ordered updates; the neural analogue is to order attention, normalization, backbone, and head blocks according to the spectral radius of their composed update map.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Train a small encoder and latent Koopman predictor to forecast whether a neural sequence model will enter a high-error or high-instability region, then execute an expensive refinement block only when the forecasted risk exceeds a threshold. The base model remains active at every step, so the learned preview model controls computation rather than directly replacing the main predictor. Add a bounded-rate interpolation when the gate switches off, preventing abrupt changes in recurrent state or…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the exact matrix-polar normalization in Muon with the smoothed feedback \(h_\epsilon(M)=M(M^\top M+\epsilon I)^{-1/2}\). This retains singular-vector-aware updates and approximately unit-normalizes dominant spectral modes, but avoids unstable behavior when the momentum matrix is rank deficient or has tiny singular values.
Useful7/10
Difficulty5/10
Novelty4/10
△ Mechanism confirmed, baseline not beaten
2026
Replace dense attention between tokens on opposite sides of a one-dimensional boundary or segment split with a dyadic low-rank approximation of a Cauchy/Hankel distance kernel. Each distance-scale block uses O(log(1/\varepsilon)) features, and the number of active scales grows only logarithmically with context length after discarding a narrow boundary layer. This is especially suitable for a relative-position attention branch or state-space-like long-range branch, rather than arbitrary…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the extreme-eigenvector marginal test to decide whether a Kronecker preconditioner is condition-optimal, rather than blindly running expensive factor refinement. If the certificate fails, construct a low-cost factor correction from the mismatch between tensor marginals of the worst-conditioned spectral states and accept it only with a condition-number line search.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Replace dense self-attention by a sparse mask on a one-dimensional or ordered token geometry, retaining local neighbors and adding long-range edges with probability proportional to distance raised to \(-(1+\sigma)\). Use \(\sigma\approx0.8\text{--}0.85\) as the initial regime because the paper finds that this range supports delocalized, GOE-like connectivity despite sparse bonds. The resulting layer has linear or near-linear attention cost while maintaining long-range paths.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Regularize the local recurrent Jacobian by its spectral radius rather than imposing the overly conservative operator-norm condition $\|J\|_2<1$. This permits useful non-normal updates with transient amplification while explicitly pushing the asymptotic dynamics toward a stable fixed point.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a conventional two-layer channel mixer in a reversible architecture with the tropicalization of two cluster mutations. For every pair of channels, the block applies sign-dependent integer shears and reflections, giving a cheap piecewise-linear transformation that is exactly invertible and requires no stored activations during backpropagation. Continuous trainable affine scale and mixing parameters can be placed around the fixed tropical core.
Useful7/10
Difficulty4/10
Novelty8/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
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 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
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
Use enumerated weighing matrices as sparse orthogonal channel-mixing operators inside MLPs or residual blocks. Their ternary entries reduce multiplication to signed additions, while exact orthogonality prevents amplification or attenuation of feature norms; a trainable fixed-support version can recover expressivity without giving up computational sparsity.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a recursive product implementation of a rational spectral filter with an additive sum of independently evaluated resolvents. Use the layer on a graph Laplacian, token-similarity operator, or other sparse feature operator to obtain a high-order filter without multiplicative roundoff and gradient amplification; the independent solves can also be batched or distributed across devices.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a symmetric token affinity matrix and approximate only its spectrally outlying token-mixing modes using a small set of sampled landmark columns. The resulting low-rank operator replaces an \(O(n^2)\) dense mixer by two skinny matrix multiplications, while the paper's residual guarantee predicts that large-magnitude global interaction modes are preserved.
Useful6/10
Difficulty5/10
Novelty5/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
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
Replace expensive global spectral diagnostics of a cyclic or block-circulant neural layer by exact small Fourier-block calculations. Add a scale-normalized fourth-moment penalty, or directly cap the largest eigenvalue of each frequency block, to suppress frequency-specific amplification and reduce unstable training in long cyclic convolutions and structured attention.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace activation-magnitude-based adaptive computation halting with a criterion based on the actual recurrent update and a local stability margin. The loop halts when the state change is small relative to state scale for several consecutive steps, avoiding pathological decisions when LayerNorm-driven dynamics cause the activation norm to collapse.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train attention logits so that the associated Sinkhorn-scaled operator has a favorable local spectral gap, making iterative normalization contract faster. Add a differentiable penalty on the second eigenvalue of the normalized operator while retaining the task loss and marginal-feasibility loss.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the tropical dynamical degree as an analytic expansion budget for repeated neural blocks. Layers with $pq>4$ deliberately expand along a known tropical eigendirection, while layers with $pq\leq4$ avoid exponential asymptotic growth; a schedule can therefore increase representational mixing without allowing hidden-state norms to explode.
Useful5/10
Difficulty3/10
Novelty7/10