Unverified
2026
Replace uniform or random landmark selection in low-rank attention with approximate greedy pivoted QR selection on the attention matrix. At each step, select the key whose residual attention column has the largest norm, orthogonalize it against previously selected columns, and stop when the residual energy falls below a target tolerance. Use the selected columns as an adaptive attention basis and reconstruct the full attention output through a small coefficient matrix.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a degree-conditioned neighborhood-profile penalty to a GNN so that its effective message-passing graph has a controlled hub-neighborhood trend. The regularizer can either target a rank-one null profile, where neighbor degree is approximately independent of root degree, or deliberately target a learned/reference logarithmic trend when preferential-attachment-like structure is useful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute one-dimensional persistent homology and minimum-norm harmonic representatives, then use their absolute edge coefficients as topology-aware saliency in a graph transformer. Add the saliency to attention logits or use it as a soft regularizer so the model preferentially propagates information along edges that are essential to persistent cycles.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment standard pairwise attention composition with a shared ternary correction m_3(a,b,c), so two different parenthesizations of a three-token or three-edge composition need not agree exactly but are forced to differ by a learned bounded correction. This gives the network a structured way to represent context-dependent compositionality without replacing efficient quadratic attention with unrestricted third-order attention.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a collection of overlapping sliding-window features with approximately orthogonal incremental features: the length-m feature contains information not predictable from shorter consecutive windows. Use the paper's transition-operator Toeplitz precision matrix to decorrelate the resulting sequence of window features before attention, suppressing duplicated local evidence and improving conditioning.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent an attention or routing state as a symmetric projector or fixed-spectrum positive semidefinite matrix and refine it using the paper's double-bracket flow instead of unconstrained gradient steps. The update rotates the state toward a task-derived Hermitian cost matrix while preserving its eigenvalues, so rank, trace, and spectral diversity remain fixed by construction.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a low-rank trilinear attention module in which query, key, and value factors are constrained to the unit sphere and refined through a few proximal alternating sweeps. The proximal terms suppress factor oscillation and make each sweep improve a well-defined tensor interaction objective, offering a stable alternative to unconstrained tensor-power iterations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Condition a temporal neural network on a tempo or dilation ratio through a homomorphism from multiplicative positive scales to additive latent shifts. A ratio composed from several scale changes then produces the sum of their learned effects, allowing interpolation and extrapolation to rates absent from training instead of using an independent embedding per rate.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Augment a causal sequence model with a small hierarchy of prefix summaries weighted by powers of the logarithmic rank of each preceding token. The summaries retain order-sensitive deviations from a baseline representation while costing O(KNd) for sequence length N, hierarchy width K, and hidden dimension d, instead of O(N^2d) dense attention.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Turn the paper's graphon refinement operation into an adaptive mixture-of-experts or relational-attention router whose number of blocks is learned rather than fixed. Split a block when its members produce incompatible constraint gradients, and merge blocks when their relation rows are statistically indistinguishable, yielding a compact architecture that grows only where the data require extra structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary graph propagation, which repeatedly revisits the edge it just traversed, with a directed-edge non-backtracking operator. Normalize its learned gain using an estimate of the Hashimoto spectral radius so that feature magnitudes neither explode on high-growth graphs nor vanish on sparse graphs.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Give each query-token pair a positive adaptive edge weight that evolves by a multiplicative rule instead of relying only on instantaneous dot-product attention logits. Edges whose aggregate interaction is useful can grow, while overloaded or incompatible neighborhoods can shrink. Sparse initialization is preserved because an edge initialized at zero remains zero under the multiplicative dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a learned scalar ordering to a directed graph attention layer and retain only forward edges, producing a DAG attention mask without requiring a supplied topological order. Train the ordering with a differentiable surrogate for weighted surplus, and regularize it toward the paper's explicit half-weight-minus-l2 certificate. This supplies a principled alternative to random masking or unconstrained bidirectional graph attention when causal or hierarchical information flow is desirable.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace fixed sequence-to-sequence attention with a dynamically maintained tree of connected token groups. Groups can be fused to reduce the number of attention units or split when their representation is heterogeneous, while hypergraph connectivity and nestedness ensure that every intermediate hierarchy remains valid.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Augment every graph or set token with a positive learned mass M_i that controls how strongly it contributes to other nodes and evolves through a growth-minus-inhibition equation. Use separate learned interaction kernels for state transport and mass inhibition, while retaining a directed interaction matrix so the layer is not forced to be permutation-symmetric or conservative.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a statistical-complexity maximization term to attention rows or MoE routing distributions so that each probability vector is encouraged to contain a small dominant core and a nearly uniform low-probability halo. Unlike ordinary entropy regularization, this explicitly favors an intermediate concentration regime and predicts a two-level structure: one or a few large probabilities and all remaining probabilities close to one another. The regularizer should use a small coefficient because its…
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace ordinary row-degree or symmetric normalization in a directed graph neural network with a nonlinear Dyson scaling. For a nonnegative directed adjacency matrix A, solve a positive vector equation and propagate with B = D A D, where D is the diagonal matrix of the solution. The resulting operator has row sums strictly below one, giving an explicit bound against exploding directed message propagation while retaining asymmetric edge information.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use an anisotropic singular relative-position kernel in attention or graph message passing, with its exponent constrained by the paper's local integrability threshold. The module can represent sharper directional interactions than an RBF while providing an explicit certificate that its spatial gradient belongs to a chosen L^p space.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Regularize a neural attention or routing distribution according to how quickly it mixes toward a specified graph-dependent target, instead of penalizing only entropy or one-hop variation. The regularizer discourages pathological concentration on isolated graph regions while still allowing meaningful local structure, because concentration is judged after several graph-constrained Metropolis-Hastings steps.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace fixed degree normalization or unconstrained edge attention in a graph neural network by a positive edge metric initialized toward constant Lin–Lu–Yau curvature. On cycle-plus-leaf motifs, use the paper's closed-form regular-sun solution to set the relative strength of cycle edges and pendant edges, then optionally train a weak residual around this initialization. The hypothesis is that equalizing local transport curvature reduces anisotropic message propagation and improves…
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Build a sparse graph by thresholding normalized token or item inner products, then use the leading eigenvectors of its centered adjacency matrix as geometric features or a low-rank attention-logit bias. The graph avoids storing all pairwise similarities, while the paper's spectral bound supplies a concrete signal-to-noise test for deciding whether the resulting embedding is trustworthy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a purely recurrent or state-space history summary with two explicitly separated paths: a fixed-size state channel for compressed sequence mixing and a query-dependent indexed channel for exact or near-exact retrieval. Train a lightweight gate to invoke top-k retrieval only when the recurrent state has insufficient evidence for the current query, preserving near-constant cost on ordinary tokens while preventing catastrophic failures on long-range exact-recall tasks.
Useful6/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace expensive global spectral diagnostics of a cyclic or block-circulant neural layer by exact small Fourier-block calculations. Add a scale-normalized fourth-moment penalty, or directly cap the largest eigenvalue of each frequency block, to suppress frequency-specific amplification and reduce unstable training in long cyclic convolutions and structured attention.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a profile-preserving exchange layer that mixes representations through pairwise state swaps, with weights shared over all positions. Unlike ordinary token-wise MLP mixing, the layer explicitly models interactions between two categorical states while respecting the symmetry of position permutations.
Useful6/10
Difficulty6/10
Novelty6/10