✗ Mechanism failed
2026
Replace scalar entropy penalties on attention maps with a matrix-valued heat-flow regularizer over a circular or periodic token coordinate. Each position stores a positive semidefinite matrix describing coupled heads, experts, or channels; heat smoothing is constrained by the sharp modified log-Sobolev and Bogoliubov–Kubo–Mori contraction rather than an arbitrary smoothing coefficient. This should suppress high-frequency routing noise while preserving positive matrix structure and reducing…
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Parameterize a multi-channel two-dimensional convolutional operator through a learned filter bank B, then use the composed operator B*B as the layer response. Its Fourier response is positive semidefinite exactly at every spatial frequency, enabling stable smoothing or diffusion-like residual updates without frequency-grid penalty terms.
Useful6/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace ordinary Jacobian penalties in coordinate MLPs or deformation networks with a learned local rotation frame and a polyconvex energy of the relative stretch. Penalize \(U\), its cofactor, and its determinant through a convex function, while separately smoothing the rotation field through \(R^T\operatorname{Curl}R\). The intended benefit is resistance to fold formation and better conditioning than directly penalizing \(\|J-I\|^2\), especially for large deformations.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Add a multiscale texture regularizer to spatial feature maps by measuring Gaussian Difference-of-Gaussians responses at geometrically spaced scales. Weighting each scale according to a Besov smoothness exponent penalizes non-persistent high-frequency structure without forcing features to be globally smooth, so the network can retain edges and textures that survive across adjacent scales.
Useful6/10
Difficulty4/10
Novelty6/10
✓ Mechanism works
2026
Replace disjoint-pair estimates of embedding covariance moments with a complete U-statistic over every distinct pair in a minibatch. For embeddings z, the degree-two kernel h(z_i,z_j)=(z_i^T z_j)^2 estimates the spectral moment tr(M^2), where M=E[zz^T]; complete symmetrization reduces the degenerate component of estimator variance from O(1/B) to O(1/B^2).
Useful6/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add a cheap spectral gate to a state-space model or recurrent event detector that decides whether multi-step lookahead can change the threshold decision. If the learned threshold readout is approximately a nonnegative left eigenvector of the transition matrix, use the current state only; otherwise activate predictive heads and search over a small horizon. This avoids unnecessary rollout computation while preserving early-warning behavior in oscillatory or rotating dynamics.
Useful6/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Add a geometry-guided infill operator to a population optimizer used for black-box neural-network tuning. Fit a local Jacobian from recent parameter perturbations and validation-residual vectors, generate a damped Gauss-Newton candidate for exploitation, and sample exploratory candidates in the same Jacobian-derived metric. The host optimizer retains selection, population survival, covariance adaptation, and its total evaluation budget; only a configurable fraction of new candidates is replaced…
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observed label-availability indicator as an auxiliary supervision signal when labels are preferentially missing for uncertain or difficult examples. Train the classifier with a joint likelihood containing both the class-label likelihood for labeled examples and a missingness likelihood whose probability depends on the classifier's posterior uncertainty.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace AdamW or SGD updates on simplex-valued routing probabilities with a logarithmic-barrier mirror step. The update remains strictly positive, avoids projection-induced zero coordinates, and can approach a boundary solution asymptotically while retaining the paper's theoretically motivated O(log k/k) convex convergence behavior.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace unconstrained adversarial example generation with an invertible transport map that is the gradient of a convex potential. For each class, the map pushes a kernel-smoothed empirical distribution toward a least-favorable distribution inside a prescribed KL/Sinkhorn ambiguity radius, producing hard but globally coherent training examples rather than pointwise perturbations.
Useful6/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace one deterministic residual update with a short cyclic composition of learned vector fields evaluated for randomized, short run times. Because finite compositions of noncommuting flows generate directional-derivative and Lie-bracket terms, changing the cycle order gives the network an explicit, low-cost way to learn drift directions that are unavailable from the individual vector fields alone.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Represent an intermediate feature as a low-rank PSD matrix and compress it using nonnegative measurements \(\langle A_i,X\rangle\), while penalizing the empirical ratio between maximum and minimum measurement distortion over low-rank feature pairs. This directly discourages collapsed directions and excessively amplified directions in a covariance or Gram-feature bottleneck.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the usual hand-designed expert-load penalty with a heterogeneous survival penalty derived from a susceptibility distribution. Each expert receives an availability factor q_e=G(A_e), where A_e is its cumulative recent routing pressure and G_e is a learned or fixed mixture of exponentials; highly used experts are suppressed smoothly, while heterogeneous experts can have different resistance to pressure. The mixture produces adaptive curvature and long-tailed penalties that may reduce…
Useful6/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2025
Replace a conventional scalar activation by a geometrically indexed family of affine pieces whose slope changes with the logarithmic magnitude of the input. The same two endpoint parameters are reused across all scales, giving a compact, explicitly scale-aware activation that can represent different responses for exponentially separated activation magnitudes.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a fractional-Laplacian penalty to a neural network evaluated on binary inputs or binary latent gates. For 1 < p < 2, the endpoint inequality implies that controlling fractional spectral energy controls the L_p norm of aggregate coordinate-flip sensitivity, potentially giving a more global robustness objective than explicitly enumerating one-bit perturbations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's quotient-space and Euler-characteristic logic as a runtime invariant for adaptive neural discretizations. A refinement controller should add capacity only when the residual warrants it and should reject refinements that create new nullspace modes, disconnected constant modes, or closed non-exact feature modes.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use state-dependent Langevin noise to perturb prototype or router-codebook optimization when balanced quantization reaches a poor stationary configuration. Retain the best-so-far state for deployment, allowing exploration to escape non-minimizing Lloyd fixed points without permanently corrupting the learned representation.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use a multivariate generating function to construct training examples or network variants with an exactly controlled amount of a structural attribute, such as graph branching, routing depth, skip connections, or the number of experts activated. Train by gradually changing the target coefficient slice instead of relying on an uncontrolled random curriculum.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace Fourier or sinusoidal one-dimensional coordinate features with a trainable radical layer f(x)=sum_i c_i sqrt(P_i(x)), where every P_i is a strictly positive quadratic. A nonzero scalar output formed by such a layer has at most 2n distinct real zeros, providing an explicit bound on sign changes and suppressing uncontrolled ringing. Use the radical features as an input embedding for a conventional MLP or neural implicit field.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Train a score-based diffusion model on a domain with partially reactive constraints, replacing hard rejection or large boundary penalties by a Robin boundary condition. Samples approaching the constraint boundary acquire a hazard proportional to accumulated boundary local time, giving a continuous interpolation between reflection and absorption.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained Cartesian-product router over heterogeneous branches with a router whose joint expert or state assignments obey a finite-group conservation rule. Branch i emits a distribution over labels in its own subgroup H_i of a common finite abelian group G; only tuples whose group sum is zero are retained. This gives an exact, differentiable structural prior for modular arithmetic, multi-relational graphs, multi-view fusion, or any setting where latent labels compose by a…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Initialize directional prototypes, cosine-classifier weights, or angular attention directions with a spherical t-design rather than iid random vectors. Exact matching of spherical moments through degree t should provide uniform angular coverage and reduce initialization anisotropy, especially when the number of prototypes is small.
Useful5/10
Difficulty4/10
Novelty5/10