Unverified
2026
Replace dense spatial attention on a 2D feature grid by attention from every non-landmark token to a small periodic set of landmark tokens. Choose landmarks using the paper's residue construction so that every non-landmark token has at least one landmark exactly k Manhattan steps away. Use this guaranteed edge as a sparse global-information route, combined with a cheap local convolution or residual path for accuracy.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct one reference Lanczos basis for a symmetric propagation operator H, then derive several seed-specific spectral responses for Q_a(H)x_0 through finite-band polynomial connectors. With degree-r seeds, each transformed basis vector uses at most 2r+1 neighboring reference basis vectors, avoiding a separate Lanczos factorization for every seed.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an SVD-based pseudoinverse of a learned rectangular matrix with a low-degree polynomial initialization followed by a few Newton–Schulz iterations. The polynomial approximates the inverse Gram operator, while a cheap residual test accepts it only when the iteration is contractive and otherwise selects a conservative transpose-scaled initialization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace random or degree-based graph positional anchors with a greedy set chosen to maximize the entropy of the graph's Weisfeiler-Lehman equivalence partition. Give each selected anchor a unique trainable embedding, then run several WL-inspired refinement rounds to produce positional cell features. The resulting positional signal should distinguish nodes that ordinary message passing treats identically while using only a small anchor budget.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Represent a multiparameter feature stream as a direct sum of interval modules over the nonempty-subset lattice of several corruption, scale, or context variables. Each learned channel is active only on a connected order-convex region of the lattice, replacing a dense bank of unrelated per-condition adapters with reusable feature channels having explicit parameter-space lifetimes.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense Gaussian or learned projection from dimension N to m with a normalized partial circulant projection generated by a single Gaussian vector. For K-sparse hidden states, the restricted-isometry guarantee predicts approximate norm preservation while reducing stored projection parameters from O(mN) to O(N). The projection can be evaluated with an FFT and should be combined with explicit top-k gating so that the sparse-input assumption is enforced.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace direct source-to-target attention connectivity by two sparse incidence relations through a set of latent witness tokens. A source token attends only to a small set of witnesses, and each witness attends only to a small set of target tokens; the composed relation is trained to contain exactly one witness for desired pairs and no witnesses for undesired pairs. This produces a controllable sparse attention pattern whose errors can be measured entrywise against a dense teacher or known mask.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Compress representations of graph fragments according to their empirical edge-connection rank instead of using a generic hidden dimension. For fragments with t open ends, learn only the quotient space of boundary behaviors that remain distinguishable after gluing, producing a compositional graph network whose boundary-state dimension is capped by an estimated R^t.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Parameterize a large linear layer as a sum of binary tensor products, W = Σ_l A_l ⊗ B_l, and regularize a factor-level upper bound on its top-k singular-value sums. The bound controls all Ky Fan norms of W while requiring SVDs only of the small factors, making it suitable for tensorized MLP or attention projections.
Useful6/10
Difficulty5/10
Novelty6/10
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 latent factor map that is approximately 1-Lipschitz and require it to preserve important scalar 1-Lipschitz observables of the data distribution. Approximate the universal quantifier with an adversarial bank of neural probes, rewarding the encoder for retaining distributionally stable information while discarding high-frequency or sample-specific detail.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize a learned self-adjoint contraction so that its eigenvalues move toward 0 or 1 rather than accumulating in the transition interval. This suppresses ambiguous mixing modes and can enable a smaller binary spectral approximation at inference.
Useful6/10
Difficulty4/10
Novelty6/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
Augment a stable diffusive state-space model with pair states formed from products of slow latent modes. Single modes represent ordinary long-wavelength diffusion, while pair modes represent the interacting hydrodynamic operators responsible for late-time tails in quartic observables. Use the pair states only for selected readout channels or a low-rank subset of mode pairs, preserving near-linear inference cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent state update by a locally parameterized invariant manifold h equals K of z, where the latent dynamics z at the next step equal R of z and preserve slow modes near a degenerate fixed point. Train the embedding and reduced map jointly with an invariance residual, while a weighted lattice norm discourages perturbations in distant channels or spatial sites from growing.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Instrument selected neural-network operators with cheap stochastic perturbations and estimate how much their outputs change under finite-precision perturbations. Use the resulting per-operator score to identify unstable kernels and selectively switch them to FP32, compensated accumulation, or a stable reformulation instead of running the entire model at high precision.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Learn a low-dimensional active frame for a neural scalar quantity on a curved latent manifold, rather than averaging gradients in unrelated ambient tangent spaces. Use the frame as the only input to a low-rank adapter or as a constraint on fine-tuning updates, with parallel transport making gradient statistics comparable across samples.
Useful6/10
Difficulty5/10
Novelty6/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
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace a dense order-p tensorized neural layer with a sparse random hypergraph tensor whose support probability is alpha = c/N^{p-1}. Assign independent zero-mean marks to active hyperedges, so every tensor moment scales as N^{-(p-1)} while the total variance entering each output remains controlled. The resulting locally tree-like computation graph should reduce parameters and multiply-adds without immediately destroying signal propagation.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Select the coordinates of a sparse adapter or sparse fine-tuning mask using both Fisher width and inverse-Fisher width. The mask should avoid parameter subsets that are cheap in the Fisher geometry but extremely large in the inverse-Fisher geometry, or vice versa, thereby controlling both prediction sensitivity and estimator-like uncertainty.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary sign-gradient or fixed-range gradient quantization in distributed training with a non-adaptive one-bit refinement block. Workers generate all localization and multiscale residue bits using public randomness before the server knows the current aggregate gradient; after decoding a coarse center, the server chooses which stored phase and scale interpretation to use. This should reduce clipping and variance for heavy-tailed gradients without requiring a second communication round.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's effective-rank and eigengap-dependent covariance estimation rates to construct a confidence-aware low-rank bottleneck for transformer activations or key/value tensors. The bottleneck is enabled only when the top-p empirical eigenspace can be estimated more accurately than the desired compression error; otherwise the layer remains full-rank.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct sparse attention masks as regular or almost-regular hypergraphs: every query selects exactly w keys, while every key receives nearly equal incidence within each score or locality class. This preserves a fixed sparsity budget while removing systematic positional and head-level load imbalance that can cause hot keys, uneven memory traffic, and unstable gradients.
Useful6/10
Difficulty6/10
Novelty6/10