Unverified
2026
Learn or select sparse cyclic convolution or relative-attention offsets whose pairwise differences collide less often modulo the sequence length. The paper's Fourier fourth-power identity turns this combinatorial objective into an FFT-computable differentiable loss, enabling fixed-K sparse patterns with lower aliasing and interference than random offsets.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Generate structured augmentations of categorical sequences using the paper's adjacent crystal rewrites, then enforce prediction consistency across the resulting orbit. Unlike arbitrary random swaps, the rewrite preserves paired subsequences and modifies only the unmatched portion, making it appropriate for exchangeable discrete codes or explicitly permutation-equivariant inputs.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace independent top-k expert or attention-edge selection with a gate vector constrained by hierarchical path budgets modeled on the paper's extended-Dyck-path polytope. Ordinary interactions receive continuous nonnegative capacities, while a designated class of cross-group interactions receives binary or clipped-to-one gates, producing structured sparsity and preventing many correlated paths from consuming the same routing budget.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent MoE experts as leaves of a balanced ternary tree and regularize the hierarchical boundary of each expert's assignment mask. At fixed routing mass x, the ternary martingale isoperimetric theorem supplies the explicit minimum one-variation T_3(x), so the router can be penalized according to an occupancy-dependent profile rather than a uniform parent-child disagreement cost. This should favor coherent, stable routing regions while preventing small expert supports from obtaining…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a learned recurrent transition with a sparse binary reservoir compiled from prime-count gates. Three permanently active control vertices implement copy and XNOR transitions, allowing the signal state to realize an affine feedback register over \(\mathbb F_2\) with period \(2^m-1\) using only \(O(m)\) edges and bounded in-degree. Train only an input projection and readout, or use straight-through estimators if end-to-end adaptation is required.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a permutation-invariant positional channel to a graph neural network by encoding each node through the histogram of shortest-path distances to a selected landmark set. Unlike standard ordered landmark distances, this representation is unchanged when landmarks are permuted and can be optimized to reduce node collisions. Use a small learned projection of the histogram alongside ordinary node features, with an optional collision penalty during training.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Constrain a learned binary graph or sparse attention-routing graph so that every node neighborhood has no independent set of size k. This local anti-star condition gives an explicit upper bound on the graph Laplacian spectral radius, allowing a larger but certified stable diffusion step or residual propagation coefficient.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Store quantized magnitudes as finite golden-ratio digit strings satisfying the no-adjacent-ones constraint, rather than as unconstrained binary words. A local rewrite pass converts equivalent but invalid patterns such as 011 into 100, making illegal adjacent-one patterns detectable after memory faults while preserving the represented scalar. This is a storage-integrity and decoding scheme, not a claim that canonicalization alone can correct arbitrary bit flips.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace or augment conventional dot-product attention with features generated by a convex polytope's lattice Laplace partition function. For a query-dependent point inside a learnable polytope, the log-partition gradient is the expected lattice direction under a Gibbs distribution, while its Hessian is a covariance matrix that supplies curvature-aware features.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace one-hot node IDs or large positional encodings in a GNN with coordinates from a compact abelian Cayley graph. The coordinates preserve graph-shortest-path geometry exactly, while Fourier characters of cyclic factors provide smooth neural features with fewer channels.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Regularize a neural network using exact finite-difference interaction terms at a chosen perturbation scale, while retaining the covering decomposition of a composition f∘g. Instead of penalizing only the total mixed difference, separately penalize selected covering terms containing large subsets or overlapping subsets, which targets higher-order and nonlocal interactions without computing Hessians.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a candidate feature for every edge pair or structured token pair, then retain a numerically independent subset under a feature-Jacobian matroid. The neural layer computes only the selected interactions, preserving directions that add new information rather than pruning solely by magnitude or attention score.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a global Euler-characteristic residual to a network predicting complementary phases A and B on a voxel grid or simplicial mesh. The regularizer forces predicted phase topology and separating-interface topology to satisfy the tubular-tiling balance law, helping reject geometrically plausible but topologically inconsistent segmentations. It is especially suitable when labels cover only one phase, interfaces are noisy, or the hidden complementary phase must be inferred.
Useful5/10
Difficulty6/10
Novelty8/10
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
Add a topology-aware lower bound to point-cloud or graph token pruning: at each geometric scale, retain at least as many latent representatives as the persistent-homology rank between that scale and a larger scale. The method prevents the pruning module from collapsing independent connected components or cycles that remain persistent, while still allowing compression in topologically redundant regions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a sparse attention mask from a fixed regular candidate graph and one scalar random label per token, retaining edge $(u,v)$ when $x_u+x_v\geq\tau$. Unlike independent random pruning, this produces correlated neighborhoods and a controllable distribution of token degrees, potentially giving some tokens broad receptive fields while retaining a fixed sparse budget.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Augment a graph neural network or graph transformer with counts of cyclic walks whose successive steps are required to be graph edges or graph non-edges according to a binary pattern. These features encode induced-subgraph structure that ordinary adjacency powers miss, and can be concatenated to the graph-level token or used as an auxiliary prediction target.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a dense token or channel mixing matrix by a fixed sparse directed graph whose states are ordered pairs of symbols and whose transitions advance through a cyclic phase. Each state has exactly two allowed successors, obtained by appending a symbol different from the previous two, producing a strongly connected, vertex-transitive sparse mixer with shared local dynamics. The prescribed phase structure prevents arbitrary short-cycle routing and can act as an anti-collapse inductive bias in…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's explicit tree support pattern as a cheap certificate that a sparse neural linear map contains a nearly singular submatrix. During mask construction or rewiring, penalize root-row-child configurations with many disjoint child branches, or increase overlap and row degree locally when such a configuration is detected. The goal is to prevent sparse MLP, projection, or MoE expert matrices from developing directions that are almost annihilated by the layer.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a neural layer's dense parameters by a real parameter tensor and a binary activity mask, then update the mask using importance scores measured across multiple perturbation intervals. Gates that repeatedly occur in non-dominated accuracy–cost configurations receive larger scores and are more likely to be retained or activated, avoiding uniformly random sparse rewiring.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace an unconstrained order-k weight tensor with a sum of components that are symmetric only within selected contiguous index blocks. This preserves interactions between blocks while tying parameters under within-block permutations, providing a tunable middle ground between a fully dense tensor and a fully symmetric tensor.
Useful5/10
Difficulty5/10
Novelty7/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
Apply the paper's sharp sumset lower bound to the active discrete supports of multiple additive branches in a sparse neural layer. Penalize cases where the support of the combined output is smaller than the mathematically guaranteed minimum implied by the branch supports, discouraging destructive overlap and representational collapse.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Estimate how often a representation lies on a separating hyperplane for alternative separable dichotomies, and use this quantity as a boundary-concentration penalty. Unlike a single classifier margin, the score measures whether many admissible separators consider the point ambiguous.
Useful5/10
Difficulty5/10
Novelty7/10