Unverified
2026
Use a barycentric rational activation or filter whose interpolation nodes are periodically zoomed into the range of preactivations or eigenvalues actually encountered by the network. Protect the layer from catastrophic poles by monitoring the associated generalized eigenproblem and penalizing poles close to the active input interval. This targets rational networks whose expressivity comes from localized poles but whose training is destabilized by denominator zeros.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize a point-cloud or graph neural network so that two augmented versions of the same sample induce filtered proximity graphs with approximately interleaved Reeb graphs. The network is encouraged to preserve multiscale connectivity in learned scalar features, not merely pointwise feature similarity or final predictions. Use an approximate interleaving loss for small graphs and the cheaper H0 persistence-distance surrogate for larger batches.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a topological loss that preserves the winding number of a complex numerator field predicted by a neural network. The loss is invariant to positive rescaling of the field, so it penalizes vortex creation or destruction rather than harmless amplitude changes.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a neural network using exact finite-difference interaction terms at a chosen perturbation scale, while retaining the covering decomposition of a composition f∘g. Instead of penalizing only the total mixed difference, separately penalize selected covering terms containing large subsets or overlapping subsets, which targets higher-order and nonlocal interactions without computing Hessians.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a Microscopic Dynamical Entropy-inspired regularizer to a VAE or sequential world model. Instead of maximizing only the entropy of the latent marginal, maximize latent marginal entropy plus an estimate of the log-volume of unresolved variables compatible with each latent state, thereby preferring representations that summarize predictable macroscopic structure while assigning nuisance detail to the residual channel.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Constrain selected degree-four feature blocks to represent globally nonnegative binary quartics using a positive-semidefinite Gram matrix. This gives a structured alternative to unconstrained activations for energy, uncertainty, density, or direction-dependent gating features that must remain nonnegative under every planar direction.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Augment a neural model with a learned target differential form and a source-side correction whose compatibility is enforced by the mapping-cone differential. For a map F from M to N, train the model so that the target quantity is closed and its pullback to M is exactly the differential of the correction, providing a structured bulk-boundary consistency constraint instead of independent feature matching.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a global Euler-characteristic residual to a network predicting complementary phases A and B on a voxel grid or simplicial mesh. The regularizer forces predicted phase topology and separating-interface topology to satisfy the tubular-tiling balance law, helping reject geometrically plausible but topologically inconsistent segmentations. It is especially suitable when labels cover only one phase, interfaces are noisy, or the hidden complementary phase must be inferred.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a two-channel geometric head producing scalar fields u(x) and v(x) on a two-dimensional input or latent coordinate domain. Train it initially with a moderate p-harmonic duality constraint, then anneal p upward so u approaches an infinity-harmonic field while v remains its rotated-gradient dual; this penalizes isolated steep gradient spikes and promotes smooth, coherent level sets.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual squared input-Jacobian penalty with a stochastic approximation of the affine Sobolev energy, which computes an inverse-power spherical average of directional derivative norms. The negative exponent emphasizes directions with unusually small sensitivity and prevents the regularizer from being represented only by the largest-gradient direction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Apply the paper's reversed weighted interaction inequality to two nonnegative feature maps generated from different augmentations or network branches. Maximizing the normalized nonlocal interaction should discourage collapsed or overly concentrated spatial representations while remaining invariant to overall feature amplitude.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Train a neural field to output a symmetric conformation tensor C(x) while penalizing large spatial variation whenever its leading eigenvalue approaches the second eigenvalue. The resulting loss directly targets the mechanism identified by the paper: a topological change cannot occur cheaply unless the field develops a small spectral gap or a sufficiently concentrated gradient.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's central correction as an explicit regularizer on latent trajectories. Penalizing signed-area forcing across refinement levels should prevent repeated geometric injections from creating the paper's linear growth of scaled first differences and logarithmic smoothness loss.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the paper's explicit tree support pattern as a cheap certificate that a sparse neural linear map contains a nearly singular submatrix. During mask construction or rewiring, penalize root-row-child configurations with many disjoint child branches, or increase overlap and row degree locally when such a configuration is detected. The goal is to prevent sparse MLP, projection, or MoE expert matrices from developing directions that are almost annihilated by the layer.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a differentiable rearrangement-envelope penalty to a positive integral-kernel layer. The penalty uses the Laplace-transform inequality to prevent the sorted upper tail of the layer output from becoming substantially larger than the cumulative upper tail of its input, providing a distribution-sensitive alternative to ordinary activation clipping or an L2 penalty.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a fractional oscillation penalty to scalar functions produced by a neural network on an ordered grid. Unlike a derivative penalty, this remains meaningful for nonsmooth or nowhere-differentiable outputs and interpolates between total-variation-like behavior and Sobolev-like smoothness.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Build an attention or positive-mixture module whose output ratio at two control settings is provably monotone in an ordered index such as token distance, retrieval rank, or discretized uncertainty. Use normalized-positive-series identities to replace an unstable quotient derivative with a difference of expectations, and penalize violations of the resulting stochastic-order condition during training.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a robust central region of each class or domain embedding cloud by intersecting halfspaces whose discarded cap mass is at most a prescribed fraction. Use this floating-body region to define prototypes or consistency targets, suppressing one-sided outliers without assuming Gaussian covariance structure. The centerpoint level 1/(d+1) provides a principled default depth parameter.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Calibrate the maximum attention logit in each head against the log-correlated extreme-value law instead of applying fixed clipping or a fixed max-norm penalty. Penalize only maxima that exceed the predicted log N minus three-quarter log log N baseline by an unusually large order-one fluctuation, allowing ordinary sharp attention while suppressing rare pathological spikes.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a Vandermonde conditioning objective to a mixture-of-experts router so that experts acquire distinct scalar routing signatures instead of collapsing onto the same score region. The regularizer uses powers of one learned scalar score and directly penalizes near-coincident expert scores, providing a finite-mode identifiability signal complementary to load balancing.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Apply the paper's sharp sumset lower bound to the active discrete supports of multiple additive branches in a sparse neural layer. Penalize cases where the support of the combined output is smaller than the mathematically guaranteed minimum implied by the branch supports, discouraging destructive overlap and representational collapse.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Estimate how often a representation lies on a separating hyperplane for alternative separable dichotomies, and use this quantity as a boundary-concentration penalty. Unlike a single classifier margin, the score measures whether many admissible separators consider the point ambiguous.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
For two monotone prediction heads receiving binary features, penalize cases where their covariance is smaller than the sharp degree-weighted collision of their Fourier spectra. This discourages uncontrolled agreement on high-order interaction patterns while preserving low-order shared structure, and can be used either as a constraint or as a diagnostic for monotone multi-task models.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a differentiable penalty to a graph generator or graph predictor when its soft higher-order clique density violates the sharp lower bound implied by its lower-order clique density. The regularizer encourages generated graphs to have mathematically consistent motif statistics without hard-discretizing the predicted adjacency matrix.
Useful5/10
Difficulty4/10
Novelty7/10