Unverified
2026
Train a scalar neural field on a bounded convex domain with a restricted half-Laplacian residual and an explicit strict-concavity barrier. The paper's theorem motivates requiring the learned potential to have negative-definite Hessian throughout the domain, while the nonlocal residual gives the model a global Cauchy-process-style inductive bias rather than only local smoothness.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a deterministic mixture-of-experts residual block with K population-indexed stochastic expert states coupled through a graphon matrix. The layer uses a shared drift and expert-dependent diffusion, while an empirical convex-order penalty makes later representations more dispersed than a reference representation without permitting a mean shift.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a weak regularizer that keeps categorical representations away from both uniformity and deterministic collapse by targeting an empirically selected information-variance level. Unlike entropy maximization, this objective does not reward the uniform distribution, because information-content variance is exactly zero at uniformity.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Construct one empirical-likelihood-weighted outcome distribution per treatment or domain group, with weights chosen to match the global mean of selected covariates exactly. Use this shared weighted empirical measure as the target for a neural CDF, survival, or quantile head rather than fitting separately adjusted targets at each threshold or quantile. The target is automatically a valid probability distribution, so its CDF is monotone and its quantiles cannot cross.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace unconstrained transformation composition in a geometric or sequence encoder with time-dependent Lie-algebra controls whose flows compose according to the paper's flow-product rule. Add a holonomy consistency loss so different control trajectories that induce the same endpoint automorphism produce the same latent transformation, reducing sensitivity to arbitrary path parameterization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Calibrate random edge dropout in a GNN or sparse-attention layer using the spectral radius of the underlying communication graph. Retain edges with probability p chosen so that p lambda(A) is at least 1 plus a safety margin, preventing the random computation graph from entering a subcritical fragmented regime while retaining high sparsity.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single Gaussian, Laplace, or Huber residual model with a conditional mixture containing an inlier component, a body component, and an explicit generalized-Pareto tail. The network learns both the prediction and the probability that an error belongs to the extreme tail, allowing rare large errors to be modeled without making the entire loss excessively sensitive to ordinary noise.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize hidden activations or per-example gradients with a discrete version of the paper's Z_E^2 norm. Apply an E-norm to the largest fraction of coordinates and an L2 norm to the remaining tail, allowing the model to preserve a few large responses while discouraging widespread heavy-tailed noise.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Use a pressure objective to select expert-routing distributions by balancing task reward against route entropy, rather than optimizing task loss alone. The resulting router behaves like an equilibrium-state estimator: it should retain multiple high-performing branches when their combined entropy outweighs the advantage of a single branch.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a deterministic feature layer that evaluates symmetric Schur-type features on a fixed cyclic orbit and learned reciprocal latent pairs, then projects the resulting channels onto selected residue classes with an exact roots-of-unity filter. The reciprocal construction makes the layer invariant under replacing each latent scalar by its inverse, while the torsion projector prevents leakage between cyclic frequency sectors.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add an auxiliary loss that makes selected representation coordinates insensitive to all subsets of fewer than d variables while retaining a d-way parity statistic. The objective discourages the network from solving a task through pairwise shortcuts and explicitly rewards a controlled high-order interaction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment the first embedding layer for antipodally identified inputs with the normalized traceless quadratic map from the Veronese construction. Because q and -q produce exactly the same feature, the layer enforces projective invariance by construction rather than learning it from augmented examples. The resulting matrix-valued features can be flattened, projected, or processed by an equivariant linear layer.
Useful5/10
Difficulty2/10
Novelty6/10
Unverified
2026
Replace the ordinary triangle-inequality budget for merging m linear residual branches or LoRA updates by the sharp quasi-reverse Minkowski certificate. During training, penalize or constrain the Schatten norm of the aggregate absolute update, which certifies the norm of the actually merged update with factor C_{p,m} rather than the loose factor m. This is especially attractive for p=2, where the certificate controls Frobenius energy and can be implemented with standard matrix operations.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a positivity-preserving fractional Schrödinger resolvent into a 1D neural sequence block. Given a nonnegative learned potential V, the layer transforms an input signal f using V^a(-Delta+V)^(-a)f, allowing the network to learn where to smooth or suppress features while retaining an L1 bound independent of the potential magnitude. Use a in (0,1] as a fixed hyperparameter or a clipped learned scalar.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a time-homogeneous recurrent update by a sequence of parameterized maps f_t, and regularize late-time pairs of updates to approximately commute: applying block f_t followed by f_r should agree with applying f_r followed by f_t. This should make long-horizon predictions robust to local time-step reorderings and schedule perturbations, while proximal statistics provide a diagnostic for whether trajectories repeatedly approach one another rather than diverging permanently.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace rejection sampling or coordinate random walks for adversarial and augmentation perturbations in a convex feasible set with Hit-and-Run: choose a random direction through the current perturbation, compute the exact feasible chord, and sample uniformly on that chord. The paper's spectral-gap result predicts faster global exploration when the perturbation polytope is rounded or whitened, while preserving feasibility at every step.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn the paper's valid inequalities into an online cutting-plane procedure that focuses computation on currently inconsistent graph relations. Instead of penalizing every possible path or separator, repeatedly find violated inequalities under the network's soft predictions and feed only the top violations back into training.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the lifted convex hull as a training-time regularizer for pairs of nonnegative neural features, encouraging their empirical second- and third-order interaction statistics to lie in the paper's moment cone. This constrains correlations, squares, and cubic cross-moments jointly through PSD inequalities instead of merely penalizing large activations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Apply a weighted Caffarelli–Kohn–Nirenberg deficit to selected intermediate feature channels. The penalty discourages features that obtain large weighted responses only by becoming sharply localized or highly sensitive to small input perturbations. It can be evaluated with input-Jacobian estimates and added to the ordinary task loss.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Regularize probability-valued network outputs in the square-root representation rather than directly penalizing density curvature. This suppresses sharp oscillations while avoiding the severe scaling of derivative penalties involving \(\nabla\rho/\rho\) near vacuum regions.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace an ordinary elementwise interaction between two feature matrices by a noncommutative functional-calculus layer \(\varphi(A,B)\), where \(A\) and \(B\) are Hermitian channel operators that need not commute. Add a soft penalty on \([A,B]=AB-BA\), and use a Besov-smooth parameterization of \(\varphi\) so that perturbations are controlled in Schatten \(p\)-norm for \(p\leq2\). This creates a principled matrix interaction module that can remain stable when feature operators or graph…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the symmetric Euclidean contrastive loss between embeddings with a two-point quadratic contrast whose displacement is generated by a local affine connection and measured using the metric at the source endpoint. Because the metric and transport need not be compatible, the loss can be asymmetric, allowing the model to represent directional relations between examples.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace ordinary isotropic residual noise in a normalized continuous-depth block with projected Brownian forcing on the unit sphere. Apply a shared random symmetric quadratic drift to all tokens, plus a small token-specific tangent perturbation; the shared term preserves structured antipodal dynamics while the independent term removes persistent symmetry and cluster degeneracy. This is intended as a controlled stochastic regularizer, not merely additive Gaussian noise.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use spatially correlated training points whose low-frequency structure factor vanishes instead of iid points. For neural fields, PINNs, image-coordinate MLPs, or spatially indexed minibatches, this should suppress long-wavelength quadrature and gradient-estimation noise while preserving the represented target dynamics. The finite-order prediction is that a design with structure factor S(k)=O(|k|^{2q}) produces lower variance for smooth losses than iid sampling, especially as the domain or batch…
Useful5/10
Difficulty5/10
Novelty6/10