Unverified
2026
Add a sparse, interpretable fractional-dynamics layer to a neural world model: candidate terms are evaluated through weak projections, while both their support and continuous derivative orders are selected by validation error versus model complexity. This avoids forcing the model to choose from a dense fixed dictionary containing many nearly collinear fractional orders.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's explicit approximation bound to select the output-head regularization strength as a function of measurement resolution. Rather than applying fixed weight decay across meshes, increase or decrease regularization so that discretization error and shrinkage error remain balanced.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace raw Pearson correlation when evaluating a temporal neural predictor with a score measuring how many null standard deviations its Fisher-transformed correlation exceeds. Estimate the null scale from a small set of time-misaligned predictions, then reuse it across context lengths or checkpoints. This prevents models from being rewarded for predicting statistically easy, low-information features and gives a more comparable validation signal across datasets and targets.
Useful6/10
Difficulty3/10
Novelty8/10
Unverified
2026
Replace raw polynomial or Fourier-like features in a small MLP with basis functions orthonormal under a Sobolev inner product that jointly measures feature magnitude and input derivative magnitude. This explicitly controls feature smoothness while preserving decorrelation, potentially improving conditioning and reducing the need for large derivative-regularization coefficients.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace eigenvalue-only stability checks for a continuous-time recurrent or state-space layer with an explicit finite-horizon transient-growth test. Penalize state matrices that have small spectral decay but large induced norms of exp(tA), exp(tA^{-1}), or their discretized transition operators. This targets the paper's phenomenon in which a system is exponentially stable in continuous time yet numerically and inversely unstable because its eigenbasis is highly conditional.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Constrain the numerical range of a learned recurrent or state-space transition matrix instead of constraining only its eigenvalues or singular norm. The resulting Crouzeix certificate controls every polynomial time filter, including multi-step powers and residual propagation, and is designed to suppress transient amplification caused by nonnormality.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a neural deformation of a mesh or simplicial graph by vertex positions \(f\), and constrain every oriented simplex to retain positive signed volume. Add a logarithmic barrier during feasible optimization and use a feasibility-restoration phase for initially inverted elements, turning foldover prevention into a hard geometric invariant rather than a soft penalty.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Equip a latent world model with a learned positive-definite state-dependent metric and penalize violations of one-step contraction under the predicted dynamics. Use the paper's metric-geodesic energy as an auxiliary consistency loss between clean and perturbed latent rollouts, making the model more robust to observation noise and compounding prediction errors.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a standard preconditioned gradient update by a scalar-auxiliary-variable update that evolves both the parameters and a scalar representing the nonlinear part of the loss. The discrete-gradient/SAV construction gives an exact decrease of a modified training energy for each deterministic batch, preventing overshoot and long transient energy growth while requiring only a diagonal or block-diagonal linear solve.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a learned latent transition not merely to fit one-step data, but to require only a small operator correction before its selected spectral modes become exact eigenmodes. The correction is a measurable backward error, so the regularizer penalizes models whose apparent eigenstructure is highly sensitive to noise or finite-sample error. At inference time, the correction norm can trigger conservative rollout or mode suppression.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a fixed Adam update by an embedded Bogacki–Shampine RK3(2) proposal with a genuine accept/reject controller. Measure error between the two actual Adam parameter maps, rather than only between raw gradient estimates, and charge every gradient evaluation against the training compute budget.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a fixed or heuristic noise-annealing schedule with one constrained by the FPU freeze-out scaling. In stochastic gradient Langevin dynamics, reduce the injected temperature slowly enough that residual parameter fluctuations remain below a target floor; if cooling is too fast, the optimizer should retain a measurable nonequilibrium variance analogous to the FPU residual energy.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a feature transformation that approximates the derivative of a fractional diffusion operator with respect to its order. Instead of only smoothing features with one fractional order, the layer exposes whether a feature changes rapidly across spatial scales, which can help with textures, edges, and multiscale patterns.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a differentiable layer that maps a polygonal contour or predicted segmentation polygon to high-order complex Zernike moments using exact edge integrals instead of pixel-center sums. Feed the resulting moment vector to a classifier or use it as an auxiliary shape-consistency loss, making the representation insensitive to raster resolution and reducing high-order aliasing.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use multiple independently initialized training replicas to detect discontinuous transitions in the learned state as a hyperparameter changes. A saddle-node event is identified when two locally stable or unstable solution branches collide, producing an abrupt jump in a validation-relevant order parameter; pseudo-arclength continuation can map this event and choose a hyperparameter path that avoids catastrophic branch loss.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a differentiable regularizer to neural networks that learn sparse Fourier coefficients or trainable Fourier-feature frequencies. It penalizes predicted energy just outside the training interval when that energy exceeds the theorem-shaped envelope relative to observed in-domain L2 energy, discouraging cancellation patterns that fit the observed interval but explode nearby.
Useful6/10
Difficulty3/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Augment neural-network parameters with momentum variables and update the pair using a symplectic map generated by a Hamiltonian. The optimizer approximately preserves a modified Hamiltonian, reducing systematic energy drift and potentially making long unrolled optimization more stable.
Useful6/10
Difficulty4/10
Novelty4/10
✓✓ Beats tuned baseline
2026
Transform local neural residuals into the Ripa model's characteristic coordinates before spatial aggregation, apply a mode-dependent gate based on neighboring characteristic jumps, and transform back. This lets the model damp oscillatory acoustic or equilibrium-mode corrections near discontinuities without globally smoothing every feature.
Useful6/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a spatially weighted TV penalty to a neural inverse solver, where a pixel receives a large penalty when perturbations there are strongly visible to the forward operator and a small penalty when the operator is insensitive. This prevents ordinary TV from suppressing or displacing structures differently across the field of view. The weight can be recomputed per acquisition geometry or cached for a fixed forward operator.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace standard heavy-ball momentum with an update derived from a discrete kinetic-minus-loss action and a discrete viscous force. The force discretization produces a rational damping factor that remains controlled over a specified range of step sizes, potentially reducing oscillations and instability without Adam-style second-moment state.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
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
✗ Failed on benchmark
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
✗ Mechanism failed
2026
Insert a weighted negative-semidefinite fourth-order mixing operator into a residual or state-space layer. Instead of learning an unconstrained token-mixing matrix, parameterize its dissipative component as Q = -a W^{-1} B^T W B, ensuring that this component cannot increase the chosen weighted feature energy. Use a boundary-aware finite-difference matrix B along the sequence axis, optionally with learnable banded coefficients while preserving the factorization.
Useful6/10
Difficulty5/10
Novelty5/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