Unverified
2026
Attach each token or graph node a learned scalar charge q_i and add a fractional stable kernel K_ij = exp(-tau D |q_i-q_j|^alpha) to the interaction mechanism. Constrain 0 < alpha <= 2, the exact range in which the kernel is positive semidefinite for arbitrary finite real charge sets, and optionally make tau layer-dependent to obtain multiscale interactions. This provides a principled alternative to unconstrained learned distance biases and can be used either as an attention-logit bias or as a…
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Construct training and evaluation examples whose every (d-1)-variable marginal is exactly independent, but whose full d-variable distribution contains a parity interaction. This isolates genuine high-order reasoning from shortcuts based on pairwise or lower-order statistics and can expose whether attention or MLP architectures learn the intended interaction.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace flat expert logits with scores generated by Gaussian increments on a binary routing tree. A leaf receives the sum of increments on its root-to-leaf path, so sibling experts have correlated logits and the router can learn nested coarse-to-fine specialization; an inverse-temperature schedule controls the transition from exploratory diffuse routing to sparse routing.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent top-k token selection by a quality-weighted determinantal subset objective based on the Hardy–Szegő kernel. Tokens with high learned quality are preferred, but geometrically redundant tokens have a small determinant contribution, encouraging diverse sets of routed experts, retrieved items, or attended context tokens.
Useful6/10
Difficulty6/10
Novelty5/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 or augment a dense attention similarity matrix with a Min-cone matrix generated by a monotone scalar sequence. The resulting matrix is positive semidefinite by construction, has only O(n) learned scalar parameters, and can be multiplied by values in O(n d) time using cumulative sums rather than forming an n-by-n matrix.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the number of tokens participating in an attention operation to adapt the projected query/key dimension according to the sharp Johnson–Lindenstrauss bound. Short attention windows receive a dimension limited by n-1, while longer windows use a logarithmic dimension, avoiding a fixed large head dimension when the current attention set contains too few points to require it.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an unconstrained Wasserstein representation-matching loss with a graph-causal transport loss whose coupling at node k is conditioned only on the representations of its parents. This forces domain alignment, distillation, or augmentation consistency to respect the information flow of the model's DAG, reducing spurious matches that exploit descendants or globally visible features.
Useful6/10
Difficulty5/10
Novelty7/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
Add a per-head controller that adjusts attention sharpness from the observed separation between within-cluster and cross-cluster token similarities. When a positive overlap gap becomes large, the controller lowers the head temperature to prevent exponentially localized attention and rank collapse; when the gap is small, it permits sharper attention so useful structure can form.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a uniformly sampled trajectory sequence by a binary temporal partition whose intervals are split only when the observed trajectory makes an excursion larger than a threshold. Encode one summary token per retained leaf, optionally including duration and endpoint displacement, so smooth trajectory regions receive fewer tokens while rapidly changing regions retain resolution.
Useful6/10
Difficulty4/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
Replace independent Gaussian attention noise or unconstrained token routing with a directed-polymer path distribution over positions and layers. The router aggregates exponentially many monotone paths through temporally correlated random edge scores, producing heavy-tailed but spatially coherent routing and preventing attention from collapsing onto a single token. The paper's t^{2/3} wandering and t^{1/3} free-energy fluctuations become measurable diagnostics and tunable targets rather than…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use attention-graph hitting times to identify tokens whose information has not mixed through the network, then route only those tokens through additional Transformer blocks. Tokens with fast reachability exit early, while slow or isolated tokens receive more computation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Treat each attention head as a directed Markov graph and penalize token pairs that require many propagation steps to reach one another. This discourages isolated attention communities and slow information mixing while preserving the ordinary task objective.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent prototypes or attention keys by points p_i on the unit sphere and regularize their configuration with a Green-potential log-partition objective inspired by the TPMS branch-point formulation. The objective penalizes configurations whose positive and negative Gibbs-weighted potentials are concentrated in different regions, providing a smoother alternative to pairwise repulsion or uniformity losses.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace dense attention or strictly local windows with a refreshed sparse communication graph whose edge lengths follow a truncated power law. For sequence positions or image patches at distance $r$, sample edges with probability proportional to $(1+r)^{-(d+\alpha)}$; in the regime $0<\alpha<d$, repeated layers should spread information across the sequence much faster than a local window while using only $O(nk)$ edges per layer. The main test is whether this preserves long-range accuracy at…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment standard Transformer positional embeddings with coordinates generated by the paper's signed-base digit expansion. Previous binary digits determine the sign and scale of later contributions, while a two-state Markov chain controls correlations between digits. This supplies multiscale positional structure using a small number of transition and base parameters.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent each Euclidean input point by its responses to randomly sampled half-spaces, then center those responses by the minibatch or source-distribution half-space occupancy. Use squared distances between these representations as a geometry-preserving substitute for raw Euclidean distances in graph-NN edge construction, cross-domain retrieval, or geometry-aware attention. The layer can compare point clouds from different ambient dimensions because each domain has its own half-space dictionary…
Useful6/10
Difficulty4/10
Novelty6/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
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
Construct a graph on tokens using a cheap similarity or k-nearest-neighbor rule, partition it into small-radius pieces, and use one pooled state per piece for cross-piece communication. The paper's bound guarantees that the total number of vertices exposed by all one-hop piece neighborhoods is at most 4n, so the routing graph can have linear rather than quadratic communication budget. The approximation is controlled by increasing the number of within-piece basis summaries rather than making…
Useful6/10
Difficulty5/10
Novelty7/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
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