✓✓ Beats tuned baseline
2026
Represent the PINN solution in a restricted polynomial or Taylor basis whose exponent set is supplied by tropical support analysis, instead of asking an MLP to discover the local series structure from scratch. The restriction removes coefficients that cannot occur in the formal solution, reducing trainable degrees of freedom and preventing spurious low-order or singular terms.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace fixed-strength projection or constraint-repair steps during low-rank neural fine-tuning with a regularized affine subproblem whose damping is proportional to the current distance from the model manifold. Use strong damping when a gradient update leaves the low-rank manifold substantially, then automatically remove the damping near a clean intersection so that the method can recover higher-order local convergence. This is suitable for LoRA-style updates, structured matrix compression…
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Bootstrap the optimizer curvature scale from a deliberately nondegenerate pair of gradient queries, then perform steepest descent in lp geometry with a local secant backtracking rule. The method does not require a supplied learning rate, smoothness constant L, initial distance R, or optimum value f*, and it automatically uses the dual norm associated with p.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace dense grid tokens or global spectral features with coefficients of compactly supported kernels centered on a nested hierarchy of spatial points. Encode an input field into coarse-to-fine coefficients, apply a neural map to those coefficients, and decode the predicted coefficients at arbitrary query locations; the contribution from each level provides an explicit multiscale output decomposition.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Prune higher-order tensor or polynomial interactions while preserving an exchange-closed support instead of independently retaining the largest weights. The resulting sparse interaction pattern avoids arbitrary holes and retains structured substitutions between coordinates, potentially improving parameter efficiency and robustness after pruning.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Regularize a scalar network output so that its superlevel sets are approximately quasiconcave in input or latent space. Instead of penalizing the full Hessian, penalize positive curvature only in directions orthogonal to the output gradient, matching the paper's projected-Hessian and weighted 1-Laplacian structure.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace ordinary per-coordinate activation normalization or covariance whitening with a learned or frozen affine map based on a minimum-volume ellipsoid calibrated to the activation convex hull. Estimate the hull's Minkowski symmetry and use the bound \(\rho=\sqrt{d/\alpha}\) to set a principled clipping radius, where \(d\) is feature dimension and \(\alpha\) is the measured symmetry. This should reduce worst-case clipping of asymmetric activation distributions without requiring a much larger…
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Add a differentiable penalty that encourages a neural implicit field to have a controlled local homogeneity degree across concentric spatial scales. The penalty compares the flux-normalized frequency at adjacent radii, optionally targeting a desired degree k, so the network is discouraged from producing scale-inconsistent or oscillatory local geometry.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace two unconstrained scalar quadratic feature heads with a pair whose quadratic forms admit a positive-definite linear combination. This prevents the two heads from simultaneously vanishing on any nonzero hidden vector, which can reduce representation collapse and improve the conditioning of downstream gates or auxiliary objectives. The constraint can be implemented softly with a spectral-margin penalty, or exactly by parameterizing one learned pencil as positive definite.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
For a coordinate-based neural network u_theta(x) solving a fully nonlinear second-order PDE, replace the raw quadratic-Hessian residual with the concave, homogeneous operator G(D_x^2 u_theta)=sqrt(sigma_2(D_x^2 u_theta)). Add differentiable barriers that keep the predicted Hessian inside the positive branch Gamma_2, preventing optimization from entering regions where the PDE operator is non-elliptic.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a regularizer that rewards each neuron's expected absolute response to random sign perturbations, normalized by the neuron's l2 norm so ordinary weight scaling cannot trivially increase the objective. Use the paper's distance-sensitive Khintchine lower bound to penalize filters close to the two-coordinate extremal set, promoting distributed and perturbation-stable feature extraction.
Useful5/10
Difficulty3/10
Novelty8/10
Unverified
2026
Insert an overcomplete sparse feature bottleneck into an MLP or embedding stream: encode an activation h with z = ReLU(W^T h + b), then reconstruct or continue computation from Wz. Normalize dictionary columns and train them to remain nearly tight and low-coherence, while choosing a negative bias from an estimate of worst-case cross-feature interference. The hypothesis is that this gives cleaner, more stable feature supports than an ordinary L1 sparse autoencoder at the same latent width.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Construct a Fourier layer whose active frequencies lie on several nonparallel polygonal patches or thin annular sectors, and cap repeated difference vectors generated by pairs of patches. The bounded-multiplicity geometry limits how many input frequency pairs can contribute to the same output frequency, potentially reducing spectral aliasing and gradient variance in nonlinear Fourier mixing.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a neural approximation to a scale-dependent effective action, energy functional, or field while penalizing the residual of a known continuous-symmetry Ward identity. Select the regulator, smoothing scale, or architecture hyperparameter at the minimum Ward residual, and require that the residual decreases when model capacity or derivative-expansion order increases.
Useful5/10
Difficulty5/10
Novelty7/10
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 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
When a neural field learns power-law exponents, penalize exponent configurations whose Newton support violates the paper's finite-distance accessibility condition. This discourages combinations of exponents that create excessively strong joint singularities while preserving anisotropic scaling when it is supported by the data.
Useful5/10
Difficulty3/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
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
For a neural model predicting a scalar response as a function of a continuous dynamical parameter, replace an unconstrained MLP output head by an analyticity-constrained spectral head. Train it on observations covering a positive-measure subset of the parameter interval and regularize the remaining coefficients so that the learned response satisfies a quasi-analytic derivative-growth bound; the intended benefit is reliable continuation from sparse parameter coverage rather than ordinary…
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Group neural features into small Hermitian matrix elements and scale each group with the paper's tracial spectral Lp norm rather than independently normalizing scalar channels. This introduces a coupled spectral geometry while remaining implementable with ordinary eigendecompositions in the associative Hermitian-matrix special case.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Whiten intermediate feature vectors and constrain several gauge moments to remain in the dimension-dependent interval predicted by the paper's Gaussian/log-concave comparison. Apply the penalty only to moderate orders, where the paper gives a uniform bound independent of the particular log-concave distribution; this should suppress heavy activation tails without forcing all features to be exactly Gaussian.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Add the paper's joint shape-and-mass distortion objective to a neural coordinate map whose output is a three-dimensional latent representation. Penalize anisotropic local Jacobians through a log-distortion term and penalize nonuniform latent occupancy through a density-gradient term, while learning the radii of an ellipsoidal latent target domain. This should discourage folds and collapsed regions without forcing every dataset into a fixed spherical latent prior.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a symmetric feature-interaction or Jacobian matrix A_theta whose desired rank is t, then regularize its t-th compound matrix toward rank one. This transfers the paper's identity that a rank-t matrix has a rank-one t-th compound, while the rank-one factor encodes Plucker coordinates of the kernel subspace.
Useful5/10
Difficulty6/10
Novelty8/10