Unverified
2026
Replace an unconstrained categorical or multilabel output head with a graph-supported distribution over feasible independent sets. Given neural logits, assign probability proportional to the exponential of the total logit of each selected vertex, so incompatible vertices can never be jointly active. Use exact junction-tree inference for decomposable graphs with small treewidth, and compare against post-hoc masking or penalty-based constraint enforcement.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Represent a small expert router or attention interaction by a homogeneous polynomial with nonnegative coefficients, then penalize violations of the Lorentzian Hessian signature on degree-two derivative slices. Initialize or warm-start the coefficient tensor from a normalized skew-Schur coefficient array, which the paper identifies as a realizable volume polynomial and therefore a structurally valid Lorentzian point.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace dense token-to-token attention with attention over connected token groups, called polymers, while forbidding nearby polymers from being simultaneously selected. Each candidate group receives an exponentially decaying size and boundary penalty, and the layer sums or samples only compatible collections of groups. The construction should create structured sparsity and prevent redundant overlapping attention regions.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a learned causal mixing profile by a monotone profile followed by a prefix-average Hardy mixer. The monotonicity constraint makes the mixer provably non-degenerate in the BMO sense: localized variation in the profile cannot be reduced below a calibrated factor by prefix averaging. This is a cheap alternative to dense causal attention for tasks where importance or state profiles are expected to decay along sequence position.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace independent token scores with a query-conditioned positive-semidefinite low-rank quadratic score over a fixed-size selected subset. Repeatedly convert the quadratic objective into a linear exposure vector and apply a cheap top-k oracle, allowing the selector to model joint token interactions without constructing an n-by-n attention matrix. The margin between the current low-dimensional shadow and alternatives provides a practical confidence or early-stopping signal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Assign each of K entity or token types an integer code from a B_{2,\Delta}-set A, so every unordered pair {i,j} produces a unique and margin-separated scalar code a_i+a_j. Use this code as a compact symmetric pair feature for graph edges, attention biases, or pairwise relation MLPs, avoiding collisions that occur when ordinary low-dimensional additive encodings are quantized or hashed.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace independent dropout or Gaussian perturbations across attention heads, ensemble members, or diffusion score replicas with a positive-semidefinite correlation matrix sampled from an LKJ distribution. The concentration parameter eta controls whether perturbations are nearly independent or strongly correlated in a controlled way, while the Bartlett construction guarantees a valid covariance without matrix rejection or projection.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a measurement-conditioned attention layer with two explicitly separated fields: a geometry-only inverse-temperature profile that controls interaction strength and an outcome-dependent chemical-potential bias. For a region bounded by coordinates a and b, force the interaction gate to vanish as the square root of the distance from either boundary, while allowing a separate potential channel to encode measured values.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace part of an attention matrix with a mixture of fuzzy permutation matrices induced by short permutations. Each basis element represents an order-preserving k-token matching smeared over all embeddings into the sequence, while a balancing constraint makes the aggregate attention receive uniform global coverage. Retain a standard low-rank or local-attention residual so the structured branch does not prevent arbitrary content-dependent interactions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat learned features on a mesh as differential forms and pool them against oriented chains using wedge or cap products instead of ordinary coordinate averaging. Couple forward and boundary features with the signed chain differential so that pooling commutes with differentiation, preserving local conservation and orientation information.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Attach each token or graph node a discrete grade a in a finite group A, and modify attention value composition with a normalized group 2-cocycle rather than independent pairwise gates. The cocycle provides a globally consistent projective interaction rule, so composing three messages gives the same result under either parenthesization. This may improve relational reasoning while reducing the number of freely learned interaction parameters.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a positive multiplicative perturbation to the node or token measure of a symmetric neural operator and use the paper's eigenvalue-response matrix to identify nearly degenerate eigenspaces. Train the perturbation or its scale so that repeated eigenvalues split with a controlled minimum gap, making spectral positional encodings and eigenvector-based message passing more stable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment an exponential state-space memory branch with a causal convolution whose lag-j weight is exp(-lambda j) ell(j)/j. The 1/j boundary provides broad logarithmic memory, while lambda supplies an explicit finite memory scale and prevents uncontrolled accumulation from an untempered long-memory kernel.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace unconstrained directed attention logits by observables that are one-sided 1-Lipschitz under a learned quasi-metric: an observable may increase from node j to node i by at most the directed cost from j to i, while the reverse direction can behave differently. Apply this constraint at several subsampled resolutions and penalize the Hausdorff mismatch between observable families of two augmented views, preserving directed structure while making attention stable under perturbations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the model's non-monotonicity result to make graph connectivity a learned resource rather than assuming that every extra edge helps. An edge router assigns transmission scores but also charges a source-side collision cost for exposing an infected node to many susceptible neighbors. The resulting router can prune edges that increase competition and reduce useful reachability.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a filtration from learned directed edge or transition weights, compute persistent path homology, and feed compact persistence features into a graph or sequence neural network. Because the paper proves stability under network-distance perturbations, these features should be less sensitive to small changes in edge scores than raw adjacency statistics, while retaining orientation-sensitive information that ordinary undirected topology loses.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Construct a finite neural prototype dictionary from solutions of Mα = α⁻¹, where the inverse is coordinatewise, and assign positive weights so the dictionary obeys the isotropy identity Σᵢ cᵢαᵢαᵢᵀ = I. Use the resulting frame as the initialization or fixed geometry for embedding prototypes, attention directions, or MoE router experts instead of initializing those vectors independently. The isotropy guarantee should reduce directional collapse and make early optimization…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct p shared neural replicas of the same token or feature set, quotient their outputs by the cyclic group C_p, and train a power head to agree with the representation obtained from a jointly processed p-fold input. Add a filtration score whose value is nondecreasing under the power map and strictly increases on deliberately nontrivial replica combinations. The experiment tests whether this algebraically structured consistency signal is better than ordinary pairwise augmentation…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Introduce a small auxiliary certificate state for selected attention or message-passing edges, analogous to the dg generator z, whose decoded value is trained to equal the composition of two neighboring transformations. Penalize violations of this differential relation and use the certificate residual to gate unstable two-hop paths. This creates an algebraically checkable regularizer for multi-step reasoning rather than another generic consistency loss.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace raw polynomial interactions between neighboring feature vectors with central polynomial interactions computed after subtracting the local feature mean. Keep separate second-, third-, and fourth-order channels and apply independent residual gates to them, so a uniform shift of every feature in a neighborhood cannot create artificial cross-order responses. This is a drop-in higher-order mixer for a small transformer or graph neural network.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace mean or max pooling over a set of learned element embeddings with pooling based on the metric-magnitude weighting. Pairwise distances create a globally coupled correction for redundancy, so geometrically isolated or boundary elements can contribute differently from dense clusters of nearly duplicate elements.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
For every unordered pair of scalar features, construct invariant coordinates from the elementary symmetric quantities s=x+y and q=xy, then feed a truncated orthogonalized polynomial basis in (s,q) to the neural network. Estimate the basis by weighted Gram-Schmidt or Cholesky whitening under the paper's triangle weight, so polynomial channels have low redundancy and controlled scale instead of requiring an unconstrained MLP to learn both symmetry and decorrelation.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Partition a sequence, image, or graph into regions processed by a cheap local operator and a more expressive nonlocal operator, then couple their boundary activations with a shared continuity equation and a conservative interface-flux equation. The interface correction prevents the local and global branches from creating discontinuities or duplicated information, allowing nonlocal computation to be restricted to selected regions while preserving global consistency.
Useful5/10
Difficulty5/10
Novelty7/10