Unverified
2026
Add an exact angle-aware support-function penalty to a network that predicts a convex region around points, trajectories, or latent embeddings. For each triangle orientation, the penalty checks the paper's weighted support inequality rather than sampling many boundary points, encouraging globally valid geometric coverage with only three directional support evaluations.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add an algebraic diversity barrier to a companion or polynomial state-space layer so that its coordinate projections do not become simultaneously degenerate. The barrier uses the paper's Schur-polynomial factorization instead of explicitly enumerating every maximal minor, and can be applied during initialization or training to improve multi-coordinate observability and reduce ill-conditioned state representations.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a multiscale Hamming-ball discrepancy penalty to a learned discrete codebook or tokenizer. The penalty forces the selected codewords to distribute their mass so that every center and radius sees approximately the global expected fraction of codewords, discouraging collapsed or highly clustered codebooks and potentially improving robustness to symbol substitutions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment LayerNorm on a hidden representation by a learned volume-preserving linear map that minimizes the representation cloud's spherical mean width relative to a volume proxy. The determinant constraint prevents trivial shrinking, so the module targets anisotropy and elongated activation clouds; the expected benefit is a tighter geometry that is easier to quantize or cover with a small codebook.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use a tanh MLP with an explicitly tracked Pfaffian-chain complexity and select its width and input sparsity using the paper's zero-count bound. The bound limits the number of regular decision-boundary crossings along one-dimensional data-space restrictions, so it provides a principled way to discourage excessively oscillatory fits beyond ordinary weight decay.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Train an MLP coordinate map so that its local scale distortion is smooth in the interior and approximately constant on the boundary of the parameter domain. This implements the Chebyshev-Darboux-Milnor principle as a regularizer for neural parameterizations, potentially reducing boundary stretching and improving interpolation quality on learned geometric domains.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a low-dimensional spectral regularizer to an encoder or transformer representation by estimating the first N nonconstant modes of its Gaussian-weighted diffusion operator. Penalize excessive reciprocal spectral mass and unequal low-frequency eigenvalues, using a Gaussian-ball reference calibrated to the representation's effective mass; this discourages latent directions from becoming weak, collapsed, or strongly anisotropic.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a linear adapter between two representation spaces so that it preserves not only feature values but also the relative sparsity of sampled directions in the source representation subspace. Penalize the logarithmic spread between the largest and smallest support-size expansion ratios, preventing the adapter from making some directions dense while collapsing others. This is useful for transferring sparse features between checkpoints, aligning sparse autoencoders, or inserting a…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Regularize a set of learned neural representations by the Green-kernel energy of their signed discrepancy from a target background distribution. Unlike a standard pairwise repulsion term, the regularizer penalizes both over-concentration and under-coverage relative to the prescribed density, and an indefinite kernel can encode attractive as well as repulsive interactions.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize a two-dimensional latent class support or decision-boundary projection by requiring its measured small-radius tube area to follow the quadratic law predicted for conic geometry. Penalize the fitted linear and quadratic coefficients only weakly, but strongly penalize nonquadratic residuals and rapidly changing coefficients across training checkpoints. The intended effect is to remove cusps, tangential near-contacts, and narrow gaps without directly imposing smoothness on the network…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a scale-invariant inequality penalty to a neural vector-potential model on a discretized round 3-sphere. The penalty enforces the theorem's sharp lower bound between the L^{3/2} norm of the predicted magnetic field B=curl A and its helicity H=<B,A>, discouraging pathological high-frequency or spatially concentrated fields that fit observations but have implausible geometry. A divergence-free gauge and Killing-form initialization make the constraint numerically well-conditioned.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Regularize the hidden-state trajectory of a sequence model so that the distance between states at positions i and j follows a controlled power-law profile in |i-j|. This explicitly prevents representation collapse over long contexts while avoiding the requirement that all distant states be maximally separated. Use alpha as a tunable geometry parameter and compare alpha against the effective hidden dimension using the paper's Euclidean realizability threshold.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace raw polynomial interactions between neighboring feature vectors with central polynomial interactions computed after subtracting the local feature mean. Keep separate second-, third-, and fourth-order channels and apply independent residual gates to them, so a uniform shift of every feature in a neighborhood cannot create artificial cross-order responses. This is a drop-in higher-order mixer for a small transformer or graph neural network.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a radial-fluctuation penalty to a feature layer after explicitly centering and whitening its activations across the minibatch. The paper supplies an interpretable threshold, eight times the feature dimension, for the variance of squared feature norms. The penalty activates only when empirical radial variance exceeds that threshold, avoiding unnecessary pressure toward constant-norm representations.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Treat each recurrent update or inference block as a time-dependent map F_n and regularize it toward a limiting autonomous map F whose long-horizon dynamics are easier to analyze. In addition to penalizing one-step map differences, impose a quotient-consistency loss so that pairs of hidden states that are asymptotically indistinguishable under F remain indistinguishable under every time-dependent generator F_n.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent a sequence of hidden states as points on a Riemannian sphere and penalize discrete geodesic curvature rather than merely penalizing adjacent-state differences. The regularizer discourages sharp bends in representation trajectories while remaining comparatively insensitive to uniform traversal speed, making it suitable for transformer depth trajectories or diffusion denoising paths.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a finite-resolution geometric code to a 3D neural encoder: quantized lattice occupancy, local barycenters, and tangent directions are converted into structural tokens alongside ordinary point or mesh features. Choose lattice spacing from estimated local reach so that small perturbations do not change the code, and train the continuous encoder to agree with this discrete structural representation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a fixed weighted sum of normalized neural-network objectives with a differentiable fuzzy scalarizer that assigns every criterion to desirable, tolerable, and undesirable regions. Explicit output consequents turn these semantic classes into a scalar training loss, while localized memberships reduce flat plateaus and make the optimizer distinguish genuine preference minima from arbitrary ties.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add an invertible two-dimensional flow block whose Jacobian and coordinate outputs are explicitly regularized to preserve independence of several prescribed product distributions. Instead of estimating independence only from samples, enforce the change-of-variables functional equation for multiple density probes, encouraging the learned map to belong to a low-dimensional family of independence-preserving transformations.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a curl-Sobolev quotient to a 3D neural network whose intermediate features are vector fields or discrete 1-forms. The regularizer rewards features with strong curl-helicity relative to their L^{2n/(n+1)} curl energy, while an explicit Hodge projection removes exact-form components that lie in the curl kernel. In three dimensions this is a differentiable, gauge-aware alternative to simply penalizing feature gradients.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a Fourier-domain anti-concentration penalty to normalized embeddings or latent codes. For random one-dimensional projections, penalize empirical characteristic functions that exceed a power-law envelope whose exponent is determined by the estimated effective fractal dimension, discouraging collapsed, lattice-like, or overly periodic representations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Add a hypergraph p-Laplacian penalty to hidden representations of samples or tokens grouped by a known relation, such as augmentations of one image, mentions of one entity, or tokens in one retrieved semantic cluster. Unlike mean pairwise smoothing, the penalty targets the maximum weighted discrepancy within each hyperedge, preventing a single representation from becoming an outlier while allowing moderate variation among the remaining members.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent each bias-free hard MoE routing region as a polyhedral cone in router feature space and regularize its estimated conic intrinsic-volume sequence. The penalty enforces the paper's strengthened log-concavity inequality, preventing routing regions from having implausible concentration at isolated face dimensions and potentially reducing unstable expert starvation.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a coordinate-free regularizer that prevents a batch of unit-normalized embeddings from concentrating almost entirely on one side of a hyperplane passing through their spherical centroid. Sample random directions tangent to the estimated centroid, measure the soft fraction of embeddings in each corresponding hemisphere, and penalize fractions below the spherical Grünbaum constant. This targets directional mode collapse while preserving rotational invariance.
Useful5/10
Difficulty3/10
Novelty7/10