Unverified
2026
Replace or augment relative-position attention with a positive fractional-integration mixing kernel whose radial behavior has separate inner and outer power laws. Tokens close to one another interact through the usual fractional singularity, while tokens near different radial scales receive a ground-state correction that can improve multiscale information transport without introducing a dense learned positional table.
Useful5/10
Difficulty5/10
Novelty7/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
Add a rigidity-based regularizer to a neural graph or point-cloud encoder whose output coordinates are constrained by selected pairwise distances. The regularizer detects infinitesimal edge-length-preserving motions using the rigidity matrix, then uses equilibrium stresses to penalize deformation directions that survive at first order but are not blocked at second order. This targets representation collapse and locally ambiguous geometric embeddings.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained deep routing tree by a q-ary descendant hierarchy with an explicit even height h=0,2,4,... labeling feature scale or computation depth. Train the router so that empirical occupancy of heights follows the exact even-sector law from the Nagao quotient, preventing concentration at shallow layers or unstable overuse of very deep paths.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a binary neural connectivity mask by independent Bernoulli edge probabilities and optimize a deterministic expected message-passing objective before discretization. The resulting module can search sparse GNN edges or expert-to-token routes without repeatedly sampling many discrete architectures during training.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Regularize a point-cloud or graph neural network so that two augmented versions of the same sample induce filtered proximity graphs with approximately interleaved Reeb graphs. The network is encouraged to preserve multiscale connectivity in learned scalar features, not merely pointwise feature similarity or final predictions. Use an approximate interleaving loss for small graphs and the cheaper H0 persistence-distance surrogate for larger batches.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent each feature as belonging to one of three \(\mathbb{Z}_3\) charge sectors and constrain every linear and multiplicative operation to obey charge addition modulo 3. Add invariant cubic gates such as \(x_1x_2x_3\) or \(x_q^3\), which can express the same phase-insensitive interaction selected by the paper's three-photon drive. This should improve data efficiency and exact cyclic-augmentation consistency when the task has a genuine ternary symmetry.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace fixed graph-convolution weights with edge couplings that depend on learned node amplitudes and relative phases, following the power-grid stability construction. Add trainable positive diagonal margins that dominate aggregate phase-weighted incident coupling, then use the resulting operator in a residual or recurrent GNN layer. This creates an operating-point-aware propagation rule intended to reduce oversmoothing, exploding iterates, and sensitivity to graph degree or edge loading.
Useful5/10
Difficulty5/10
Novelty7/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
Add a topological loss that preserves the winding number of a complex numerator field predicted by a neural network. The loss is invariant to positive rescaling of the field, so it penalizes vortex creation or destruction rather than harmless amplitude changes.
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
Augment a neural model with a learned target differential form and a source-side correction whose compatibility is enforced by the mapping-cone differential. For a map F from M to N, train the model so that the target quantity is closed and its pullback to M is exactly the differential of the correction, providing a structured bulk-boundary consistency constraint instead of independent feature matching.
Useful5/10
Difficulty5/10
Novelty6/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 generic three-input concatenation MLP with a permutation-symmetric mixer built from the four signed combinations x+y-z, x-y+z, -x+y+z, and -x-y-z. Apply a shared truncated exponential to these combinations and aggregate symmetric pairwise products, producing controlled quadratic and higher-order interactions without materializing a full trilinear tensor.
Useful5/10
Difficulty4/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
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 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
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
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 differentiable penalty to a graph generator or graph predictor when its soft higher-order clique density violates the sharp lower bound implied by its lower-order clique density. The regularizer encourages generated graphs to have mathematically consistent motif statistics without hard-discretizing the predicted adjacency matrix.
Useful5/10
Difficulty4/10
Novelty7/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