Unverified
2026
Adapt the slope of each spiking neuron's surrogate derivative using the normalized entropy of its block's attention distribution. High centered entropy uncertainty increases the slope, while low uncertainty decreases it, and a dead zone holds the default slope fixed for ordinary fluctuations. The adaptation exists only in backpropagation, so the forward spike function, parameter count, and inference cost remain unchanged.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Regularize a learned two-dimensional score or value surface so that every local rhombus obeys the hive inequalities. This imposes discrete concavity along three lattice directions, encouraging smooth but nontrivial piecewise-linear structure without simply penalizing all second derivatives.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace an unrestricted additive recurrent or fast-weight memory with a sign-selectable update: for each incoming update vector, choose between adding and subtracting it so that a smooth compact potential of the memory state is minimized. This is appropriate when the memory representation has sign symmetry, such as signed random features or a learned linear sketch; it is not a drop-in replacement for ordinary gradient updates where the sign carries semantic information.
Useful5/10
Difficulty5/10
Novelty9/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
Unverified
2026
Represent a directed interaction graph by a Laurent-polynomial Euler-like matrix and use its evaluation as a signed message-passing or attention-mixing operator. During dynamic rewiring, require the new graph representation to preserve the associated bilinear form up to the congruence transformation induced by the change of basis, so equivalent routings produce equivalent hidden states.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Apply a convex Husimi functional as a differentiable regularizer to positive matrices used by attention heads, routers, or feature covariances. Penalizing the squared response suppresses sharp spherical peaks and can prevent collapsed routing or unstable attention without directly forcing uniform eigenvalues.
Useful5/10
Difficulty4/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
Replace an unconstrained categorical or multilabel output head with a graph-supported distribution over feasible independent sets. Given neural logits, assign probability proportional to the exponential of the total logit of each selected vertex, so incompatible vertices can never be jointly active. Use exact junction-tree inference for decomposable graphs with small treewidth, and compare against post-hoc masking or penalty-based constraint enforcement.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the sharp exponential tail bound to set a local clipping threshold from a desired exceedance probability. Instead of globally clipping activations at a fixed value or percentile, clip each local window at its minimum plus B log(e/delta), where delta is the tolerated fraction of clipped entries.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Regularize hidden activations or attention logits by their local mean excess above the local minimum, rather than by symmetric variance or absolute magnitude. The penalty specifically suppresses upper-tail spikes while remaining invariant to adding a constant offset to every value in a local window.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Represent a small expert router or attention interaction by a homogeneous polynomial with nonnegative coefficients, then penalize violations of the Lorentzian Hessian signature on degree-two derivative slices. Initialize or warm-start the coefficient tensor from a normalized skew-Schur coefficient array, which the paper identifies as a realizable volume polynomial and therefore a structurally valid Lorentzian point.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a learned causal mixing profile by a monotone profile followed by a prefix-average Hardy mixer. The monotonicity constraint makes the mixer provably non-degenerate in the BMO sense: localized variation in the profile cannot be reduced below a calibrated factor by prefix averaging. This is a cheap alternative to dense causal attention for tasks where importance or state profiles are expected to decay along sequence position.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Regularize the eigenvalue spectrum of a neural representation or attention Gram matrix using the paper's universal-kernel spread-complexity curve. The loss penalizes spectral profiles that exhibit excessive level clustering or near-degeneracy, while allowing the desired amount of eigenvalue repulsion to be selected by a GOE-like, Poisson-like, or empirically calibrated target.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace independent dropout or Gaussian perturbations across attention heads, ensemble members, or diffusion score replicas with a positive-semidefinite correlation matrix sampled from an LKJ distribution. The concentration parameter eta controls whether perturbations are nearly independent or strongly correlated in a controlled way, while the Bartlett construction guarantees a valid covariance without matrix rejection or projection.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a measurement-conditioned attention layer with two explicitly separated fields: a geometry-only inverse-temperature profile that controls interaction strength and an outcome-dependent chemical-potential bias. For a region bounded by coordinates a and b, force the interaction gate to vanish as the square root of the distance from either boundary, while allowing a separate potential channel to encode measured values.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace part of an attention matrix with a mixture of fuzzy permutation matrices induced by short permutations. Each basis element represents an order-preserving k-token matching smeared over all embeddings into the sequence, while a balancing constraint makes the aggregate attention receive uniform global coverage. Retain a standard low-rank or local-attention residual so the structured branch does not prevent arbitrary content-dependent interactions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat learned features on a mesh as differential forms and pool them against oriented chains using wedge or cap products instead of ordinary coordinate averaging. Couple forward and boundary features with the signed chain differential so that pooling commutes with differentiation, preserving local conservation and orientation information.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a certified perturbation margin to entropy-based losses so that the desired entropy remains valid after input augmentation, quantization, dropout, or attention noise. Instead of treating the entropy change caused by a perturbation as an uncontrolled empirical quantity, use the sharp modulus \(\Gamma_{\alpha,D}(\delta)\) to enforce a worst-case-safe entropy target.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use the paper's lower bound on nearest-correlation repair cost to detect when a neural network's pairwise similarity predictions contain too much globally incompatible off-diagonal energy. Instead of projecting every predicted matrix onto the correlation cone, train the network to reduce the repair-risk statistic or trigger expensive repair only when a cheap diagnostic predicts substantial distortion.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Regularize a hard MoE router so that assignments remain block-jumbled: every group of token positions sends approximately the expected number of tokens to every group of experts or capacity slots. The condition detects localized routing collapse that ordinary global load balancing can miss, while requiring only a small block-count matrix rather than expensive pairwise or pattern statistics.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Attach each token or graph node a discrete grade a in a finite group A, and modify attention value composition with a normalized group 2-cocycle rather than independent pairwise gates. The cocycle provides a globally consistent projective interaction rule, so composing three messages gives the same result under either parenthesization. This may improve relational reasoning while reducing the number of freely learned interaction parameters.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a positive multiplicative perturbation to the node or token measure of a symmetric neural operator and use the paper's eigenvalue-response matrix to identify nearly degenerate eigenspaces. Train the perturbation or its scale so that repeated eigenvalues split with a controlled minimum gap, making spectral positional encodings and eigenvector-based message passing more stable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment an exponential state-space memory branch with a causal convolution whose lag-j weight is exp(-lambda j) ell(j)/j. The 1/j boundary provides broad logarithmic memory, while lambda supplies an explicit finite memory scale and prevents uncontrolled accumulation from an untempered long-memory kernel.
Useful5/10
Difficulty5/10
Novelty5/10