Audited (legacy)
2026
Use the attention probability distribution over an ordered context to choose contiguous token groups whose pooled attention masses have entropy as close as possible to a prescribed upper budget R. Replace the corresponding key/value vectors by one weighted representative per group, preserving token order and reducing the KV-cache length from n to m. Unlike unconstrained token merging, the entropy constraint gives a direct control knob over how concentrated or diffuse the retained attention…
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Insert a weighted negative-semidefinite fourth-order mixing operator into a residual or state-space layer. Instead of learning an unconstrained token-mixing matrix, parameterize its dissipative component as Q = -a W^{-1} B^T W B, ensuring that this component cannot increase the chosen weighted feature energy. Use a boundary-aware finite-difference matrix B along the sequence axis, optionally with learnable banded coefficients while preserving the factorization.
Useful6/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a mesh or graph neural network with an explicit low-dimensional channel for topological circulation or flux modes. The network predicts a local gauge-fixed field u and global coefficients a, then reconstructs the physical field as y = u + Ha, so local message passing does not need to synthesize global modes through many layers.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace ordinary masked mean pooling with a Fourier-compressed quadrature operator for arbitrary two-dimensional or three-dimensional domains. The geometry is preprocessed once into reusable grid weights, allowing every channel and every training example using the same domain to be pooled without boundary-area bias.
Useful6/10
Difficulty3/10
Novelty7/10
✗ Mechanism failed
2026
Replace dense grid tokens or global spectral features with coefficients of compactly supported kernels centered on a nested hierarchy of spatial points. Encode an input field into coarse-to-fine coefficients, apply a neural map to those coefficients, and decode the predicted coefficients at arbitrary query locations; the contribution from each level provides an explicit multiscale output decomposition.
Useful6/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace unconstrained combinations of several attention or adapter operations with a brace-style composition that inserts each operation into a distinct ordered interval of a base sequence. The resulting computation preserves the order of host and inserted operations and forbids crossing dependencies, producing hierarchical attention patterns with an explicit structural bias.
Useful6/10
Difficulty6/10
Novelty6/10
Audited (legacy)
2026
Train a classifier or encoder to distinguish shared latent corruption from fresh per-view noise instead of treating repeated observations as conditionally independent given the target. A single persistent state corrupts all views, while each view may additionally receive independent observation noise; the fusion loss marginalizes the persistent state exactly. This should reduce overconfident predictions from repeated but systematically biased augmentations, sensor readings, or retrieved…
Useful6/10
Difficulty4/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
△ Mechanism confirmed, baseline not beaten
2026
Construct a directional attention head whose admissible slopes are leaves of an M-adic interval tree with a prescribed finite splitting number. Instead of evaluating all K directions independently at every spatial location, route each query through only the branch decisions of the tree and share feature projections among directions that remain in the same multiscale angular interval.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Use a constant-sum point vector to encode ordered pairwise outcomes and train a neural scorer with an adjacent-categories ordinal likelihood whose slope parameters are tied to those points. The accumulated point score is then a theoretically motivated compressed statistic for repeated comparisons, rather than an arbitrary regression target or one-hot label.
Useful6/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Construct a mesh neural network with node, edge, face, and cell feature spaces modeled on the four spaces of the discrete elasticity complex. Replace unconstrained cross-order message passing by fixed incidence and geometric operators whose compositions vanish exactly, so gradient-like, incompatibility-like, and divergence-like features cannot contain algebraically spurious components.
Useful6/10
Difficulty6/10
Novelty6/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
✗ Failed on benchmark
2026
Replace Gaussian perturbations in a low-dimensional neural-network optimizer with independent double-geometric integer mutations and adapt each mutation scale using its exponential-family natural gradient. Apply the method to layerwise quantization scales, adapter coefficients, pruning thresholds, or other integer/discrete hyperparameters rather than to every individual weight.
Useful6/10
Difficulty5/10
Novelty7/10
✗ 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