✗ Mechanism failed
2026
Replace an unconstrained input-dependent multiplier on a recurrent fast-weight state with a sign-preserving tanh gate. The new state retains an additive low-rank update and optionally a separately modulated innovation term, but the accumulated-memory branch can never be amplified by a factor whose magnitude exceeds one.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Attach an analytic geometry gate to a KAN or MLP so that known feasible regions, exclusions, and unions are represented by differentiable implicit functions instead of being learned only from samples. Use R-conjunctions for intersections and R-disjunctions for unions, then convert the signed support score into a soft gate that modulates the prediction.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Add a fractional Laplacian penalty to neural functions over binary inputs so that high-order coordinate interactions are damped according to \(|S|^\alpha\), rather than treating all Fourier degrees equally. The penalty is estimated with random continuous-time bit-flip perturbations, requiring only extra forward passes and no explicit Fourier transform. It is especially suited to models that overfit through high-order Boolean interactions while retaining useful low-order structure.
Useful7/10
Difficulty4/10
Novelty8/10
✓ Mechanism works
2026
Use the paper's inverse-temperature parameter to initialize networks containing m parallel depth-N branches. Choose branch count, depth, or an explicit aggregation scale so that beta = sqrt(2(N-1)/(n log m)) stays below the critical value sqrt(2), preventing the largest random branch from dominating the aggregate. This is applicable to residual multi-branch MLPs and other architectures whose block Jacobian is a sum of products.
Useful7/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace isotropic input-Jacobian regularization with a positive semidefinite, input-dependent metric learned jointly with the network. The metric uses diagonal scaling to suppress sensitivity in nuisance directions and a structured orthogonal rotation to discover combinations of input coordinates in which smoothness is task-useful.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace soft boundary penalties in neural operators with a hard projection onto a finite-dimensional span of homogeneous Dirichlet Laplacian eigenfunctions. Every projected hidden field is identically zero on the boundary, while increasing the number of retained eigenfunctions recovers the expressive capacity needed for operator approximation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use Adam normally, but periodically estimate the spectrum of the Adam-preconditioned Hessian and add a damped low-rank Newton correction when the preconditioned curvature is strongly ill-conditioned or the gradient is concentrated in flat directions. The correction is computed only in a small Lanczos subspace, so the method targets cross-coupled ill-conditioning without materializing or inverting the full Hessian.
Useful7/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a Gaussian regression likelihood with a chart-pulled exponential-family head. The network predicts a natural parameter eta, while each target y is mapped to a bounded probability coordinate u=G(y). Because the sufficient statistic T(u) is bounded, extreme targets cannot create arbitrarily large parameter gradients. The chart determines the tail class, while eta controls the distribution in probability space.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
For bandlimited or progressively higher-frequency targets, construct a nested random Fourier layer whose frequency window grows according to the paper's bandwidth laws instead of sampling all frequencies from one fixed range. Train with a low-bandwidth subset first, then activate additional frequency blocks. This creates a mathematically motivated spectral curriculum and may reduce early optimization difficulty while preserving high-frequency accuracy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense Gaussian random-feature layer by a sparse Poisson-chaos layer with the same learned kernel, and penalize the layer's normalized fourth add-one energy. The penalty suppresses rare single-atom jumps, so the sparse layer approaches the Gaussian same-kernel representation in Wasserstein distance while preserving computational advantages from sparse Poisson sampling.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Parameterize a scalar or vector implicit neural field on each spatial cell with Bernstein polynomials and constrain its coefficients instead of sampling many points to enforce output bounds. The Bernstein convex-hull property gives a deterministic pointwise bound everywhere in the cell, making the method useful for neural fields representing densities, concentrations, masks, or material parameters.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Insert a fixed expander channel before a covariance-dependent feature transformation. The channel repeatedly conjugates the feature covariance by a constant number of sparse Pauli/CNOT unitaries, preserving total feature energy while contracting anisotropic covariance components. Use the mixed covariance for whitening or as a regularized normalization statistic, and test whether it gives more stable training than dense whitening or an explicit isotropy penalty.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a multiscale Besov penalty to the output of a shallow ReLU^k network, targeting the smoothness threshold that the paper proves is sufficient for finite ridge-variation representation. This suppresses pathological high-frequency output while preserving low-frequency approximation, providing a principled alternative to ordinary parameter weight decay.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Partition a neural network into heterogeneous parameter blocks or maintain several worker replicas, and model each block's optimizer state as a constrained linearized dynamical agent. At every synchronization interval, jointly optimize a finite sequence of parameter updates and a feasible common terminal parameter target, while enforcing consensus through distributed primal-dual iterations. Unlike ordinary gradient descent toward a fixed or implicit target, the target is selected together with…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Parameterize an orthogonal or semi-orthogonal neural weight matrix directly on the Stiefel manifold and update it with a Cayley retraction instead of unconstrained SGD plus a penalty or QR projection. The update preserves orthogonality exactly, is second-order accurate for the appropriate metric, and avoids the cubic QR factorization at every optimizer step.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a dense token-mixing, MLP, or low-rank-adapter projection with a Bernoulli-signed sparse matrix normalized by the paper's predicted operator scale. Estimate the active representation dimension and use the effective scale to detect regimes in which extreme sparsity is likely to cause unstable amplification or dead rows.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a neural controller's pointwise action outputs over a finite horizon with Bernstein control points whose convex hull satisfies actuator and trajectory constraints. The network predicts the control points, while a robust margin accounts for bounded tracking or model-prediction error, making continuous-time actuator feasibility checkable from finitely many inequalities.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a generative or recurrent neural architecture with several contractive or mildly expanding branches, and explicitly control the geometric complexity of its invariant set using the sub-additive singular-value pressure of branch-Jacobian products. Instead of regularizing only the operator norm, the model can preserve anisotropic directions while targeting a desired attractor dimension, potentially improving coverage of structured data without uncontrolled folding or collapse.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
For a neural network predicting A coupled concentration or density fields, decompose Fourier-space fluctuations into a charge direction and its charge-neutral composition subspace. Hard-project the predicted fields to eliminate the global charge mode, and regularize their low-wavenumber covariance so that neutral modes retain finite susceptibility while the charge structure factor follows the Coulombic suppression S_ZZ(k) proportional to k squared. This should improve long-range physical…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a neural representation so that no one-dimensional projection places too much probability mass inside a narrow interval. This transfers the paper's uniform tube estimate into an anti-collapse constraint, making representations robust to adversarial directions and preventing hidden features from becoming effectively low-dimensional.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent binary nuisance variables or augmentation bits as coordinates of a Hamming cube and penalize the model response that remains predictable from a random k-coordinate subset. Use the theorem's derivative-plus-global-norm certificate as the regularizer, retaining its p/log p dependence instead of using an arbitrary masking penalty. Random coordinate permutations provide a cheap stochastic approximation to the subset average.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build actuator or parameter constraints directly into the neural controller using a differentiable hard-saturation map rather than penalizing violations after the fact. This makes the Lyapunov certificate apply to the actual bounded controller and prevents training from exploiting unrealistically large actions.
Useful6/10
Difficulty3/10
Novelty4/10
Unverified
2026
Parameterize a complex linear layer as a product of sparse triangular network factors whose positive modulus version is totally nonnegative. The layer can use phase cancellation for expressive transformations, while selected minors remain bounded by explicitly computable positive minors, giving a structured alternative to unconstrained dense complex weights.
Useful6/10
Difficulty6/10
Novelty7/10