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
Use deadline objectives to train or control a router that explicitly trades off completion probability against completed work by a fixed horizon. Begin with fair allocation for robust exploration, then anneal toward a feedback-greedy rule once per-item difficulty estimates have sufficient evidence.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the memoryless parameter update with a discrete generalized Langevin update whose friction kernel is a positive mixture of decaying modes generated or scheduled by a Loewner driving process. Inject correlated gradient noise using the same kernel, implementing the paper's fluctuation-dissipation mechanism instead of choosing momentum and noise independently. The method is intended for noisy minibatch training, where controlled colored noise can preserve exploration while suppressing…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Treat consecutive optimizer updates as a discrete dynamical system and monitor the dominant local multiplier of the parameter-update map. When an estimated real multiplier approaches -1, apply damping or reduce the learning rate, because the paper's mechanism predicts the onset of an alternating period-2 orbit before ordinary divergence is visible.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace generic projected-gradient iterations for equality-plus-bilateral constraints with an active-set semismooth Newton layer. Each iteration fixes currently active lower and upper bounds and solves one structured saddle-point system, potentially converging in a few iterations when only a small subset of constraints is active.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a positive completely monotone memory branch to an optimizer or recurrent state update, but retain an explicitly calibrated instantaneous gradient or input branch. Estimate the memory branch's finite-horizon coercivity and prevent the system from entering regimes where memory suppresses high-frequency corrections and causes slow or unstable training.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a fixed learning-rate schedule with a BB curvature step projected onto an adaptively estimated stable interval. Use the enlarged gradient-descent stability range, approximately below 2/L for an L-smooth objective, but verify every aggressive proposal with a sufficient-decrease test and fall back to a smaller step when the local curvature estimate is unreliable.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the feedbacked control-to-state norm as a conditioning diagnostic to adapt the optimizer step applied to recurrent residual outputs. When the estimated horizon amplification is large, reduce or precondition the residual-control update; when feedback makes it small, permit larger updates.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a wide activation vector or spatial feature field by a small set of weighted coordinates that preserves the p-norm of every activation in a learned low-dimensional subspace. Unlike ordinary pruning, the selection objective is uniform over the whole coefficient sphere, so the compressed representation is designed to preserve unseen linear combinations and not merely the training examples.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Encode observations into a latent state in which each discrete action applies a separate linear Koopman transition matrix. Train the encoder and matrices from replay data, then use repeated matrix multiplication for multi-step prediction instead of recursively evaluating a nonlinear dynamics network. This is especially suitable for discrete-action model-based RL, where action-conditioned linear operators provide cheap rollouts and expose unstable action/state combinations.
Useful6/10
Difficulty5/10
Novelty6/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
Unverified
2026
Use mutually orthogonal Latin labels as deterministic expert assignments for token batches. Each routing family is individually balanced, and pairs of families avoid repeated co-assignment patterns, enabling multiple routing rounds or auxiliary experts without the severe load collisions caused by independent random hashing.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the raw gradient update for spatially organized parameter tensors with a two-level correction. The gradient is split into a coarse, low-frequency component handled on a downsampled grid and a fine detail component handled directly, allowing the optimizer to use a larger or better-conditioned step on smooth directions without amplifying pixel-scale noise.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a stochastic optimizer as a Markov transition kernel and monitor its contraction on mean-zero observables using singular values, which remains meaningful for non-reversible momentum dynamics. Adapt optimizer hyperparameters online to maximize an empirical singular-value gap, suppressing oscillatory modes that can have small eigenvalue gap but poor transient relaxation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a fixed-cubic-regularized Newton step with an adaptive cubic model whose coefficient is increased when the observed loss violates the local Taylor model. The regularizer becomes stronger automatically in regions with large gradients, reflecting the paper's generalized smoothness law, while shrinking near stationary points so that Newton curvature is used more aggressively.
Useful6/10
Difficulty7/10
Novelty6/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
Construct a reusable ReLU trunk that emits approximate univariate powers or Legendre-polynomial features for each input coordinate, then combine them with a linear or low-rank polynomial head. This gives a compact explicit basis for smooth functions and can replace a large generic MLP in low-dimensional scientific regression or serve as a frozen or partially trainable front-end.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's cycle-gain criterion to repair an approximate bipartite matching produced by greedy matching, truncated Sinkhorn, or a neural router. A directed edge from matched red item i to red item j represents replacing i's current blue partner with j's partner; any positive-gain directed cycle is a guaranteed improving, feasibility-preserving reassignment.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense weak pairwise interaction over tokens or graph nodes by an analytically resummed Gaussian quadratic term plus explicitly evaluated corrections containing only subsets of size at most R. Choose R from the target approximation error and interaction scale instead of fixing the interaction order heuristically. This is intended for dense global attention, graph interactions, or latent-variable energy models with individually small couplings.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Use diagonal similarity scaling to reduce the induced infinity norm of a sparse recurrent transition or companion operator before or during training. Similarity preserves eigenvalues while changing coordinate-wise amplification, so the method can suppress non-normal transient growth without changing the represented linear dynamics.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense or ad hoc sparse attention pattern with a circulant mask generated by the paper's carry word c(m,k). Every query attends to exactly m of k relative positions, and the selected positions are prefix-balanced, avoiding the large gaps and collisions produced by random sparsification. Use several Farey-related slopes across heads or layers to combine local, medium-range, and long-range coverage.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a fixed sparse token-mixing layer on n=qr cyclic positions whose directed edges are all offsets 1 through r, but execute the edges through r Hamiltonian path scans plus one prescribed chain. The paths preserve exact coverage of the circulant connectivity while exposing long sequential traversals that can be fused into custom kernels, recurrent scans, or state-space updates.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the adjacency matrix of a vertex-transitive strongly regular graph as a fixed sparse attention or token-mixing mask. Every vertex has the same degree, and every pair of vertices has exactly one of two common-neighbor counts, giving predictable two-hop coverage and avoiding the degree and connectivity irregularities of random sparsification.
Useful5/10
Difficulty5/10
Novelty6/10