Unverified
2026
Replace a standard two-layer multiplicative interaction block with auxiliary positive features X whose neighboring products generate two coupled feature grids x and y. Add the Y-diamond recurrence as either a hard recurrent update or a differentiable consistency loss, forcing local interactions to obey the same compatibility structure as an SL2/Y-frieze.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct two latent variables X and Y with exactly the same marginal distribution, while forcing their difference X-Y to follow a chosen centered noise or residual law. Insert the pair into a residual, VAE, or diffusion block so that the model receives the desired perturbation without changing the marginal latent distribution at either endpoint. This creates a controlled alternative to independently sampled noise, especially when marginal drift in repeated stochastic layers is harmful.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an ordinary token aggregation step with a p-replica cyclic-equivariant block. Features are copied into p replicas, processed by shared operators, coupled through a cap-like bilinear interaction, and projected onto cyclic invariants. An auxiliary commutation loss enforces that applying the operator before or after the p-fold lift gives similar outputs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace ordinary bag-of-events pooling for an ordered trajectory, graph walk, or token event stream with a reduced-word representation in a free group. Each event contributes a signed group word, and the model aggregates signed differences (w-1), preserving order-sensitive information while making explicitly paired local events cancel.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Insert a rearrangement operation on scalar feature maps sampled along an ordered coordinate such as time, spatial position, or a neural-field input grid. The operation sorts values into non-increasing order, preserving the empirical histogram exactly while provably not increasing the Riesz fractional variation in the ideal one-dimensional continuous setting.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary dot-product attention logits with a strictly totally positive kernel evaluated on positive, ordered scalar coordinates attached to queries and keys. Use the modified-Bessel kernel K(x,s)=I_s(x), whose every ordered minor is positive, then row-normalize it as an attention matrix. This creates an attention operator with a mathematically enforced anti-oscillatory structure rather than merely positive entries.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent each matroid circuit as a structured hyperedge and perform message passing from circuit embeddings back to their constituent elements. Tie all circuit-update parameters that lie in the same automorphism orbit, so relabelings preserving the matroid produce exactly relabeled hidden states rather than requiring the network to learn this symmetry from data.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a finite-state message-passing layer that tracks local configurations corresponding to perfect edge domination or dominating induced matchings instead of transmitting unconstrained node embeddings alone. On graphs with a tree, series-parallel, or small-separator decomposition, the layer produces an exact or differentiable partition function over globally valid edge configurations, which can be used as node features, an auxiliary loss, or a structural prior.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a bank of quadratic features encoding tangent contact with the reciprocal manifold x1 x2 = 1, rather than forcing a generic MLP to discover this interaction from arbitrary monomials. For positive bounded feature pairs, each feature is nonnegative and becomes exactly zero at a selected reciprocal operating point. The module can be used either as an input feature expansion or as a regularizer encouraging learned gates and scales to follow a reciprocal geometry.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace an unconstrained bilinear feature interaction with a joint spectral filter that only allows pairs of graph or spherical frequencies satisfying a soft radius constraint. The smooth factor attenuates interactions near and beyond the cutoff instead of making the hard low-pass decision used by ordinary spectral truncation, which should reduce high-frequency aliasing and unstable feature products.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a generic MoE router entropy bonus with a branching-pressure objective that values routes according to both their stochastic entropy and their number of valid fine-grained continuations. The module can be implemented as a hierarchical router: a coarse state chooses a base transition, while a validity mask determines how many valid expert or latent branches lift that transition.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a graph neural network on the dual graph of a triangulated surface whose messages are transported by \(\mathfrak{S}_3\) permutation matrices associated with adjacent-face color transports. This removes dependence on arbitrary local color-label choices and gives the network an explicit representation of noncontractible topology through holonomy around cycles.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace explicitly stored independent random positional features with deterministic multiplicative phase features generated from a small table of random phases indexed by primes. Restrict positions to integers whose prime factors exceed a slowly growing threshold, because the paper's central-limit result says periodic weighted sums over these rough integers recover Gaussian behavior despite strong multiplicative dependence.
Useful4/10
Difficulty5/10
Novelty9/10
Unverified
2026
Represent selected hidden features as z = sqrt(N) exp(i theta), with a persistent phase and an explicitly stochastic amplitude. Regularize the ratio between coherent power |E[z]|^2 and total power E[|z|^2] toward the condensate prediction pi/4, while optionally matching higher amplitude moments.
Useful4/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a monomial polynomial feature block by a fixed Narayana basis transformation. If the input polynomial has nonnegative coefficients and only real roots, the transformed polynomial is guaranteed to have only real roots as well, giving a certified stability-preserving coordinate change for polynomial neural networks.
Useful4/10
Difficulty5/10
Novelty9/10