Unverified
2026
Replace an ordinary graph diffusion or message-passing operator with a positive-semidefinite Laplacian whose kernel contains a prescribed node-wise subspace. The layer smooths only feature components orthogonal to that subspace, preserving global constants, positional modes, or other structural signals even when graph edges are dynamically added or removed.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct positional features from a self-similar digit system whose Fourier characters are orthogonal under a prescribed nonuniform measure, rather than sampling frequencies independently. Use several admissible multiplier values to create frequency bands while preserving the underlying Hadamard structure, giving a deterministic multiscale encoding with a better-conditioned feature Gram matrix on fractal or highly clustered coordinates.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Periodically project a rectangular neural-network weight matrix onto an approximately orthonormal-column matrix using LU-preconditioned CholeskyQR rather than ordinary QR or a polar iteration. Pivoted LU handles badly scaled and nearly dependent columns, while Householder orthogonalization of the LU factor produces a triangular preconditioner that makes the subsequent Cholesky step safer in fp16 or bfloat16.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the isolated positive spectral mode created by a finite branch defect on an otherwise long cycle as a graph positional feature. The feature should concentrate around structurally unusual vertices while remaining insensitive to the total cycle length, providing a principled alternative to raw Laplacian eigenvectors for cycle-with-branch graphs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a dense or irregular binary interaction matrix in a value-aggregation layer with a signed sum of blocky masks. Each blocky mask groups a set of query rows with a disjoint set of key columns, allowing all queries in a group to reuse one summed value vector. This is most suitable for linear attention, graph message passing, or any layer where the interaction matrix is applied directly to values rather than passed through a row-wise softmax.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace a locally oriented three-channel feature frame by its positive-definite polar factor, removing arbitrary SO(3) basis rotations before the feature enters an MLP, attention block, or graph message-passing layer. Process the resulting SPD matrix in log coordinates so the downstream network receives a globally unconstrained symmetric representation rather than a gauge-dependent frame.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a structural positional channel formed from the Krylov sequence generated by the graph adjacency matrix and the all-ones vector. For graphs with k main eigenvalues, this sequence has rank k, so a GNN can retain all information obtainable from global walk counts using only k node features rather than storing many adjacency powers.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace an unconstrained linear map on matrix-valued features by an exact operator-norm isometry assembled from parallel copies of X and its transpose. Contractive compression matrices and unitary basis changes allow a wider family than ordinary orthogonal layers, while a contractive remainder can increase output width without increasing the layer's spectral norm.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained bilinear matrix fusion or covariance head with \(\Phi(A,B)=\sum_{r=1}^R V_r^*(A\otimes B)V_r\). The output is PSD by construction, and the stronger block-level property makes the layer compatible with minibatches, mixtures, and Gram-matrix inputs rather than merely preserving positivity pointwise.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Build a deterministic complex-valued embedding for discrete IDs by evaluating finite-field polynomials through an additive character, but learn coefficients only for one representative of each Frobenius or cyclotomic orbit. The quotient removes parameters that generate exactly the same feature function after the trace map, avoiding flat optimization directions and reducing the size of the embedding layer.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Use the paper's finite-habitat approximation as a warning and design principle: averaging token- or state-dependent routing environments can reduce the persistence of specialized subnetworks. Partition inputs into environments, estimate environment-specific interaction kernels, and retain the heterogeneity that produces positive invasion margins instead of replacing it with one global average.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a sparse message-passing graph from a tree backbone by subdividing every backbone edge and attaching leaves so that 2d_T1(x_i)+f_i is constant across backbone vertices. Use this graph as a fixed communication skeleton, with propagation weights calibrated by the predicted spectral radius. The same construction can be compressed into an effective backbone operator by eliminating subdivision and leaf nodes.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct the latent transition from a nondegenerate bilinear form phi and a form-compatible operator instead of from an unconstrained dense matrix. The resulting SSM has an exact orthogonal or symplectic algebraic structure, reducing transition parameter redundancy and testing whether preservation of a latent pairing improves extrapolation on reversible, parity-sensitive, or Hamiltonian-like sequence tasks.
Useful5/10
Difficulty5/10
Novelty5/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
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.
Useful5/10
Difficulty5/10
Novelty5/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
Build an implicit layer from a piecewise-linear maximal monotone operator on visible variables z_* and auxiliary variables z_**, then eliminate the auxiliary block rather than exposing it in the network output. Compute the layer through a fixed point of the eliminated component of a nonexpansive resolvent, with damping when the auxiliary map is not strictly contractive.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Factor a neural linear layer as W = M A, where A is randomized at initialization and M is a deterministic channel mixer or learned feature transform. Regularize M toward low inverse-Hilbert–Schmidt norm under a scale constraint, because the paper's theorem predicts that this raises the high-probability lower bound on s_min(W) and reduces near-singular initialization events.
Useful5/10
Difficulty5/10
Novelty6/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
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 step-by-step hidden-state storage in a latent ODE, state-space model, or world model with a polynomial trajectory represented independently on short time blocks. At the end of each block, pass the next hidden state by summing temporal coefficients, allowing training and inference to discard the completed block while retaining a mathematically exact block interface.
Useful5/10
Difficulty6/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 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