✗ Mechanism failed
2026
Replace iid dropout or iid activation noise on spatial tokens with fluctuations generated by a conserved diffusing density. Each token receives a positive mass variable whose total mass is preserved, while Poissonian stochastic flux produces correlated perturbations that explore coherent local patterns rather than independently corrupting every feature. The density is autonomous and detached from autograd, so the regularizer adds little computational overhead.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Estimate how often each augmentation policy creates graph connections across different classes, then downweight policies with high estimated boundary-crossing mass. This directly targets the paper's augmentation-alignment term rather than tuning augmentation strength only by validation accuracy.
Useful6/10
Difficulty3/10
Novelty6/10
✗ 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
✗ 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 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
✓✓ 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 failed
2026
Use the divergence's data-processing principle as a consistency objective between predictions before and after a stochastic augmentation or feature bottleneck. Penalize disagreement under transformations while retaining the asymmetric power-law weighting of the r-deformed divergence.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace fixed-strength projection or constraint-repair steps during low-rank neural fine-tuning with a regularized affine subproblem whose damping is proportional to the current distance from the model manifold. Use strong damping when a gradient update leaves the low-rank manifold substantially, then automatically remove the damping near a clean intersection so that the method can recover higher-order local convergence. This is suitable for LoRA-style updates, structured matrix compression…
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace an unconstrained high-order polynomial interaction module with features generated by Gaussian matrix contractions and their exact Wick expansion. The resulting interactions are sums of products of power-sum invariants, with coefficients fixed by perfect-matching counts, providing a low-parameter inductive bias for permutation- or orthogonal-structured data.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a directional persistent cross-entropy loss between teacher and student activation persistence diagrams. The loss assigns high probability to teacher topological events that the student reproduces, while accumulating the probability of unmatched teacher events in an explicit unexplained-event mass. This penalizes missing teacher structure without requiring teacher and student diagrams to have the same number of points.
Useful6/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Add the paper's local Sine_beta fusion law as an analytic score prior for diffusion models that generate unordered point configurations. The model is trained to match both the usual diffusion score and an explicit short-range repulsion score, including the second-order correction that describes finite-scale fused configurations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the two-species phase diagram as a training controller: gradually increase one-way mutation \(\lambda\) and mutant suppression \(\mu\) while monitoring whether feature activity approaches the absorbing boundary. This creates a measurable curriculum from independent learning to controlled competition instead of turning on strong destructive interactions at initialization.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Represent augmentation centers or training examples in a low-dimensional torus and accumulate the geometric overlap of their augmentation neighborhoods. Add a finite-horizon penalty that detects latent locations with insufficient accumulated coverage, while constraining center uniformity so that coverage optimization does not collapse all samples to one location.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a mixed Fourier-L1 penalty to a particle or molecular neural network so that frequencies involving selected coordinate blocks are penalized by products of per-coordinate weights, rather than only by one isotropic norm. This should favor representations that capture pairwise or blockwise structure efficiently in high-dimensional configuration spaces, especially for wavefunctions, molecular energies, and other permutation-structured functions.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train two parameter replicas with common low-rank stochastic forcing and an adaptive finite-dimensional Cameron–Martin correction that contracts their discrepancy in a weak parameter metric. Transporting the forcing directions through the loss Hessian is intended to make a rank-k perturbation influence more than k raw parameter directions, while damped momentum suppresses high-energy divergence.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Represent a time-dependent Hamiltonian system on the reduced state $(q,t,p_q)$ rather than on the redundant extended state $(q,t,p_q,p_t)$. A neural Hamiltonian section predicts one canonical representative of each affine cotangent fiber, while an optional symmetry loss enforces consistency under transformations that translate time.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a Goldfarb–Idnani-style active-set solver as a neural constrained layer or optimizer substep, but never trust a guessed active set solely because its linear system solved. Remove duplicate or dependent constraints, solve the reduced KKT system, and accept the result only after checking primal feasibility, dual sign conditions, and stationarity. This gives exact enforcement of linear inequalities and a diagnostic certificate when the constraint set is infeasible.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Train a neural implicit occupancy or signed-distance model with Fourier coefficients sampled on a dual lattice, while explicitly preventing spatial aliasing under the corresponding periodic lattice. The spatial reconstruction loss is supplemented by a finite Fourier loss and a penalty for shape-point differences that approach nonzero lattice vectors.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct positional or relative-position features as a nonnegative mixture of lattice cosine functions instead of independently signed sinusoidal features. The resulting bias is the Fourier transform of a positive discrete measure with explicitly bounded spectral support, while the mesh and degree can be initialized in the paper's dense-but-controlled frequency regime.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use reverse plane partitions of a minuscule heap as the discrete codebook for a VQ-VAE or discrete sequence model. Codes are not arbitrary indices: each code is an order-preserving array, and crystal raising/lowering operators define a sparse, semantically structured neighborhood graph for augmentation, routing, and metric regularization.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a fixed discrete augmentation distribution over a finite symmetry group by a continuous-time random walk driven by learnable symmetric Poisson jump rates. Use the resulting transformed-example distribution as a symmetry regularizer, with an even ℓ^{2m} distance to uniformity whose behavior is guaranteed to improve monotonically as the symmetric rates increase for the group families covered by the paper.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Partition a neural network into coupled parameter or activation blocks with distinct effective noise temperatures, and inject Gaussian perturbations whose covariance contains off-diagonal terms induced by the coupling. Unlike standard independent gradient noise, equal-temperature or detached blocks should have negligible cross-correlation, whereas unequal-temperature coupled blocks should exhibit measurable correlated fluctuations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize hidden-state trajectories so that their temporal statistics match the moments of an isotropic Haar-distributed state up to order k, while deliberately leaving moments above k unconstrained. Use k as a controllable mixing knob: k=1 or 2 suppresses drift and anisotropic variance, whereas larger k imposes stronger distributional invariance and may remove useful temporal information.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a calibrated robustification rule after a symmetric polynomial feature map z(x)=vec(x^{\otimes d}). For a convex Lipschitz head or loss applied to z(x), compute a high-probability deviation radius from the paper's concentration rate and clip only examples beyond that radius. This explicitly accounts for the large radial fluctuations created by reusing the same vector in every tensor slot.
Useful5/10
Difficulty5/10
Novelty7/10