✓✓ Beats tuned baseline
2026
Replace gradient updates for one branch's final linear layer at a time with an exact ridge least-squares solve while holding the other branches, trunk, and hidden layers fixed. The method applies to any model whose output is a sum of products of branch factors and a trunk factor, including MIONets and tensorized neural networks.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a weight-tied residual or neural-ODE stepper with an explicit Runge–Kutta method satisfying the reused-last-stage conditions. The final derivative is evaluated at the exact endpoint and becomes the first derivative of the next step, saving one expensive neural-vector-field call per step while preserving the designed integration order.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace selected dense neural-network operators by low-rank factors whose rank is selected by a randomized residual test at a user-specified tolerance. Construct candidate bases in large blocks for efficient matrix operations, then prune the block to the smallest rank that passes the residual criterion instead of treating the block size as the final rank.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a high-order feature tensor as a tensor train and replace a dense global feature transform by a truncated polynomial in a learned nearest-neighbor operator. The block computes a short Krylov expansion, p_m(A)x = sum from k=0 to m of c_k A^k x, compressing back to a fixed TT rank after each operator application; locality is intended to prevent rank growth from scaling with the total number of tensor sites.
Useful7/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's finite-width O(n^{-1/2}) Gaussian-process approximation bound as a width-budgeting rule rather than choosing every hidden dimension uniformly. Estimate an architecture-specific constant for each layer or attention contraction, then allocate width according to the smallest dimension satisfying its allowed distributional error. This should produce narrower models at comparable GP-like behavior, or permit the same parameter budget to be concentrated in the layers where finite-width…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a dense multiresolution voxel or hash-grid encoder with an omnitree-like anisotropic feature partition. Each cell stores a vector-valued scaling feature and its children are introduced only when local Haar detail energy is large; coarsening replaces children by their mean, so compression does not introduce an arbitrary offset. Splitting can be restricted to the coordinate whose one-dimensional detail coefficient is largest, allowing thin structures to receive resolution only in the…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Represent the physical wavefunction as a fixed cusp factor multiplied by a neural residual, rather than forcing the network to learn Coulomb singularities from data. Use cutoff distance features so the factor is nontrivial only near coalescences and remains numerically bounded at long range. The residual should have substantially lighter Fourier tails and therefore require less network capacity to attain a given energy or local-energy accuracy.
Useful7/10
Difficulty4/10
Novelty6/10
✗ 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
✗ Mechanism failed
2026
Replace the dense decoder of an overcomplete activation autoencoder with a fixed left-d-regular expander mask and learn only the nonzero decoder values. Tie the encoder to the transpose of this sparse decoder, preserving the activation dimension m, latent width n, and TopK sparsity k while reducing learned dictionary parameters from mn to dn.
Useful7/10
Difficulty5/10
Novelty7/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
Build a sequence or graph module whose state is a canonical set of affine tropical pieces rather than an opaque hidden vector. Compose consecutive segments by Minkowski addition of their lifted supports, merge alternatives by union followed by lower-hull reduction, and evaluate the resulting piecewise-linear function with a minimum.
Useful7/10
Difficulty7/10
Novelty8/10
Audited (legacy)
2026
Replace uniform embedding dimensions with a globally budgeted allocation based on the estimated spectral complexity of each categorical feature. Tables whose category representations have large leading singular-value energy receive more dimensions, while high-cardinality tables are penalized because each extra dimension consumes more parameters.
Useful7/10
Difficulty4/10
Novelty6/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
✗ Mechanism failed
2026
Replace an opaque MLP vector field with a stack of trainable symbolic primitives that can express linear terms, monomials, products, and related analytic operations. Apply an L1 penalty and prune small primitive coefficients after rollout training, yielding a compact dynamics module that is cheaper to evaluate and easier to inspect.
Useful7/10
Difficulty6/10
Novelty6/10
Unverified
2026
Propagate uncertain inputs or parameter perturbations through a neural network with zonotopes, and choose the reduction rule after each layer using short lookahead that predicts downstream certified-bound error. Candidate reducers can include largest-generator retention, box conversion, and norm-based merging; unlike a fixed policy, the chosen rule depends on the current generator geometry and remaining network depth. The goal is tighter robustness bounds at the same generator budget, or the…
Useful6/10
Difficulty6/10
Novelty7/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 finite-dimensional latent prior for fields or trajectories with a continuous flow acting on function coefficients in a separable Hilbert space. A Gaussian reference with an explicit covariance spectrum is transformed by a learned vector field, so the model can represent smooth, non-isotropic function distributions while sharing parameters across discretization resolutions.
Useful6/10
Difficulty6/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