Unverified
2026
Replace or augment the transition map of a recurrent state-space model with bounded analytic maps of a latent complex coordinate, using several finite Blaschke generators that share a fixed point. Enforcing a superattracting fixed point of local degree p creates a tunable hierarchy of memory erasure: the theory predicts double-exponential decorrelation with exponent log p, while a merely attracting fixed point gives ordinary exponential decay.
Useful5/10
Difficulty7/10
Novelty9/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
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 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
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
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
Unverified
2026
Construct a spatially varying diffusion layer whose coefficient matrix is explicitly uniformly elliptic and whose local mean oscillation is penalized. Use it inside an implicit residual block, so the learned operator remains a controlled perturbation of a constant-coefficient elliptic operator rather than becoming an unstable collection of unrelated local filters.
Useful5/10
Difficulty6/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
Add a learnable orthogonal rotation to a hidden representation and train it to make every channel projection have a small ψ2/L2 ratio. Unlike variance normalization, this explicitly suppresses directions with unusually heavy empirical tails while preserving the total quadratic energy of the representation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a trajectory-level consistency constraint to a diffusion or Markov generative model by comparing the likelihood of each sampled path with the likelihood of its reversed path. The constraint uses the paper's sharp fluctuation floor to detect when a model produces too many strongly backward-looking trajectories or hides directional mismatch in a small number of extreme events. This is a regularizer and diagnostic for learned stochastic dynamics, not a replacement for the generative likelihood…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a sharp graph-Laplacian spectral filter with a Bochner–Riesz filter whose smoothness exponent increases when the graph contains regions with different effective dimensions. Estimate the largest local dimension and dimension gap from neighborhood growth, then choose the exponent above both the classical spectral threshold and the asymmetric obstruction threshold. This should suppress unstable high-frequency mixing in heterogeneous graphs while preserving more low-frequency signal than…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a small number of differentiable graphical mean-curvature-flow steps between a neural network's raw vector-field prediction and its task loss. The relaxation performs geometry-aware smoothing rather than isotropic Gaussian smoothing, and it can enforce fixed boundary values after every step.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a learned GNN adjacency so that its random walk mixes rapidly, reducing graph bottlenecks and isolated regions that make information propagation inefficient. Use a thresholded penalty rather than minimizing Kemeny's constant to zero, because excessively fast mixing can produce oversmoothing.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Apply a weak-trace spectral constraint to the covariance of antisymmetric second-order features, encouraging a 1/i eigenvalue envelope rather than forcing a finite trace norm. This targets the paper's sharp logarithmic Ky Fan behavior and may preserve useful long-tail interaction directions that nuclear-norm regularization would remove.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a scale-invariant Gagliardo–Nirenberg ratio penalty to intermediate CNN or spatial neural-network feature maps. The penalty discourages representations with unusually large low-order fractional gradients relative to their amplitude and high-order energy, providing a single mathematically coupled constraint instead of separately weighted total-variation and Sobolev penalties. Apply it only to selected layers and estimate the reference sharp constant from clean baseline activations.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add the paper's joint shape-and-mass distortion objective to a neural coordinate map whose output is a three-dimensional latent representation. Penalize anisotropic local Jacobians through a log-distortion term and penalize nonuniform latent occupancy through a density-gradient term, while learning the radii of an ellipsoidal latent target domain. This should discourage folds and collapsed regions without forcing every dataset into a fixed spherical latent prior.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent Bernoulli branch dropout in a tree-structured mixture or hierarchical MLP with connectivity gates sampled from a q<1 wired random-cluster model. The q<1 law provides conditional negative association across branches, so increasing statistics of disjoint branches have nonpositive covariance; this should reduce redundant expert activation while preserving structured stochastic exploration.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Regularize a neural model using the shape function of two learned variables rather than a single mutual-information scalar. For a pair of representations $(X,Y)$, evaluate the profile on a grid of $(\alpha,\beta)$ values and optimize a target profile or penalize undesirable lower-left-triangle dependence. The auxiliary variable $W$ is produced by a small adversarial encoder, approximating the supremum in the definition and thereby finding the most informative conditional decomposition of the…
Useful5/10
Difficulty7/10
Novelty6/10