Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Apply a low-degree polynomial feature lift to normalized hidden representations and penalize degeneracy of the covariance in that lifted space. This can detect collapse in nonlinear combinations of features even when the raw hidden covariance appears healthy.
Replace a dense third-order channel-interaction tensor by a fixed sparse support selected through the paper's uniform-marginal infeasibility certificate. Supports with a large dual margin have an effective entropy base below the channel alphabet size, suggesting fewer independent interaction slices and cheaper contractions. Use the certificate either during architecture search or as a pruning score for an already-trained tensorized layer.
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.
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.
Replace or augment a singular scalar activation \(\sigma\) with a distributionally regularized activation \(g\) whose Fourier transform is multiplied by \((i\rho)^\alpha\). This suppresses the problematic low-frequency singular component and can produce better-conditioned random-feature or first-layer representations, while a residual raw-activation branch prevents loss of standard approximation behavior.
Parameterize a tree-structured policy through realization weights satisfying sequence-form flow conservation, instead of independently predicting probabilities at every node. Conditional action probabilities are recovered by dividing a child sequence weight by its parent weight, guaranteeing globally consistent probabilities and avoiding invalid or contradictory branch masses. This is suitable for hierarchical RL policies, adaptive computation trees, and neural routers with sequential gating…
Add randomized orthogonal frame mixing and an incoherence penalty to tensorized neural layers so that predictions and gradients are less controlled by a small coordinate block. The goal is to retain the bulk, approximately Gaussian behavior of tensor contractions while preventing rare coherent directions from dominating training.
Regularize the Gram spectrum of selected neural layers so that its low-order moments match the spectral moments generated by a truncated q-boson Jacobi operator. Unlike a simple Frobenius or spectral-norm penalty, this controls several parts of the singular-value distribution simultaneously and can discourage harmful spectral tails without forcing all singular values to be equal.
Initialize a neural layer with singular values taken from the finite spectral measure of the paper's q-boson Jacobi operator instead of using Xavier or ordinary orthogonal initialization. The resulting layer has a deliberately shaped singular-value distribution and an explicit finite-size spectral edge, allowing initialization to target stable signal propagation while retaining spectral diversity.
Replace selected ReLU or sigmoid units with a stochastic binary crossing activation that fires only when exactly one of two independent noise thresholds is crossed. The resulting expected activation is low for inputs far below or far above the noise distribution and maximal near its median, creating an analytically controlled band-pass and potentially reducing saturation-driven instability.
Insert a distribution-free rank warp before selected MLP or attention projections. For each scalar activation, replace its empirical rank u by the cumulative interval map induced by the Type-III derangetropy kernel, optionally followed by Gaussian or affine output calibration. The transform is invariant to strictly increasing reparameterizations of the feature and contracts the marginal toward central ranks, potentially reducing sensitivity to heavy tails and outliers.
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.
Replace a collection of dense task-specific linear layers with a common sparse structural matrix and task-specific edge strengths. All tasks share the same learned connectivity pattern, but retain independent values on active connections, allowing parameter sharing without forcing identical interactions.
Represent the computation graph of an MLP as a directed acyclic Lawvere metric space and compute a truncated, length-resolved Euler signature of its active paths. Add a penalty that separates signatures between classes while suppressing signatures that are insensitive to labels, thereby encouraging globally distinct computation routes without changing layer widths or degree statistics.
For every unordered pair of scalar features, construct invariant coordinates from the elementary symmetric quantities s=x+y and q=xy, then feed a truncated orthogonalized polynomial basis in (s,q) to the neural network. Estimate the basis by weighted Gram-Schmidt or Cholesky whitening under the paper's triangle weight, so polynomial channels have low redundancy and controlled scale instead of requiring an unconstrained MLP to learn both symmetry and decorrelation.
Replace uniform PINN or neural-operator collocation by a graded point distribution concentrated in narrow regions between nearly touching interfaces. Use the paper's distance-dependent mesh scale to determine point spacing, and switch to a gap-dependent minimum scale when the separation becomes too small for the global mesh.
Equip a neural-network count head with a mean parameter and a dispersion parameter from the Conway-Maxwell-Poisson family, then enforce a mean-preserving convex-order relationship between predictions. This provides a principled way to make the predictive count distribution more or less tail-dispersed while retaining the same predicted mean, potentially improving calibration on overdispersed or underdispersed count data.
When a structured polynomial feature pairing is degenerate, train separately on its nondegenerate quotient and on the explicitly characterized radical instead of allowing both to compete in one singular loss. The quotient branch captures identifiable information, while a transported radical branch preserves information that the ordinary pairing cannot see.
Replace a singular inverse interaction kernel by the finite part of its meromorphic continuation at an exceptional dimension, producing an explicit polynomial-times-logarithm feature interaction. This gives a controlled alternative to adding an arbitrary ridge term when a learned polynomial Gram matrix becomes rank-deficient.
Add a support-sensitive coefficient regularizer to a high-order polynomial or Volterra layer whose monomials involve at most M input features. The regularizer penalizes the gap between the layer's coefficient ℓ_{2m/(m+1)} norm and its empirical worst-case response on random unit-modulus inputs, exploiting the fact that the theoretical gap constant approaches 1 for fixed M and large degree m.
Replace dense spatial pooling or integral evaluation over a planar domain by a sparse cubature layer whose nodes are poles of a rational approximation fitted only on the domain boundary. For analytic or nearly analytic neural-field channels, the same learned field can then be integrated using substantially fewer evaluations than a uniform grid, while the boundary approximation residual supplies a cheap reliability signal.
Train a neural scalar field with a singular energy that becomes infinite as the input gradient approaches a prescribed threshold, then increase the barrier strength through a monotonic continuation schedule. Unlike ordinary squared gradient penalties, the barrier strongly prevents late-training boundary violations and targets a strict margin rather than merely minimizing average gradient magnitude.
Add a mixed regularizer to a neural field or graph neural network that separates smooth ambient variation from fitting a potentially singular training measure. The training-measure term is weighted by a local reciprocal critical radius, so dense or lower-dimensional regions receive controlled regularization instead of causing unstable gradients or overfitting.
Build a single-hidden-layer network whose hidden weights and biases are sampled from a non-continuous distribution supported on a dense subset of parameter space, then train only the output coefficients. The result motivates discrete or mixed-precision hidden parameters without requiring a continuous Gaussian initialization; finite-width experiments can test whether this retains accuracy while reducing hidden-layer storage and arithmetic cost.