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
Regularize a neural scalar field on S^N with the paper's Beckner functional at the certified coefficient alpha=1/2. The loss combines a high-order spherical spectral penalty with an exponential-density term, while a center-of-mass constraint prevents the model from exploiting low-frequency directional drift.
Useful5/10
Difficulty5/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
Add higher-order filtered-error states to parameter-efficient fine-tuning and constrain the highest-order state to a prescribed shrinking funnel. The resulting recursion gives an explicit bound on parameter drift and its filtered derivatives at every lower order, providing a principled alternative to a fixed quadratic proximity penalty or unconstrained momentum.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the usual fixed threshold or exponentially decaying adaptive threshold in a recurrent spiking layer with a signed reinforcement accumulator. Each spike updates a per-neuron state S by a signed increment, and the next spike requires membrane potential to overcome alpha times the positive part of S. This creates history-dependent negative feedback under sustained firing while retaining the ability of negative reinforcement to restore excitability.
Useful5/10
Difficulty4/10
Novelty4/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
Use the determinant of the constrained Fourier system as a frequency-aware conditioning certificate. Frequencies close to the characteristic planes receive stronger Tikhonov damping or lower supervision weight, preventing a neural inverse solver from amplifying measurement noise in modes where analytic inversion is unstable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a spatiotemporal neural model with spectral penalties corresponding to several temporal-spatial scaling laws rather than using a single isotropic smoothness penalty. The model can remain spatially detailed while suppressing temporal oscillations, or learn the opposite preference when the data demand it.
Useful5/10
Difficulty4/10
Novelty6/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
Constrain a positive asymmetric recurrent or state-space transition operator by penalizing its principal eigenvalue through local ratio evaluations rather than repeated eigendecomposition. Introduce a periodic logarithmic corrector whose optimized local quotients provide a differentiable, conservative estimate of the operator's growth rate; this is especially suitable for sparse nearest-neighbor transitions.
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace an unconstrained geometric multiscale codebook by features generated from a finite digit set and a Pisot scale factor. The contracting algebraic-conjugate directions should suppress near-collisions between representations at different scales, producing a discretely separated hierarchy that can be used for embeddings, recurrent memory, or quantized transformer states.
Useful5/10
Difficulty6/10
Novelty9/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
Train a small ensemble of parameter particles with stochastic gradients while penalizing excessive pairwise curvature defect. The ensemble acts as a low-cost variational or exploration population, and the defect penalty discourages particle pairs from entering strongly noncontractive regions without requiring the neural loss to be globally convex.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a hidden representation with positively homogeneous interaction features built from approximate eigenmodes of a linear layer. Fractional products of mode magnitudes and phases provide nonlinear channels whose transformation laws are inherited from the spectrum of the underlying operator, potentially representing oscillatory or multiplicative dynamics more compactly than a generic MLP.
Useful5/10
Difficulty7/10
Novelty8/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
Normalize every higher-order simplicial message-passing or diffusion block using the spectral radius of a lower-order up-Laplacian, rather than estimating a separate radius for each order. The paper's monotonicity theorem guarantees that this shared bound is conservative for all higher orders, enabling stable explicit updates with one spectral calibration.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent an axially symmetric neural field on the sphere as a scalar function of latitude and regularize it with the paper's Paneitz energy together with its exponential log-partition term. Enforce a center-of-mass condition on the normalized exponential density so that the regularizer cannot be reduced by simply translating the field toward a first spherical-harmonic mode.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a feature field with positive channel amplitudes and penalize violations of the paper's system-wide relative-variation bound. Unlike per-channel total variation, the penalty constrains only aggregate channel mass, allowing channels to exchange mass through signed or non-cooperative mixing while keeping the overall representation stable. The method is most natural for intermediate CNN maps, positive SSM states, or sequence embeddings indexed by a coordinate with meaningful local…
Useful5/10
Difficulty3/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
Whiten intermediate feature vectors and constrain several gauge moments to remain in the dimension-dependent interval predicted by the paper's Gaussian/log-concave comparison. Apply the penalty only to moderate orders, where the paper gives a uniform bound independent of the particular log-concave distribution; this should suppress heavy activation tails without forcing all features to be exactly Gaussian.
Useful5/10
Difficulty3/10
Novelty6/10