Unverified
2026
Replace part of dense token mixing with a small bank of structured permutations acting on a hierarchical token tree. Diagonal inheritance shares the same local permutation across all descendant copies, while selector words activate one connector type at a chosen level and remain inactive on the next type, providing controllable multiscale receptive fields without constructing a dense attention matrix.
Useful5/10
Difficulty5/10
Novelty7/10
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
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 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
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
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
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
Replace a fixed top-k expert count with a stochastic, token-specific fanout generated by a supercritical binary branching process stopped at a geometric time. The resulting number of active experts has finite mean but a power-law tail with log-periodic modulation, allowing most tokens to use little compute while reserving larger computation for difficult or ambiguous tokens.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct a shared latent transformation as a neural monad-like operator Γ=Ω∘Σ, and expose its iterates Γ^{q+1}Y as a refinement trajectory rather than stacking unrelated layers. Aggregate the resulting representations with a learned or fixed realization weighting, while training an algebra-action map θ:ΓY→Y to make one-step refinement compatible with the original representation. This creates a shallow-parameter, arbitrarily deep computation path with explicit compositional…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace or augment relative-position attention with a positive fractional-integration mixing kernel whose radial behavior has separate inner and outer power laws. Tokens close to one another interact through the usual fractional singularity, while tokens near different radial scales receive a ground-state correction that can improve multiscale information transport without introducing a dense learned positional table.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent top-k expert or attention-edge selection with a gate vector constrained by hierarchical path budgets modeled on the paper's extended-Dyck-path polytope. Ordinary interactions receive continuous nonnegative capacities, while a designated class of cross-group interactions receives binary or clipped-to-one gates, producing structured sparsity and preventing many correlated paths from consuming the same routing budget.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a sparse message-passing graph from a tree backbone by subdividing every backbone edge and attaching leaves so that 2d_T1(x_i)+f_i is constant across backbone vertices. Use this graph as a fixed communication skeleton, with propagation weights calibrated by the predicted spectral radius. The same construction can be compressed into an effective backbone operator by eliminating subdivision and leaf nodes.
Useful5/10
Difficulty5/10
Novelty6/10