✗ Mechanism failed
2026
Use the diffusion graph's Dirichlet energy and almost-isometry inequalities to score whether a candidate minibatch preserves the low-frequency structure of losses, logits, or gradients over the dataset. Reject or augment batches that distort these quantities, producing a geometry-aware batch acceptance rule rather than relying only on random or loss-based sampling.
Useful6/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add a deterministic, branch-length-aware fingerprint to a rooted-tree neural encoder using the paper's symmetric product recursion. The fingerprint distinguishes child multisets structurally and incorporates every edge length, providing information that ordinary sum or mean message passing can lose.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Insert a differentiable spatial canonicalization module before a neural dynamics model. It estimates a smooth invertible coordinate transformation that places each input field in a common gauge relative to a reference template, predicts the next state in that gauge, and maps predictions back to the original coordinates. The module should reduce the need for the dynamics network to relearn identical laws under many smooth spatial reparameterizations.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Represent each k-element object by a vector in dimension \(r=\binom{n-2(k-s)}{s}\), and use a PSD Gram matrix to encode the rule that pairs with intersection smaller than s have zero similarity while pairs with intersection at least s have nonzero similarity. Insert this representation into set encoders, graph neural networks, or overlap-aware attention instead of allocating one feature for every s-subset.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a dense recurrent transition matrix with a periodic CMV-style product of alternating local 2x2 unitary cores. The transition is exactly norm-preserving, has O(n) trainable parameters under periodic tying, and can be applied through local factor operations rather than stored as an n-by-n matrix. Use turnover refactorization when changing the ordering or boundary connection of cores, enabling a compact cyclic unitary state-space layer.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a fixed soft-threshold, ReLU-like gate, or manually chosen activation shrinkage with a monotone learned shrinkage function fitted by an observed-data quadratic-risk criterion. The gate can interpolate between identity, ridge-like attenuation, hard thresholding, and lasso-like soft thresholding, allowing each layer or channel group to adapt its bias–variance tradeoff from the current minibatch.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the usual linear predictor in continuation of an implicit neural state with a fractional-power predictor fitted from recent states, then correct the prediction using a pseudo-arclength constraint. This is designed for equilibrium layers, implicit sequence models, or homotopy training schedules where the state Jacobian becomes nearly singular and ordinary Newton correction or fixed-point iteration becomes unstable.
Useful6/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed or hand-tuned learning-rate schedule with a slowly exponentially increasing schedule, and restart the schedule whenever the update norm grows at least as fast as the schedule itself. The restart preserves the current parameters but resets the learning-rate multiplier, allowing the optimizer to repeatedly approach the largest locally stable step size without requiring a Hessian spectrum or a reliable initial learning-rate guess.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Add a training-time regularizer that keeps the empirical joint covariance of hidden activations on multiple inputs close to the recursively predicted NNGP covariance. The regularizer targets the finite-width fluctuations quantified by the Wasserstein result, and is particularly appropriate for recurrent networks and attention blocks with shared weights, where hidden states at different positions or time steps are statistically coupled.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Couple the number of operator training pairs to the output resolution instead of increasing the output grid independently. Refine the output discretization only while the oracle reconstruction improves, and increase the training set when the learned predictor remains substantially worse than the oracle decoder.
Useful6/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the usual unconstrained neural likelihood head with an unnormalized posterior potential that is linear in a learned coefficient vector over neural features. Optimize the exact partition-function-corrected posterior objective rather than only pointwise negative log-likelihood. This gives a globally convex final-layer problem and a positive-semidefinite covariance Hessian, reducing optimizer sensitivity and calibration failures.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Turn row dropout into an adversarial conditioning problem rather than independent Bernoulli noise. At each training step, search for a subset of surviving channels or measurements with unusually small least singular value, train the downstream network on that subset, and gradually increase the search strength so training directly exposes failure modes hidden by average-case dropout.
Useful6/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a binary classifier's unconstrained final logit with a differentiable likelihood-ratio head based on two squared Mahalanobis radii in a learned embedding space. Approximate the shared radial generator with a small fractional-power basis, allowing the head to model heavy-tailed class geometry that an affine QDA logit cannot represent while remaining much smaller than a generic nonlinear head.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace coordinate-wise mean pooling of metric-valued items with a finite representation of their free integral. Each item x in a pointed metric space M is represented through evaluations of learned Lipschitz probes, and the pooled feature is the weighted integral of those probe values. A dual Lipschitz critic estimates the free-space norm of differences between pooled groups, making the representation sensitive to metric geometry while remaining permutation-invariant.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Regularize an encoder so that feature vectors from every substantial local data region occupy a well-conditioned, high-dimensional linear span. Instead of only maximizing global covariance rank, penalize low effective rank in many local batches or neighborhoods, approximating the paper's worst-positive-measure-set definition of separation capacity.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace a dense weight matrix by a cross approximation built from selected rows and columns rather than by a conventional truncated SVD. Periodically refresh the selected indices using residual leverage scores, warm-starting from the previous factorization so that the compressed layer can track weight changes during fine-tuning.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Enumerate structured pruning masks only up to exact permutations of exchangeable channels, hidden units, or experts. Replace exhaustive mask search with canonical augmentation: retain a subset only when it is lexicographically smallest among all masks obtained by the model's symmetry group, while recursively generating only canonical predecessors.
Useful6/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Build a state-space layer whose latent dynamics use a fixed cyclic schedule of learned generators instead of a single generator. Penalize pairwise commutator norms so that the true ordered cycle remains close to the averaged flow, while periodically checking a quadratic Lyapunov contraction condition on the exact cycle transition.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Regularize the end-to-end Jacobian singular-value distribution of a deep network toward the explicit free small-loss law generated by independently mixed projection-like layers. The target controls several gradient-spectrum moments, including the predicted fraction of nearly preserved directions, instead of controlling only the average gradient norm.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace the first dense layer on q-ary categorical features by a Fourier interaction layer containing only monomials whose coordinate support is at most s. Use a Bohnenblust–Hille-inspired quasi-norm on coefficients, separately for each interaction order, to prevent a small number of high-order interactions from dominating the output. The resulting model has an explicit interaction-order knob and can be tested against a dense MLP at matched parameter count.
Useful6/10
Difficulty5/10
Novelty7/10
✗ 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