Unverified
2026
Replace a collection of dense task-specific linear layers with a common sparse structural matrix and task-specific edge strengths. All tasks share the same learned connectivity pattern, but retain independent values on active connections, allowing parameter sharing without forcing identical interactions.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Treat the maximum dependency distance faithfully modeled by a finite neural architecture as an emergent correlation length, and estimate how it grows with depth, state size, or attention span. Fit the exponent \(\kappa\) and use it as an architecture-selection signal: a model with larger \(\kappa\) should acquire long-range competence more efficiently at equal parameter or FLOP budget.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Partition a sequence, image, or graph into regions processed by a cheap local operator and a more expressive nonlocal operator, then couple their boundary activations with a shared continuity equation and a conservative interface-flux equation. The interface correction prevents the local and global branches from creating discontinuities or duplicated information, allowing nonlocal computation to be restricted to selected regions while preserving global consistency.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained residual block by a four-field feature dynamics containing a primary feature T, flux-like auxiliary features J, curl-cleaning features psi, and a scalar cleaning feature phi. Couple these fields with learned skew-adjoint spatial operators so that the reversible block preserves the squared feature norm, while a separately controlled relaxation term can remove high-frequency or constraint-violating components. Use an exact Cayley update rather than explicit Euler to…
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Represent an input perturbation, feature mask, or expert route as a subset of a ground set of size n. Collect a useful family F of k-subsets, then generate larger l-subsets only by adding l-k elements to members of F; these are the upper-shadow augmentations. The paper's explicit profile predicts a guaranteed fraction of distinct l-masks covered by this procedure, allowing an augmentation system to replace inefficient random mask sampling with targeted combinatorial expansion.
Useful5/10
Difficulty4/10
Novelty9/10
Unverified
2026
Use the paper's three rank-two graph families as a small, analytically understood library of propagation topologies. Select or mix figure-eight, theta, and dumbbell edge-routing motifs to obtain different effective receptive-field growth rates while retaining an exact spectral-radius target for normalization and architecture search.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Initialize a unitary feature-mixing layer with a shallow brickwork circuit of independent random SU(4) gates instead of sampling or factorizing a dense Haar-random unitary. Stack enough layers to obtain a target contraction of non-Haar components, using the paper's constant spectral-gap principle to make the required depth essentially independent of the number of qubits. The resulting layer is local, parameter-efficient, exactly norm-preserving, and should provide Haar-like scrambling at…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a finite-resolution geometric code to a 3D neural encoder: quantized lattice occupancy, local barycenters, and tangent directions are converted into structural tokens alongside ordinary point or mesh features. Choose lattice spacing from estimated local reach so that small perturbations do not change the code, and train the continuous encoder to agree with this discrete structural representation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace one dense attention layer with a sparse hierarchical attention module whose states are clusters of tokens and whose transitions merge two clusters or reverse a previous merge. Enforce the flag-space cancellation law on pairs of alternative two-step merge paths, so redundant hierarchical routes destructively interfere instead of producing duplicated features. Normalize merge-then-unmerge loops using the product of the sizes of the merged clusters, preventing large clusters from…
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Represent sequence positions as vertices on a circle and use a maximal family of mutually non-crossing d-arcs to define the allowed attention interactions. Rotate the family by d positions, or use several phase-shifted families across successive layers, so each layer has only O(N) edges but repeated layers propagate information over long distances. The geometric compatibility rule replaces arbitrary local-window or hand-designed sparse masks with a structured family whose maximality gives broad…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace independent logits for all d-subsets with a neural head that outputs a d-by-n matrix A and assigns subset weight x_I=det(A_{:,I}). After normalization, these minors define a probability distribution over subsets. The head imposes a strong algebraic coupling between subset probabilities, reducing parameters and potentially improving extrapolation to rarely observed subsets.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace one-step greedy landmark selection in Nyström attention or kernel compression with a restricted pairwise-lookahead rule. The lookahead is motivated by the paper's explicit obstruction: a signed triangle can make individual column gains exhibit increasing rather than diminishing returns, so the best next column need not belong to the best pair.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace unconstrained pairwise token-routing interactions with a structured two-token router derived from an involutive set-theoretical Yang–Baxter solution. The pair operator is a convex interpolation between identity and a permutation of discrete routing states, so it cannot amplify probability mass or logits when applied to routing distributions. The Yang–Baxter relation provides a falsifiable test for whether three-token routing updates are insensitive to the two admissible…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace dense spatial pooling or integral evaluation over a planar domain by a sparse cubature layer whose nodes are poles of a rational approximation fitted only on the domain boundary. For analytic or nearly analytic neural-field channels, the same learned field can then be integrated using substantially fewer evaluations than a uniform grid, while the boundary approximation residual supplies a cheap reliability signal.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained simplex router or differentiable mixture layer with a resource-cost-aware router whose learned costs satisfy the paper's monotonicity curvature condition. Use a Euclidean-regularized Frank–Wolfe oracle to update routing probabilities, which should reduce cycling and sensitivity when several examples or agents compete for the same experts.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a neural mixing layer on Fourier or positional modes using a small set of exponentiated Virasoro generators instead of a dense mode-to-mode matrix. The generator coefficients are shared across all inputs, while the Lie bracket fixes how different mode shifts interact; an optional central channel captures the special coupling between modes whose indices sum to zero.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's structure-inheriting crossover to construct discrete token-to-expert assignments from two parent routers instead of randomly reinitializing routing assignments. Build a sparse token-similarity graph and optimize an objective combining within-expert similarity, cross-expert separation, and expert-load balance; use the resulting assignment to initialize router logits or to periodically repair overloaded experts. The method is especially suitable for small calibration batches or…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's degree-sensitive crown inequality to penalize or constrain router assignments that create medium- or high-degree tokens or experts. The resulting router favors a controlled population of low-degree, medium-degree, and high-degree nodes rather than allowing a few hubs to absorb most interactions, which can stabilize sparse attention or mixture-of-experts load balancing.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an ordinary graph diffusion or message-passing operator with a positive-semidefinite Laplacian whose kernel contains a prescribed node-wise subspace. The layer smooths only feature components orthogonal to that subspace, preserving global constants, positional modes, or other structural signals even when graph edges are dynamically added or removed.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the isolated positive spectral mode created by a finite branch defect on an otherwise long cycle as a graph positional feature. The feature should concentrate around structurally unusual vertices while remaining insensitive to the total cycle length, providing a principled alternative to raw Laplacian eigenvectors for cycle-with-branch graphs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a dense or irregular binary interaction matrix in a value-aggregation layer with a signed sum of blocky masks. Each blocky mask groups a set of query rows with a disjoint set of key columns, allowing all queries in a group to reuse one summed value vector. This is most suitable for linear attention, graph message passing, or any layer where the interaction matrix is applied directly to values rather than passed through a row-wise softmax.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
For a learned phase-space layer, estimate its symplectic Fourier bandwidth R and divide its output gain by the theorem's support-dependent factor R raised to an exponent determined by the Schatten index p. This creates a resolution-aware normalization: layers with larger phase-space bandwidth are automatically damped when p is not equal to 2, while the Hilbert-Schmidt case p = 2 remains unscaled.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Learn or select sparse cyclic convolution or relative-attention offsets whose pairwise differences collide less often modulo the sequence length. The paper's Fourier fourth-power identity turns this combinatorial objective into an FFT-computable differentiable loss, enabling fixed-K sparse patterns with lower aliasing and interference than random offsets.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Train a neural queue or event-sequence predictor using trajectories generated under an exponentially tilted scheduled-arrival law that makes rare overloads common. Reweight each tilted trajectory by its likelihood ratio, while optionally oversampling the rare-event subset to improve prediction of tail behavior.
Useful5/10
Difficulty5/10
Novelty7/10