Unverified
2026
For a fractional Dirichlet problem, replace a free coordinate network N_theta(x) with u_theta(x)=d(x)^a N_theta(x), where d(x)=dist(x,boundary) and 0<a<1 is the fractional order. Train the regular quotient v_theta=u_theta/d^a=N_theta and use a weighted gradient loss that reflects the paper's boundary estimate.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace an unconstrained softmax gate over a finite set of neural experts with exponential weights whose temperature is chosen to satisfy the paper's explicit stability condition. The goal is to prevent low-temperature expert collapse while retaining the model-selection rate when the expert losses are bounded and strongly convex in the prediction.
Useful6/10
Difficulty4/10
Novelty3/10
Unverified
2026
Use the paper's non-permutation-invariant overshoot bound as a runtime guard for large learning rates. A proposed step is accepted only if its predicted overshoot contribution is compatible with the observed gradient residual; otherwise the optimizer clips or shrinks the step, preventing isolated very large updates from causing delayed divergence.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the observed power-law decay of a scalar training signal to estimate the effective fractional order of the optimization dynamics, instead of choosing the memory exponent by hand. Then run a fractional-memory optimizer with the estimated order, allowing the algorithm to use stronger long-range memory during slow plateaus and weaker memory when the loss relaxes rapidly.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Augment a CNN with a nonlocal feature-gradient branch that compares each feature vector with a kernel-weighted neighborhood rather than using only pointwise or local convolutional interactions. Regularize this branch using the paper's Fourier multiplier energy, which penalizes feature oscillations according to the kernel spectrum and approaches an ordinary local-gradient operator as the interaction radius tends to zero.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Use the divergence's data-processing principle as a consistency objective between predictions before and after a stochastic augmentation or feature bottleneck. Penalize disagreement under transformations while retaining the asymmetric power-law weighting of the r-deformed divergence.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace cross-entropy or ordinary Renyi loss between a target distribution and a model distribution with the paper's r-deformed alpha-z divergence. The deformation parameter r provides a controllable power-law alternative to the logarithm, allowing experiments that emphasize hard, low-probability target events differently from standard log losses.
Useful6/10
Difficulty3/10
Novelty6/10
✗ Mechanism failed
2026
Replace the ordinary gradient of a spatially indexed parameter tensor by a Fourier-domain inverse-metric gradient. FFT the gradient over its spatial dimensions, divide every frequency by a positive spectral symbol, inverse FFT, and then apply the optimizer step. Use a Bessel/Sobolev symbol as a parameter-free baseline and optionally estimate a task-specific symbol from gradient power spectra.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a dense channel or token-mixing matrix with a product of positive bidiagonal factors, so information propagates through a controlled sequence of local couplings rather than arbitrary signed interactions. Initialize the factors from the paper's barycentric-subdivision factorization, then learn positive diagonal and off-diagonal parameters; the resulting map is structured, parameter-efficient, and constrained to remain totally positive.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Train an unconstrained branch and a geometry-aware branch in parallel, then learn how much to trust the analytic branch. This preserves the benefit of explicit geometry on correctly specified tasks while allowing the model to ignore a misleading or irrelevant prior.
Useful6/10
Difficulty3/10
Novelty7/10
Unverified
2026
Add a conservative correction after low-rank tensor compression so selected linear moments of an activation or learned state are exactly preserved. This can reduce tensor rank and memory without allowing compression error to accumulate in physically meaningful global quantities.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a generic neural constitutive law or energy model with an ICNN that consumes the positive singular values of a deformation-like matrix and is convex and coordinatewise nondecreasing in those inputs. Train it as a lower approximation to a nonconvex target energy, so the network acts as a computationally cheap sufficient polyconvex-envelope surrogate rather than merely interpolating unstable samples.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Train a neural field to represent a sphere-valued phase or feature map with a prescribed codimension-two defect set. Add a fractional Sobolev energy to suppress high-frequency oscillations, but enforce topology through a discrete Jacobian or winding-current loss so that smoothing cannot remove holes, filaments, or vortex defects.
Useful6/10
Difficulty5/10
Novelty7/10
✓ Mechanism works
2026
Replace unconstrained per-frequency recurrent dynamics in a Fourier neural operator or spectral state-space model with oscillators initialized from the plasma dispersion relation \(\omega_k=\sqrt{\underline{b}^{2}+|k|^{2}}\). Each Fourier mode first undergoes a norm-preserving rotation at its prescribed frequency, while a small learned residual and optional nonnegative damping account for task-specific dynamics. This should reduce phase drift and exploding or vanishing activations when modeling…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
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
Unverified
2026
Treat a coupled neural training loop as a delayed feedback system with two hard delays and two first-order implementation filters. Estimate the dominant coupled Jacobian mode and use the characteristic equation to distinguish a recoverable delay-induced oscillation from a filter-induced instability; then reduce stale-gradient delay only in the former case, and slow or retune EMA or relaxation filters in the latter.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Track the implicit l2 regularization induced by adversarial SGD and explicitly correct it when the optimizer drifts toward an undesirable ridge strength. Apply the correction first to the final linear head or a low-dimensional adapter, where feature covariance and ridge estimates are tractable.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained feature vector entering a rational or resolvent-like neural operator by a polynomial feature whose first nonzero Taylor coefficient lies in a pole-safe subspace. For a pole of order m, the simplest guaranteed construction is psi(z)=(z-beta)^m v, which makes Q(z)psi(z) bounded even when Q(z) diverges. For lower-order cancellation, solve linear constraints among Taylor coefficients of psi so that all negative Laurent powers vanish.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Insert a scalar flux-correction-style limiter after a neural operator predicts a conservative state or residual. Interpolate between a known-admissible baseline state and the learned high-order candidate, choosing the largest coefficient that satisfies a geometric family of linear inequalities encoding positive density, positive pressure, and subluminal velocity. This retains as much of the neural prediction as possible instead of independently clipping physical variables.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a classifier on binary or categorical-product inputs with the minimum-norm discrete flow whose divergence matches the model's cube Laplacian. Unlike a direct edge-sensitivity penalty, the flow can route mass nonlocally and combine coordinate changes through an L2 norm, potentially preserving useful interactions while suppressing unstable decision boundaries. The regularizer should be applied to logits or probabilities and combined with the supervised loss, not used alone.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
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
Unverified
2026
Replace a free-form order-dependent gate with a positive mixture of Mellin powers $(1+s)^{-a}$. This gives a small, interpretable module whose response across the order variable is automatically generated by a positive measure and therefore inherits complete monotonicity, log-convexity, and Hankel-moment structure.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Regularize a neural network's response along an ordered variable by requiring its sampled values to form a positive Hankel moment sequence. This upgrades ordinary pairwise monotonicity or log-convexity penalties into simultaneous constraints on several higher-order interactions, while remaining differentiable and inexpensive for small Hankel order.
Useful6/10
Difficulty3/10
Novelty8/10
Unverified
2026
Attach predictive distributions to successive information-update steps of a recurrent, state-space, iterative, or diffusion model and penalize violations of the measure-valued martingale condition. The model may become more certain as information arrives, but its later forecasts must not exhibit systematic conditional bias relative to earlier forecasts.
Useful6/10
Difficulty4/10
Novelty6/10