Unverified
2026
Augment pairwise attention on a set of n tokens with a rigidity operator derived from normalized pairwise directions. The operator couples infinitesimal node displacements through changes in pairwise distances, while the complete-graph theorem provides a geometry-independent eigenvalue target n/2 after spherical centering and normalization.
Useful5/10
Difficulty6/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 uniform set or point-cloud pooling with a microscopic weighting computed from pairwise feature-space distances. The resulting signed pooling vector should retain boundary and geometrically isolated points that ordinary mean pooling suppresses, potentially improving recognition when class information is concentrated on shape extremities or rare local configurations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat each directed attention matrix as a graph transition matrix and form its Laplacian L = I - A. Compute the principal-cofactor vector to identify tokens with weak global access to the rest of the layer, and regularize the nonzero-eigenvalue product so attention does not become reducible or nearly singular. This targets pathological attention heads that isolate token groups and produce unstable or poorly propagated representations.
Useful5/10
Difficulty6/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
Build an attention or positive-mixture module whose output ratio at two control settings is provably monotone in an ordered index such as token distance, retrieval rank, or discretized uncertainty. Use normalized-positive-series identities to replace an unstable quotient derivative with a difference of expectations, and penalize violations of the resulting stochastic-order condition during training.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Represent entities, tokens, or graph nodes by learnable rays subject to orthogonality constraints on prescribed hypergraph contexts. In addition to enforcing orthogonality within each context, penalize distinct vertices that become collinear, because contextual orthogonality alone can permit or force geometric collapse. This creates a structured embedding layer for graph neural networks or context-aware attention.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a sparse neural mixing layer from colored directed strands rather than a dense all-to-all matrix. Feature channels are assigned ordered colors, local trivalent junctions conserve every color, and an edge width is the weighted sum of the colors carried by that edge; a differentiable penalty favors monotone, crossing-free routings that define a canonical leading term. This creates a structured routing prior that can be compared directly against dense attention and unconstrained sparse…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained pairwise attention score with an intersection of coordinate-wise threshold or interval compatibility heads. Each head is a supergraph that permits pairs satisfying one constraint, while the final attention edge exists only when every head permits the pair. This provides an interpretable inductive bias for multi-constraint relations and prevents the model from approximating a conjunction using a single unstable nonlinear score.
Useful5/10
Difficulty5/10
Novelty8/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
Represent a sparse higher-order attention head by a 3-uniform hypergraph whose hyperedge $(v,x,y)$ allows anchor token $v$ to aggregate a pairwise interaction between tokens $x$ and $y$. During mask construction, greedily reject edges that would create a $4$-cycle in the link graph $L(v)$, so the same pair of source tokens cannot reach an anchor through multiple redundant pairings. This produces a diversity-constrained sparse attention pattern with an explicit, measurable collision bound.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a spectral regularizer to a learned graph or sparse attention adjacency that penalizes violation of the paper's energy floor. The regularizer discourages adjacency matrices that retain many edges but collapse into a low-dimensional spectral structure, which may reduce graph-message-passing diversity and worsen oversmoothing.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a fixed or weakly learned interface-localized branch to a sequence model. Set the critical mass term to zero and make the transport coefficient change sign across a learnable interface, producing a localized mode that pools information near a detected transition rather than averaging uniformly over the sequence.
Useful4/10
Difficulty5/10
Novelty8/10