Unverified
2026
Turn a sparse expert layer into a stochastic birth-death population. Each expert receives a bounded fitness score from recent routed-token performance; at each update, a candidate expert is activated with probability p, while one expert is removed with probability q = 1 - p, preferentially removing the lowest-fitness expert. The paper's critical threshold f_c = q/p predicts which fitness levels can maintain a growing surviving population, providing a principled control knob for expert turnover.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a feature transformation that approximates the derivative of a fractional diffusion operator with respect to its order. Instead of only smoothing features with one fractional order, the layer exposes whether a feature changes rapidly across spatial scales, which can help with textures, edges, and multiscale patterns.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Parameterize a cell-complex neural network by features on p-cells and derive lower-dimensional boundary features using the cellular boundary map over F2. For a 2D square complex, neighboring plaquette bits determine each link feature through XOR, reproducing the paper's exact gauge-law reconstruction and preventing the network from representing inconsistent open boundary configurations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Decompose tensor-valued hidden states into invariant symmetric, alternating, and higher Young-symmetry channels before applying learned maps. This removes redundant tensor coordinates and prevents a neural layer from mixing incompatible representation types, yielding smaller equivariant modules with a cleaner inductive bias.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace an unconstrained Fourier-feature block in an implicit neural representation or coordinate MLP with a sparsity-aware layer whose output gain is normalized according to the distance outside the training interval. The normalization uses the paper's endpoint law, preventing a small in-domain Fourier representation from producing arbitrarily large outputs just beyond the observed coordinate range.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single smooth inverse predictor near detected ambiguity boundaries with multiple prediction branches and a soft gate. The gate is trained to preserve distinct decompositions rather than forcing the network to interpolate through a thin high-curvature transition layer, while a Jacobian or curvature penalty identifies unresolved ambiguity regions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Turn a recurrent or state-space memory into a constrained hereditary state: the latent state remains in a learned convex domain, and only input motion that reaches the boundary changes the plastic component. This creates a nonexpansive, rate-independent memory that should suppress unstable state growth and make the representation depend on meaningful cumulative changes rather than arbitrary update frequency.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace independent uncertainty heads in a branching neural network with a structured variational posterior whose non-root node distributions condition on jointly sampled latent states of all parents. This allows collider evidence to explain away upstream uncertainty: evidence at a child can alter the posterior over several parent branches instead of leaving their uncertainties artificially independent. The approach can be implemented as a stochastic DAG network and trained with an evidence…
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace a dense learnable Fourier multiplier with a low-parameter multiplier concentrated near the common zero set of two polynomial constraint symbols. A linear constraint together with a cubic constraint can produce straight or curved frequency loci, allowing the network to represent directional long-range structure while using far fewer spectral parameters than a full 3D frequency grid.
Useful6/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Transform local neural residuals into the Ripa model's characteristic coordinates before spatial aggregation, apply a mode-dependent gate based on neighboring characteristic jumps, and transform back. This lets the model damp oscillatory acoustic or equilibrium-mode corrections near discontinuities without globally smoothing every feature.
Useful6/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a hidden state as complex-valued points on a two-dimensional lattice and replace unconstrained local updates by the exact harmonic-quadrilateral completion rule from discrete conformal geometry. Given three corners of a plaquette, compute the fourth corner by a Mobius-rational formula enforcing cross-ratio minus one, then use a learned readout or forcing term for task-specific predictions. The layer supplies a hard geometric inductive bias and a directly measurable local constraint…
Useful6/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a modular neural block as a word over primitive operators and identify operators that commute because they act on disjoint tensor supports. Canonicalize every equivalent word into one representative, allowing architecture search, caching, and parameter sharing to operate on equivalence classes rather than redundant layer orderings.
Useful6/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use the quotient group's generator classes as a finite relation vocabulary and tie message functions by group displacement instead of by individual graph edges. This creates a compact, exactly consistent relation-aware GNN that can recognize repeated local structure and transfer parameters across graph instances sharing the same Cayley geometry.
Useful6/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace independently predicted node, edge, and face features on a simplicial mesh by a coupled projection layer that is idempotent, bounded in a mass-matrix norm, and approximately commutes with the discrete exterior derivative. The layer can be inserted after an ordinary graph-neural update and should suppress topologically inconsistent feature components without requiring the downstream network to learn these constraints from data.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained feature vector of size n+1 by the coefficients of a homogeneous degree-n binary polynomial and make the layer transform through the irreducible symmetric-power representation of GL_2(R). For n=4 this creates a five-channel equivariant feature block whose transformation law is exact rather than learned through augmentation.
Useful6/10
Difficulty5/10
Novelty6/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 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
✗ Mechanism failed
2026
Augment a CNN with a nonlocal feature-gradient branch that compares each feature vector with a kernel-weighted neighborhood rather than using only pointwise or local convolutional interactions. Regularize this branch using the paper's Fourier multiplier energy, which penalizes feature oscillations according to the kernel spectrum and approaches an ordinary local-gradient operator as the interaction radius tends to zero.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace a dense channel or token-mixing matrix with a product of positive bidiagonal factors, so information propagates through a controlled sequence of local couplings rather than arbitrary signed interactions. Initialize the factors from the paper's barycentric-subdivision factorization, then learn positive diagonal and off-diagonal parameters; the resulting map is structured, parameter-efficient, and constrained to remain totally positive.
Useful6/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Train an unconstrained branch and a geometry-aware branch in parallel, then learn how much to trust the analytic branch. This preserves the benefit of explicit geometry on correctly specified tasks while allowing the model to ignore a misleading or irrelevant prior.
Useful6/10
Difficulty3/10
Novelty7/10
✗ Mechanism failed
2026
Regularize an intermediate neural representation according to its estimated low-dimensional separability capacity instead of its ambient feature width. Learn feature gates or subspace assignments, estimate the union of active supports, and penalize representations whose Cover capacity exceeds a task-dependent target.
Useful6/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Add a differentiable hypergraph layer that converts invariant edge-length features into triangle areas or higher-dimensional simplex volumes before message passing. Select or weight simplices according to the singular values of the length-to-volume Jacobian, so the network receives geometrically independent features rather than many redundant or nearly degenerate measurements.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Insert a scalar flux-correction-style limiter after a neural operator predicts a conservative state or residual. Interpolate between a known-admissible baseline state and the learned high-order candidate, choosing the largest coefficient that satisfies a geometric family of linear inequalities encoding positive density, positive pressure, and subluminal velocity. This retains as much of the neural prediction as possible instead of independently clipping physical variables.
Useful6/10
Difficulty5/10
Novelty7/10