✗ Mechanism failed
2026
Replace a dense weight matrix by a cross approximation built from selected rows and columns rather than by a conventional truncated SVD. Periodically refresh the selected indices using residual leverage scores, warm-starting from the previous factorization so that the compressed layer can track weight changes during fine-tuning.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Regularize the end-to-end Jacobian singular-value distribution of a deep network toward the explicit free small-loss law generated by independently mixed projection-like layers. The target controls several gradient-spectrum moments, including the predicted fraction of nearly preserved directions, instead of controlling only the average gradient norm.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a dense channel or token-mixing matrix with a product of positive bidiagonal factors, so information propagates through a controlled sequence of local couplings rather than arbitrary signed interactions. Initialize the factors from the paper's barycentric-subdivision factorization, then learn positive diagonal and off-diagonal parameters; the resulting map is structured, parameter-efficient, and constrained to remain totally positive.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Insert a weighted negative-semidefinite fourth-order mixing operator into a residual or state-space layer. Instead of learning an unconstrained token-mixing matrix, parameterize its dissipative component as Q = -a W^{-1} B^T W B, ensuring that this component cannot increase the chosen weighted feature energy. Use a boundary-aware finite-difference matrix B along the sequence axis, optionally with learnable banded coefficients while preserving the factorization.
Useful6/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Use the weighted quadrature identity as a training or inference constraint for a compressed activation path: retain only a minimal set of binary evaluations and compute normalization or residual-energy statistics exactly on the modeled Rademacher component. This provides a zero-variance alternative to random activation subsampling for the represented subspace.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2025
Replace a conventional scalar activation by a geometrically indexed family of affine pieces whose slope changes with the logarithmic magnitude of the input. The same two endpoint parameters are reused across all scales, giving a compact, explicitly scale-aware activation that can represent different responses for exponentially separated activation magnitudes.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Build a constrained autoregressive model whose initial logits are generated from a translation-invariant MPS associated with a local zero-mode construction. The MPS supplies a structured valid distribution before a Transformer residual is added, so the model starts on the constraint manifold instead of learning validity through a penalty.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Partition activations into dyadic magnitude bands and allocate sparse connectivity separately to heavy and diffuse coordinates. Protect high-magnitude coordinates with more reliable connections while using randomized flat connectivity for the many small coordinates, keeping the total number of nonzeros fixed.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace ordinary per-coordinate activation normalization or covariance whitening with a learned or frozen affine map based on a minimum-volume ellipsoid calibrated to the activation convex hull. Estimate the hull's Minkowski symmetry and use the bound \(\rho=\sqrt{d/\alpha}\) to set a principled clipping radius, where \(d\) is feature dimension and \(\alpha\) is the measured symmetry. This should reduce worst-case clipping of asymmetric activation distributions without requiring a much larger…
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace a dense token- or channel-mixing matrix with a product of local braid generators acting on adjacent coordinates. Each generator is an exactly invertible 2-by-2 transformation, while the braid and far-commutativity identities give multiple equivalent factorizations of the same global operator. This creates a sparse, reversible mixer with O(kn) cost for a braid word of length k, rather than O(n^2) cost for a dense matrix.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace or augment a scalar periodic positional coordinate with a normalized bank of odd Fourier harmonics, keeping every position on the same-radius sphere. The resulting representation has an explicit translation-invariant similarity kernel, allowing the frequency count and spectral weighting to control how sharply attention distinguishes nearby versus distant phases.
Useful5/10
Difficulty3/10
Novelty3/10
Unverified
2026
Restrict a fine-tuning adapter or output head to the subspace invariant under a prescribed monodromy, analogous to the paper's unbroken flavor lattice. This removes update directions intentionally changed by the domain-loop transformation, producing a parameter-efficient adapter with an explicit algebraic constraint.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a fixed reversible lattice shear into a residual network so successive blocks follow a structured monodromy orbit rather than using unrelated learned transformations. Apply the transformation to a small learned subspace of hidden channels while leaving the remaining channels unchanged. This creates deterministic phase-dependent feature mixing with no additional trainable parameters.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained three-token interaction block by three distinct pair maps constructed from anticommuting channel generators. For every token triple, enforce equality of the two composition paths A12 B13 C23 and C23 B13 A12, while retaining different parameters for the three edges. This creates a globally consistent three-way interaction without collapsing to a single shared pair operator.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Interpret successive neural representations as an RG flow and constrain coarse-graining layers to remove unstable or redundant information monotonically. The paper reports monotonic decrease of an effective central charge along measurement-induced RG flows; a neural analogue can use a measurable information-complexity proxy and reject compression steps that increase it while preserving task-relevant information.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Regularize learned skew generators so that their iterated Lie brackets span many independent feature-mixing directions rather than collapsing to commuting or redundant matrices. This turns the paper's controllability family into a differentiable diversity objective for structured neural layers.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace the ordinary triangle-inequality budget for merging m linear residual branches or LoRA updates by the sharp quasi-reverse Minkowski certificate. During training, penalize or constrain the Schatten norm of the aggregate absolute update, which certifies the norm of the actually merged update with factor C_{p,m} rather than the loose factor m. This is especially attractive for p=2, where the certificate controls Frobenius energy and can be implemented with standard matrix operations.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a positivity-preserving fractional Schrödinger resolvent into a 1D neural sequence block. Given a nonnegative learned potential V, the layer transforms an input signal f using V^a(-Delta+V)^(-a)f, allowing the network to learn where to smooth or suppress features while retaining an L1 bound independent of the potential magnitude. Use a in (0,1] as a fixed hyperparameter or a clipped learned scalar.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct multiplicative neural gates directly on encoded tensors so that operands are multiplied coordinatewise without decoding between every operation. Polynomial evaluation makes this operation algebraically consistent with multiplication, allowing redundant gated MLPs or bilinear layers to retain fault tolerance while reducing the frequency of expensive correction steps.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the lifted convex hull as a training-time regularizer for pairs of nonnegative neural features, encouraging their empirical second- and third-order interaction statistics to lie in the paper's moment cone. This constrains correlations, squares, and cubic cross-moments jointly through PSD inequalities instead of merely penalizing large activations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use the finite-order characterization to learn a nonlinear similarity function for token, patch, or graph-node Gram matrices while preserving PSD by construction or by a differentiable certificate loss. This creates a kernelized attention or graph-readout mechanism in which nonlinear affinity transformations cannot introduce indefinite similarity geometry.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a structured token-mixing layer based on commuting sums of swap operators rather than unconstrained pairwise attention. The layer learns a low-degree spectral filter in the Jucys–Murphy operators, allowing it to represent hierarchical interactions while retaining an explicit algebraic inductive bias.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the flat-torus covariance bound as a representation regularizer that controls the largest covariance eigenvalue while maintaining a prescribed total variance. This creates a directional anti-collapse constraint rather than only a scalar variance penalty, and can be applied to encoder outputs, VAE latents, or Transformer sequence representations.
Useful5/10
Difficulty3/10
Novelty4/10
Unverified
2026
Use the normalized determinant of a routing or attention interaction matrix as a global spectral signature. Penalize abrupt changes in this Laurent-polynomial signature when the model learns or dynamically rewires its interaction graph, preserving global connectivity patterns while still allowing local edge adaptation.
Useful5/10
Difficulty5/10
Novelty7/10