Machine-learning ideas tagged Graph nn in the ML taxonomy of the Math2NN corpus.
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.
Represent many related sparse graph or attention patterns inside one fixed host connectivity pattern and activate each target instance with binary directional masks. The learned edge transformation and sparse-kernel layout are shared across instances, while the mask selects the target graph, enabling one compiled operator to process heterogeneous structures.
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.
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.
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.
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.
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.
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.
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.
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…
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.
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.
Add a differentiable rearrangement-envelope penalty to a positive integral-kernel layer. The penalty uses the Laplace-transform inequality to prevent the sorted upper tail of the layer output from becoming substantially larger than the cumulative upper tail of its input, providing a distribution-sensitive alternative to ordinary activation clipping or an L2 penalty.
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.
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.
Construct a sparse attention or message-passing mask by sampling edges with preferential weights (d_u+alpha)(d_v+alpha), while keeping the edge count below the predicted connectivity threshold. This creates hub-like local communication patterns but prevents one giant component from forcing dense information mixing, reducing attention cost and potentially mitigating oversmoothing.
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.
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.
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.
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…
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.
Use the paper's topology-dependent Laplacian spectral bound to set the diffusion horizon of a graph neural network instead of using a fixed number of message-passing steps for every graph. For genus-g graphs, choose the horizon from the conservative slow-mode timescale n/(Delta g), while separately capping the step size to keep high-frequency modes stable.
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.
Apply the sharp lattice Hardy inequality to intermediate feature maps defined on a 3D voxel grid. Penalize feature configurations whose inverse-square-weighted energy around a designated anchor is too large relative to their nearest-neighbor gradient energy, discouraging isolated activation spikes near the anchor while retaining smooth spatial structure.