Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
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.
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.
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.
Insert a rearrangement operation on scalar feature maps sampled along an ordered coordinate such as time, spatial position, or a neural-field input grid. The operation sorts values into non-increasing order, preserving the empirical histogram exactly while provably not increasing the Riesz fractional variation in the ideal one-dimensional continuous setting.
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.
Paper: Reduced characteristic number criteria for equivariant bordism of $T^k$- and $(\mathbb{Z}_2)^k$-manifolds with isolated fixed pointsarXiv:2607.01889
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.
Add an inverse-capacitary-distance penalty to coordinate-network outputs near complex forbidden sets, rather than using only Euclidean distance-to-boundary weighting. The penalty is theoretically compatible with the network's spatial Dirichlet energy: it suppresses large values near obstacles while the gradient penalty controls the weighted singularity, even when the obstacle is thin, perforated, or fractal-like.
Add a bank of quadratic features encoding tangent contact with the reciprocal manifold x1 x2 = 1, rather than forcing a generic MLP to discover this interaction from arbitrary monomials. For positive bounded feature pairs, each feature is nonnegative and becomes exactly zero at a selected reciprocal operating point. The module can be used either as an input feature expansion or as a regularizer encouraging learned gates and scales to follow a reciprocal geometry.
Regularize the spatial curvature of a scalar-output image network using the paper's Burkholder integrand instead of an isotropic squared-Hessian norm. The energy is nonconvex pointwise but quasiconvex on symmetric Hessians, so compactly supported Hessian perturbations cannot lower the total energy relative to an affine field; this may suppress oscillatory curvature while allowing sharper anisotropic transitions than quadratic smoothing.
Parameterize a nonnegative neural penalty or energy function as a sum of weighted power-mean differences applied to polynomial features of the network representation. Each atom is globally nonnegative by the power-mean inequality, so the learned penalty cannot become negative or destabilize constrained training, while the cone can represent polynomials outside SOS-plus-nonnegative-circuit certificates.
Add a spectral regularizer to a learned graph or sparse attention adjacency that penalizes violation of the paper's energy floor. The regularizer discourages adjacency matrices that retain many edges but collapse into a low-dimensional spectral structure, which may reduce graph-message-passing diversity and worsen oversmoothing.
Convert an attention or MoE routing affinity matrix into a soft graph and constrain its K_r-density relative to its observed K_s-density. The regularizer penalizes pathological affinity patterns in which moderate s-way coactivation is accompanied by an implausibly low or unstable r-way coactivation.