Unverified
2026
Represent an intermediate hidden-state matrix as a low-rank factorization and replace a dense residual update by a repeated contractive step followed by hard SVD truncation. Increase or decrease the rank automatically so that the discarded Frobenius-norm tail is below a specified tolerance, providing an explicit accuracy-memory tradeoff instead of fixing the rank in advance.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use a small set of known or trusted pairwise costs to estimate the effective entropic temperature of a Sinkhorn attention or mixture-of-experts routing layer directly from its observed transport plan. This provides a calibration controller that can detect over-concentrated routing and adjust epsilon without backpropagating through a costly temperature search.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a projection-space mixer that combines several fixed or learned directions using reciprocal correlations with the current feature, then normalize the result. The exact construction has a universal beta law for its squared input-output cosine, so it can create controlled angular diversity while remaining deterministic and independent of the chosen direction dictionary.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace unconstrained token-to-expert routing with a nonnegative mixture of a small set of feasible routing or communication patterns. Enforce resource limits using the paper's one-sided positive-contribution bound, which gives a conservative certificate without enumerating all joint token activation scenarios. Expand the pattern set only when a separation procedure finds a routing pattern that improves the router objective while adding useful capacity information.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a recurrent associative matrix to each selected transformer layer so recent key-value relationships can be retrieved without retaining every past token or performing gradient updates. The matrix uses input-dependent retention and write gates, but retrieval is always performed from the pre-write state, preventing the current target from leaking into its own prediction. Frobenius-norm clipping makes the recurrent memory bounded and provides a direct stability control.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a dense token-mixing, MLP, or low-rank-adapter projection with a Bernoulli-signed sparse matrix normalized by the paper's predicted operator scale. Estimate the active representation dimension and use the effective scale to detect regimes in which extreme sparsity is likely to cause unstable amplification or dead rows.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace the raw position/channel basis of a one-dimensional sequence module by eigenvectors of the projected cubic radial kernel matrix. Penalize or truncate coefficients in eigenmodes with many sign changes, giving a mathematically ordered smooth-to-oscillatory inductive bias while preserving the two-dimensional nullspace corresponding to affine trends.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an ordinary group-L1 penalty on structured neural components with a powered ratio-of-norms penalty applied to their nonnegative importance magnitudes. The ratio encourages importance to concentrate on a small number of heads, channels, or experts while being less sensitive to arbitrary rescaling of the underlying weights. After training, components with small importance can be physically removed and the model can be fine-tuned.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace fixed LoRA factors with a rank-adaptive moving subspace whose columns are augmented using derivative information from several Runge–Kutta stages. The optimizer integrates a matrix-valued gradient-flow approximation inside this enlarged left/right basis, allowing high-order motion of the adapter subspace while retaining a low-rank parameterization.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a local Jacobian spectral regularizer and an initialization sweep to steer a looped transformer away from uncontrolled near-unit dynamics. The goal is to prevent examples from entering a fold-critical regime with very long relaxation times, or alternatively to deliberately target a controlled critical regime when adaptive test-time compute is useful.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a small dynamical state on the transformer module graph and use it to control adaptive computation, but reject controller parameters whose discrete-time update has latent roots outside the unit disk. The state can modulate halting thresholds, residual-block gains, and memory gates; the certificate applies to the controller integrator and prevents unstable oscillations or exploding internal control signals during long adaptive-depth rollouts.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a sparse fixed orthogonal mixer by repeatedly applying pi/4 rotations to randomly matched pairs of feature coordinates. Place this mixer before top-k feature pruning, sparse projection, or activation quantization so that information is spread across coordinates without using a dense random matrix.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
For a neural block with matrix-valued activations and transformation Y = A X B, regularize the exact coupled spectrum of the two-sided map instead of penalizing A and B independently. A large singular direction in A is penalized more strongly when the corresponding singular direction in B is also large, directly controlling joint feature amplification.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace dense token-to-token attention in a controlled ablation with a cyclic order-a recurrence whose coefficients are periodic across positions. The resulting mixer has linear cost in sequence length for fixed recurrence order and can enforce a fixed signed periodic boundary condition, providing a compact structured alternative to local attention or a lightweight state-space model.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Represent hidden features using a tensor-product polynomial-evaluation code instead of storing one value per feature. Corrupted coordinates can then be identified through violations of low-degree consistency and repaired before the next neural layer, targeting robustness to hardware faults, unreliable memory, malicious distributed workers, and adversarial activation corruption.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace unconstrained or entropy-regularized MoE routing with a minimally disruptive update that preserves a lower bound on the log-determinant of the experts' weighted output span. The router still tracks the desired mixture, but a projection prevents the active experts from becoming linearly redundant or collapsing onto a low-rank subset.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a selected neural submodule as an open dynamical system embedded in the rest of the network. Regularize it to contain internal modes that are simultaneously reachable from many external features and observable through many external outputs, rather than behaving as a one-sided receiver, broadcaster, or disconnected read/write split.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a neural network head that predicts a covariance or other SPD matrix entrywise with regression in the matrix-log domain. The network predicts a symmetric matrix in unconstrained Euclidean coordinates, the matrix exponential guarantees an SPD output, and training can use intrinsic log-Euclidean or affine-invariant errors rather than Frobenius error on raw entries.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace or augment a dense attention similarity matrix with a Min-cone matrix generated by a monotone scalar sequence. The resulting matrix is positive semidefinite by construction, has only O(n) learned scalar parameters, and can be multiplied by values in O(n d) time using cumulative sums rather than forming an n-by-n matrix.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the number of tokens participating in an attention operation to adapt the projected query/key dimension according to the sharp Johnson–Lindenstrauss bound. Short attention windows receive a dimension limited by n-1, while longer windows use a logarithmic dimension, avoiding a fixed large head dimension when the current attention set contains too few points to require it.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a dense translation-invariant interaction matrix with a positive-definite Toeplitz kernel K_n(e^f) whose log-spectrum is parameterized by a small number of Fourier coefficients with 1/|k| decay. Use the paper's explicit quadratic term as a spectral-volume budget, allowing long-range structure while discouraging uncontrolled determinant growth and ill-conditioning. Subtracting this term from a log-determinant regularizer leaves a residual intended to capture higher-order deviations from…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize neural features indexed by a compact transformation group using the three conditions from the vector-valued Pego theorem: nearby group transformations should produce nearby features, high group-Fourier coefficients should have small energy, and feature energy should remain concentrated in a fixed low-dimensional value-space subspace. The third term is important for large or effectively infinite-dimensional feature spaces, because translation and Fourier smoothness alone do not…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10