Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Replace the random or gradient-aligned perturbation in sharpness-aware minimization with a unit perturbation direction selected by a polynomial of the local Hessian. With \(\mathscr{P}(s)=(s-\rho)^2\), the direction converges toward Hessian eigenspaces whose eigenvalues are closest to the target curvature \(\rho\), allowing regularization of a chosen curvature band instead of indiscriminately penalizing only the sharpest direction.
Represent each of m neural branches by a positive input field f_i and a positive output field g_i, then penalize violations of the paper's multi-output Borell-Brascamp-Lieb bound at weighted barycenters. The constraint couples branches through both local normalized ratios and global mass ratios, encouraging calibrated multi-view predictions without requiring all output functions to be identical.
Replace scalar entropy penalties on attention maps with a matrix-valued heat-flow regularizer over a circular or periodic token coordinate. Each position stores a positive semidefinite matrix describing coupled heads, experts, or channels; heat smoothing is constrained by the sharp modified log-Sobolev and Bogoliubov–Kubo–Mori contraction rather than an arbitrary smoothing coefficient. This should suppress high-frequency routing noise while preserving positive matrix structure and reducing…
Add a multiscale texture regularizer to spatial feature maps by measuring Gaussian Difference-of-Gaussians responses at geometrically spaced scales. Weighting each scale according to a Besov smoothness exponent penalizes non-persistent high-frequency structure without forcing features to be globally smooth, so the network can retain edges and textures that survive across adjacent scales.