Unverified
2026
Replace repeated substrings in long sequences with nonterminal symbols from an acyclic straight-line grammar, then run the transformer on the compressed sequence. Unlike ordinary fixed tokenization, the compression objective explicitly minimizes the number of reusable binary productions, allowing repeated document-specific or corpus-level motifs to become single units. An expansion map lets the model recover token-level outputs for selected positions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a sparse fixed orthogonal mixer by repeatedly applying pi/4 rotations to randomly matched pairs of feature coordinates. Place this mixer before top-k feature pruning, sparse projection, or activation quantization so that information is spread across coordinates without using a dense random matrix.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use the weighted feature Gramian to remove nearly dependent Fourier, sinusoidal, or dictionary features during training instead of relying only on magnitude pruning. The criterion detects redundant directions even when their learned coefficients are individually large, improving conditioning of the linear readout and reducing inference cost.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace dense token-to-token attention in a controlled ablation with a cyclic order-a recurrence whose coefficients are periodic across positions. The resulting mixer has linear cost in sequence length for fixed recurrence order and can enforce a fixed signed periodic boundary condition, providing a compact structured alternative to local attention or a lightweight state-space model.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Parameterize a sequence attention graph by a finite graph motif on positions [r], then lift that motif to arbitrary sequence lengths using strictly increasing embeddings. Instead of learning an independent positional mask for every context length, the model learns a small collection of order-preserving edge types whose induced graph is valid at every length and can be extended without retraining.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Rank candidate prompts, demonstrations, critiques, or system instructions by how many bits of reproduction cost they save for a specified artifact distribution. Replace raw prompt-token heuristics with a paired score that rewards both higher success probability and lower generation computation, then train or retrieve prompts maximizing this score under a token budget.
Useful6/10
Difficulty5/10
Novelty6/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 a global attention truncation rule with a per-query local-tail budget. For each query token, retain nearby or high-priority keys until the estimated discarded interaction strength is below a target epsilon; this uses the paper's central distinction between local tail mass and the extensive norm of the discarded operator. The resulting attention pattern can allocate long-range computation only to tokens whose local tail is large.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use a learned transition model inside MPC without computing its Jacobian. At every planning iteration, construct coordinate-wise secant matrices from model evaluations, freeze those matrices along the current predicted trajectory, and solve a constrained linear-quadratic subproblem; then re-roll out the nonlinear model and repeat. This targets model-based RL settings where reverse-mode differentiation through hundreds of dynamics steps is expensive or numerically unstable.
Useful6/10
Difficulty6/10
Novelty6/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
Replace the length-L learned convolution kernel in a causal sequence layer with K Laguerre basis functions, where K is much smaller than L and the basis parameter controls the decay time scale. The layer retains a long receptive field but learns only K coefficients, while FFT or a fixed state-space realization evaluates the resulting convolution efficiently. This is especially appropriate for audio, sensor streams, and long-context regression where the desired impulse response is smooth or…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Pack two real tensors into the real and imaginary components of one complex tensor, perform one complex transform, and recover both real spectra through conjugate symmetry. Combine this with implicit padding so separate padded real arrays and transform workspaces are not allocated.
Useful6/10
Difficulty6/10
Novelty5/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
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
Separate low-support monomials, which involve only a few distinct input coordinates, from high-support monomials in a high-degree symmetric interaction layer. Compute the low-support orbit features exactly and prune, sample, or factorize the high-support tail, using the paper's cutoff scale as the initial sparsity rule.
Useful6/10
Difficulty5/10
Novelty8/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
Replace random or k-means initialization of a k-expert router with a moment-based range finder on a calibration batch of hidden states. Estimate a low-dimensional second-moment subspace, enlarge it using one-free-index third-Hermite contractions, and fit the router's expert centroids and weights only in this resulting subspace. The router can then operate on projected hidden states while retaining an optional small residual adapter.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent adaptive computation or MoE routing as a continuous latent trajectory that crosses convex mode walls, with a Minkowski norm defining computational speed. At a wall, choose the outgoing latent velocity by the same constrained variational rule as billiard reflection, and use the local path-length certificate to detect or prevent pathological accumulation of infinitely many routing events in finite depth.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace a fixed confidence-threshold early-exit rule with a finite-horizon optimal-stopping policy over the model's evolving posterior confidence. The controller stops when the calibrated expected terminal error is no greater than the cost plus expected value of executing another neural block, permitting time-dependent and nonmonotone stopping regions.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Make Laplacian latency attention hardware-friendly by quantizing the exponential decay and row normalization to powers of two. Exponentials and divisions can then be implemented with lookup tables and integer shifts, enabling a low-bit attention kernel for neuromorphic and edge accelerators.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace the fixed number of Sinkhorn iterations used to normalize an attention kernel with a per-example stopping rule based on the local spectral contraction factor. Estimate the remaining marginal error geometrically and stop early on easy examples while retaining extra iterations on difficult or nearly disconnected examples.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Approximate a long hidden-state or key/value trajectory by a small sum of exponential modes, storing only the mode nodes and vector weights instead of every timestep. Recover the modes from a Hankel matrix through an annihilating polynomial, then reconstruct the trajectory or a compact recurrent state during inference.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the Osgood transform as a controller for adaptive residual-layer step sizes. Instead of choosing a fixed residual scale or requiring every block to have a small operator norm, reduce the step only when the predicted transformed pairwise distance consumes too much regularity budget.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a low-rank controller that observes and actuates only the graph's harmonic coordinates rather than all edge features. For a graph with first Betti number beta_1 = dim ker(B), a beta_1-dimensional cycle basis is sufficient to represent the entire harmonic sector, yielding a compact recurrent memory or adapter for circulation-dependent graph dynamics.
Useful6/10
Difficulty6/10
Novelty8/10