✗ Mechanism failed
2026
Replace ordinary hidden-weight decay with a recursive ℓ1 variation penalty on the coefficients used to combine activated functions from the previous layer. Use normalized activations \(\sigma_s(t)=\sigma(st)/s\) so that the learned scale parameter \(s\) controls feature shape separately from the coefficient magnitude charged by the variation norm.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace an unconstrained scalar activation or nonnegative gate with a finite positive mixture of rational Bernstein basis functions. The learned function is monotone and concave on the nonnegative half-line, while its derivatives have controlled alternating signs; this can prevent pathological feature amplification and gives an interpretable shape prior. Use the paper's sharp exponent restriction τ≤1/2 rather than treating the power as an arbitrary hyperparameter.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Insert an active-set reduction step into a binary energy layer or Hopfield-style discrete optimizer. Coordinates whose signs are stable and whose local fields have a rigorous margin are frozen, while their interactions are folded into an induced bias and only the unresolved tail is updated. This preserves the exact conditional quadratic objective and can reduce dense interaction cost substantially when the state becomes polarized.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Represent each latent state as a Heisenberg-group element and replace Euclidean interpolation in an upsampling or recurrent transition block by a four-point horizontal refinement plus the exact central signed-area correction. The module preserves the geometry of noncommutative composition, allowing the central latent coordinate to encode path-dependent information that ordinary coordinate-wise interpolation discards.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Regularize a learned state-space transfer function so its matrix response has positive real part on sampled points in the unit disk and its associated reproducing-kernel Gram matrix is positive semidefinite. This provides a frequency-domain stability signal that complements rollout-based penalties and spectral-radius clipping.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a generic recurrent transition with two coupled unitary transitions that share one block column and differ by a sign on the other block column. Each transition preserves hidden-state norm exactly, while the structured difference gives a controlled two-path recurrent architecture for long-context modeling.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace an unconstrained latent transition by a layer with a distinguished scalar coordinate \(t\) and a symplectic leaf state \(x=(q,p)\). The layer advances \(t\) through a Reeb drift while updating \(x\) with a symplectic Hamiltonian step, preventing arbitrary mixing between progression and content coordinates and potentially improving long-horizon stability.
Useful6/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Choose gradient clipping thresholds from an explicit worst-case tail probability implied by an observed kurtosis bound, rather than using a fixed norm threshold or an empirical percentile. For a standardized centered gradient coordinate, the threshold achieving target outlier probability \(\delta\) is obtained by analytically inverting the paper's sharp tail formula.
Useful6/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add a learned Riesz-transform branch that extracts normalized spatial gradients after diffusion by a positive parabolic operator. The diffusion branch carries smooth semantic content, while the Riesz branch represents boundaries, motion changes, and graph discontinuities. Resolvent smoothing makes the derivative branch less sensitive to feature noise than directly applying a finite difference.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Construct a sparse attention or message-passing graph as a gain graph, where every directed edge carries a relative frame label and reverse edges carry the inverse label. Grow the graph using the paper's 2-extension operation: replace two old edges by a new vertex connected to their four endpoints, while preserving the relative gain products. The resulting mask is intended to preserve global information flow under controlled sparsity and to avoid isolated components and brittle bridges commonly…
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Extract a small set of stable exponential modes from an observed neural sequence and use them to initialize a diagonal or block-diagonal state-space model. Hankel-pencil eigenvalues propose the modes, while persistence across shifts and contour margins reject modes caused by noise or a short-lived background.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace long unrolled trajectory losses with a direct invariance loss on a Fourier parameterization of a quasiperiodic latent torus. The network is trained to make its vector field tangent to the learned torus at every phase, providing a compact global constraint that can stabilize neural ODEs intended to model oscillatory or quasiperiodic dynamics.
Useful6/10
Difficulty5/10
Novelty9/10
✗ Mechanism failed
2026
Apply the paper's orthogonal-sketch idea to a trainable low-rank weight update or low-rank optimizer state. After every optimizer step, use a row sketch and Cholesky QR to recondition the factor basis, then compute the update with the standard tangent-space projector rather than an oblique sketched projector.
Useful6/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build an input-conditioned unitary transformation as an ordered product of exponentials of anti-Hermitian matrices, with each factor controlled by a univariate function of one input coordinate or one learned scalar projection. This replaces a dense multivariate matrix-valued controller with separable scalar nonlinearities while preserving exact unitarity at every forward pass.
Useful6/10
Difficulty6/10
Novelty7/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 confirmed, baseline not beaten
2026
Constrain a neural parameter block to a bounded open domain and replace its Euclidean optimizer with a Riemannian gradient induced by the Hessian of the logarithmic barrier g=-log(-rho). The metric diverges near the boundary, so updates automatically become small when parameters approach saturation or an invalid region, while the logarithmic exhaustion has bounded intrinsic gradient.
Useful6/10
Difficulty5/10
Novelty6/10
✓ Mechanism works
2026
Replace a flat MoE or graph-pooling assignment with recursive partitions selected by interaction evidence after removing each item’s expected degree effect. Tokens, nodes, or examples that are frequently active for purely popularity-related reasons should not automatically form an expert or cluster. Recursion stops when a candidate split has nonpositive degree-corrected evidence, producing an adaptive hierarchy rather than a fixed number of equally sized groups.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Model the scalar feedback route in a recurrent layer as a rank-one perturbation of its open-loop transition. Regularize the frequency response of that route so that no mode reaches unit loop gain, directly targeting oscillatory and slowly decaying instabilities rather than relying only on gradient clipping.
Useful6/10
Difficulty6/10
Novelty6/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
Represent a solution on an unfitted domain with local neural subnetworks and train them using one augmented energy containing the bulk physical energy, symmetric Nitsche boundary or interface terms, and a derivative-jump ghost penalty. Automatic differentiation of this scalar objective supplies all gradients and avoids independently tuning inconsistent PDE residual, flux, and boundary losses. The method is especially suited to moving geometries, cut-cell domains, and domain-decomposed neural…
Useful6/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
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
△ Mechanism confirmed, baseline not beaten
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
✗ Mechanism failed
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