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 selected ReLU or sigmoid units with a stochastic binary crossing activation that fires only when exactly one of two independent noise thresholds is crossed. The resulting expected activation is low for inputs far below or far above the noise distribution and maximal near its median, creating an analytically controlled band-pass and potentially reducing saturation-driven instability.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Insert a fixed or learnable complex coordinate stretch outside the region where a neural operator models the physical interaction, so outgoing waves are damped and resonant states become ordinary discrete eigenmodes on a finite grid. Train the network with eigenvalue or resolvent losses computed after the stretch, while preserving the physical field in the interior region.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct p shared neural replicas of the same token or feature set, quotient their outputs by the cyclic group C_p, and train a power head to agree with the representation obtained from a jointly processed p-fold input. Add a filtration score whose value is nondecreasing under the power map and strictly increases on deliberately nontrivial replica combinations. The experiment tests whether this algebraically structured consistency signal is better than ordinary pairwise augmentation…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unrestricted collection of nested dyadic attention windows on a 2D token grid by a sparse antichain: no selected window may contain another selected window. Use the paper's exponential occupancy guarantee to control how many attention blocks reuse the same token, and add a differentiable log-moment penalty during training when exact antichain selection is relaxed. The expected benefit is bounded peak KV reuse and more predictable sparse-attention cost without discarding multiscale…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a distribution-free rank warp before selected MLP or attention projections. For each scalar activation, replace its empirical rank u by the cumulative interval map induced by the Type-III derangetropy kernel, optionally followed by Gaussian or affine output calibration. The transform is invariant to strictly increasing reparameterizations of the feature and contracts the marginal toward central ranks, potentially reducing sensitivity to heavy tails and outliers.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace raw polynomial interactions between neighboring feature vectors with central polynomial interactions computed after subtracting the local feature mean. Keep separate second-, third-, and fourth-order channels and apply independent residual gates to them, so a uniform shift of every feature in a neighborhood cannot create artificial cross-order responses. This is a drop-in higher-order mixer for a small transformer or graph neural network.
Useful5/10
Difficulty5/10
Novelty6/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
Replace mean or max pooling over a set of learned element embeddings with pooling based on the metric-magnitude weighting. Pairwise distances create a globally coupled correction for redundancy, so geometrically isolated or boundary elements can contribute differently from dense clusters of nearly duplicate elements.
Useful5/10
Difficulty5/10
Novelty8/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
For every unordered pair of scalar features, construct invariant coordinates from the elementary symmetric quantities s=x+y and q=xy, then feed a truncated orthogonalized polynomial basis in (s,q) to the neural network. Estimate the basis by weighted Gram-Schmidt or Cholesky whitening under the paper's triangle weight, so polynomial channels have low redundancy and controlled scale instead of requiring an unconstrained MLP to learn both symmetry and decorrelation.
Useful5/10
Difficulty3/10
Novelty7/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
Replace a singular inverse interaction kernel by the finite part of its meromorphic continuation at an exceptional dimension, producing an explicit polynomial-times-logarithm feature interaction. This gives a controlled alternative to adding an arbitrary ridge term when a learned polynomial Gram matrix becomes rank-deficient.
Useful5/10
Difficulty5/10
Novelty8/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
Add an invertible two-dimensional flow block whose Jacobian and coordinate outputs are explicitly regularized to preserve independence of several prescribed product distributions. Instead of estimating independence only from samples, enforce the change-of-variables functional equation for multiple density probes, encouraging the learned map to belong to a low-dimensional family of independence-preserving transformations.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an eigendecomposition-based spectral controller in a small recurrent or state-space transition layer with explicit polynomial projectors. Each hidden state is split into invariant modes, and each mode receives a separately constrained recurrent multiplier, enabling direct suppression of unstable modes or selective retention of long-memory modes using only matrix-polynomial evaluations.
Useful5/10
Difficulty6/10
Novelty6/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
Preprocess a noisy input graph into a high-degree core and compute a Jordan-center anchor in that core. Feed each node its distance to the anchor, and optionally use the anchor to bias graph-transformer attention; the hypothesis is that this suppresses spurious low-degree noise and gives the network a stable global coordinate system.
Useful5/10
Difficulty4/10
Novelty6/10