Unverified
2026
Represent edge or pair-token features and propagate them with a convex mixture of two normalized channels: transitions through shared vertices and transitions through shared triangles. This preserves higher-order connectivity that an ordinary graph convolution loses, while the mixing coefficient q controls whether information follows pairwise support or genuine triangular structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Partition a neural state or feature vector into blocks and identify directed dependencies between blocks from one-step transition data. Use the inferred design structure matrix as a hard mask or soft gate on recurrent, state-space, graph, or mixture-of-experts couplings, replacing a dense unconstrained interaction matrix with a data-supported sparse graph.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment node features with eigenvectors corresponding to negative eigenvalues of the Bethe-Hessian H(t,G), rather than using only Laplacian or adjacency positional encodings. The diagonal D-I correction is designed for sparse, locally tree-like graphs and should suppress degree-fluctuation artifacts near the connectivity threshold. Feed the resulting coordinates to a GNN through a learned gate so the model can ignore them when they are uninformative.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Constrain a graph or token attention layer to behave like a row-stochastic diffusion with walk dimension \(\beta\), and choose its neighborhood radius from the paper's first-hitting-time tail bound. At propagation time \(t\), interactions with effective distance larger than \(r(t,\varepsilon)\) are removed because their total reachability probability is bounded by a prescribed error budget \(\varepsilon\).
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained entrywise nonlinearity on a positive Gram or covariance matrix by a learned scalar function satisfying the paper's finite-order positivity-preserver conditions. The transformed matrix remains PSD for matrices of the target width n, allowing nonlinear Gram propagation without eigenvalue clipping or projection.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a standard graph-convolution propagation step with a short time integration of the nonlinear graph flow \(\partial_t u=\Delta_p(u^q)\). The pointwise power \(q\) and gradient exponent \(p\) create state- and edge-gradient-dependent propagation: small signals can be suppressed or amplified by \(q\), while large graph discrepancies receive nonlinear diffusion controlled by \(p\). Use nonnegative feature states and conservative edge fluxes so the layer inherits positivity and total-mass…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a single local message-passing or convolution operator by a spectrally controlled mixture of fractional and ordinary diffusion. The exponent σ is learned or scheduled, while a crossover gate forces the model to change parameterization near the renormalization-group threshold σ*=2, allowing long-range propagation when useful without retaining an unnecessarily nonlocal operator at short scales.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Attach a small temperature-pressure residual head to a pretrained structural encoder instead of relearning the full free-energy surface. Predict one scalar Gibbs free energy and obtain entropy, volume, and other thermodynamic responses by automatic differentiation, enforcing that all outputs derive from a common potential.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a long sequence of graph propagation steps used to approximate a spectral graph filter with one block Krylov projection. Construct a basis from the input node features together with a small number of Gaussian probe vectors, evaluate the desired matrix function only on the resulting small projected matrix, and retain the output columns corresponding to the original features.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a distributed spectral positional encoding to a graph neural network, graph transformer, sparse-attention model, or MoE router by computing the dominant eigenvector of the current weighted adjacency matrix with a few warm-started power iterations. Unlike a Fiedler-vector feature, this encoding uses only local neighbor aggregation, is naturally nonnegative for nonnegative adjacency weights, and can be updated incrementally when the graph or edge weights change.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace a generic learned update on a triangular feature lattice by a max-plus octahedron recurrence, optionally softened with log-sum-exp. The layer propagates information between two time slices while preserving the paper's characteristic tropical local consistency, which may provide a parameter-efficient inductive bias for grid reasoning, image patches, or graph layouts.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a graph neural network with structural features computed from counts of small pattern homomorphisms whose pattern vertices are constrained to lie in selected vertex subsets. Unlike ordinary local aggregation, these features encode dense subgraph structure and can separate graphs or node sets that have identical low-order neighborhood statistics. Use a small learned bank of pattern graphs and sampled subset tuples so the method remains practical.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Search sparse reservoir wiring in graph space rather than repeatedly testing every candidate with its full nonlinear dynamics. Use graph descriptors to predict validation accuracy and nonlinear feature selectivity, then spend exact simulations on candidates with high predicted performance or high surrogate uncertainty.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an unconstrained spatial aggregation in a neural PDE surrogate or controlled-dynamics model with a fixed-branch expectation layer. Each output is a maximum over controls of a nonnegative weighted average of next-state values, with reflected overshoots attenuated by Robin factors. Increasing any input value therefore cannot decrease the output, giving a hard monotonicity and positivity property instead of relying on a penalty.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an ordinary hierarchical graph encoder with a finite chain-complex encoder whose learned boundary maps satisfy \(\partial_{k-1}\partial_k=0\). Compute Smith normal form on the integer incidence matrices and treat unit-labelled cell pairs as refinement overhead: cancel or gate those pairs before message passing, while preserving non-unit labels that encode genuinely nontrivial structure. The resulting representation should be insensitive to arbitrary cell subdivision while retaining…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the usual top-eigenvector positional encoding in a graph neural network with a density-selected spectral subspace. The selector explicitly searches below the leading eigenvectors, where community information may survive after latent geometric modes have consumed the largest eigenvalues. The selected coordinates can be concatenated to node features or used as a bias in graph attention.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independent top-k routing by a tree-structured hypergraph assignment layer. Each candidate route is a singleton or pair of resources, and the router selects exactly q_e routes for every tree edge e while ensuring that no resource is consumed twice. This removes capacity collisions before expert computation instead of repairing them with token dropping or load-balancing penalties.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace dense token-to-token attention in selected layers with communication through a small number of multi-token hyperedges. Each hyperedge aggregates its incident token states and broadcasts the resulting message back to those tokens, allowing higher-order interactions while reducing the number of pairwise links. Reconstruct hyperedges periodically from cumulative token displacement so stable tokens retain useful groups while rapidly changing tokens are regrouped.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Implement f(A)b inside a neural network with a short Lanczos recurrence instead of an eigendecomposition or dense matrix-function operation. Use an SPD operator A such as a regularized graph Laplacian or feature covariance matrix, and choose the number of iterations by monitoring successive approximations. For Stieltjes functions, Lanczos is guaranteed to be close to the best vector in the same Krylov subspace.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an all-pairs interaction or attention-like message field with an unbiased estimator obtained from a uniformly random partition into batches. Keep the partition fixed for \(\tau\) integration steps, then redraw it; the paper's error law predicts that too-long reuse causes a quadratic-in-\(\tau\) error accumulation, while finite-population error decreases as \(N^{-1}\).
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Compute a compact multiscale interaction signature between colored point clouds and append it to a point-cloud or multimodal neural network as a learned interaction token. The signature captures separated, overlapping, and higher-order enclosing configurations while remaining invariant to rigid transformations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute each graph edge's Lin–Lu–Yau curvature exactly from one p=1/2 Wasserstein problem, then use the resulting scalar as an edge bias or multiplicative gate in graph attention. Positive-curvature edges receive stronger message exchange while negatively curved edges are attenuated, giving the network a geometry-derived inductive bias rather than requiring the model to learn all edge importance from scratch.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use Kemeny’s constant as a diffusion-quality gate when adding shortcut edges or cliques to a graph used by a GNN. Candidate augmentations are accepted only when they reduce estimated average hitting time, preventing rewiring operations that superficially shorten paths but make the random walk mix more slowly.
Useful6/10
Difficulty5/10
Novelty7/10