Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build neural computation graphs with explicitly phase-budgeted serial and parallel branches, treating serial compositions as SRG products and parallel residual branches as SRG sums. Allocate phase centers theta_i so that every loop or branch aggregate stays away from -1, enabling stability-aware architecture search and constructive control of branch gains.
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
Use a fixed spherical t-design as the direction codebook for a directional attention or feature-aggregation module instead of independently sampled random directions. Equal weights provide exact zero mean and isotropic second moments, while exactness for spherical polynomials up to degree t reduces directional aliasing and seed-dependent anisotropy.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a freely learned finite impulse-response mixing kernel with a matrix polynomial whose roots are constrained to the unit circle. The resulting block-Toeplitz operator has an explicitly positive semidefinite spectral construction, while increasing the polynomial degree gives a systematic capacity knob for approximating matrix-valued frequency responses.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace generic cross-scale mixing with a fixed-shape or lightly parameterized Erdelyi-Kober fractional convolution over logarithmic scale. The fractional order controls how strongly nearby scales are emphasized, while the exponential tail parameter controls the receptive field over distant scales, providing an interpretable alternative to dense cross-scale attention.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Augment a sequence network with a learned staggered matrix-product-operator symmetry and penalize its commutator with the network map. Unlike ordinary equivariance, the auxiliary operator need not define a self-commuting transfer-matrix family: it can be discovered through cross-commutation with a second alternating operator, while nilpotency supplies a finite hierarchy of symmetry constraints. The model should preserve generalized symmetry sectors and exhibit lower commutator error on…
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Grow a mixture-of-experts layer by splitting one expert into two children while conserving its routing mass, and choose the split ratio to minimize the worst imbalance over all intermediate expert counts. Use the paper's sharp threshold as a hard design target: with n experts, some intermediate stage must have capacity ratio at least D_n = 2^{1-1/\lceil n/2\rceil}, so schedules substantially below this are impossible rather than merely difficult to discover. Initialize child router logits with…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a uniformly sampled trajectory sequence by a binary temporal partition whose intervals are split only when the observed trajectory makes an excursion larger than a threshold. Encode one summary token per retained leaf, optionally including duration and endpoint displacement, so smooth trajectory regions receive fewer tokens while rapidly changing regions retain resolution.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace dense token-to-token attention in selected layers with communication through a small number of multi-token hyperedges. Each hyperedge aggregates its incident token states and broadcasts the resulting message back to those tokens, allowing higher-order interactions while reducing the number of pairwise links. Reconstruct hyperedges periodically from cumulative token displacement so stable tokens retain useful groups while rapidly changing tokens are regrouped.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace top-k token pruning by greedy maximization of a diversity-aware monotone submodular utility under a spacing or coverage constraint. The selector repeatedly chooses the feasible token with the largest marginal utility, avoiding the redundant-token failure mode of independent score ranking while inheriting a constant-factor approximation guarantee under the stated 2-system abstraction.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a conventional feature-pyramid sum by a bounded multiscale differential transform. At each scale, subtract a blockwise conditional expectation from a local average, then combine these residuals with bounded coefficients. Add a penalty on the largest interval response so that contributions from adjacent scales cannot accumulate destructively or explosively.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained matrix nonlinearity on small symmetric feature blocks with the isotropic spectral lift of a permutation-equivariant monotone map on eigenvalues. The layer remains orthogonally equivariant, while the paper's equivalence transfers a scalar inner-product monotonicity certificate from eigenvalue space to the full matrix space.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a causal memory branch whose weights are generated by the paper's power-type Volterra kernel rather than learned independently at every lag. Learn or softly constrain the exponents so the model can select rough short-memory behavior or smoother long-memory behavior while using only a few parameters. The branch can be implemented as a truncated causal convolution, a multiresolution approximation, or a recurrent state-space realization.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use attention-graph hitting times to identify tokens whose information has not mixed through the network, then route only those tokens through additional Transformer blocks. Tokens with fast reachability exit early, while slow or isolated tokens receive more computation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use enumerated weighing matrices as sparse orthogonal channel-mixing operators inside MLPs or residual blocks. Their ternary entries reduce multiplication to signed additions, while exact orthogonality prevents amplification or attenuation of feature norms; a trainable fixed-support version can recover expressivity without giving up computational sparsity.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the support graph of a sparse attention or routing mask as a feasibility object before applying normalization. Reject or minimally repair masks whose neighborhoods violate Hall's condition, ensuring that every selected query/key subset has enough reachable mass to support the desired marginals.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a neural-network weight tensor by rank-one terms whose mode factors are selected from shared orthonormal bases, and impose the same basis alignment across tensor flattenings. During or after training, retain the largest coefficients to obtain a structured truncation analogous to truncated SVD. This should produce better-conditioned tensorized layers than unconstrained CP factors while preserving a directly controllable accuracy/compute tradeoff.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a neural layer with two independently ordered transformations and train its operators to satisfy the paper's diamond equations, so that applying direction 1 then direction 2 gives the same result as direction 2 then direction 1. Unlike ordinary weight sharing, the mixed identity permits noncommuting operators whose interaction defects cancel exactly.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Project each FFN residual update onto the tangent space of the current token residual direction before adding it to the stream. This preserves the component that changes representation direction while suppressing norm-only motion, which may reduce residual-norm drift and aggregation-induced representation collapse.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a learned sequence-mixing matrix with a structured lower-triangular Sprugnoli operator whose square is exactly the identity. Applying the same operator in reverse reconstructs activations exactly, so it can be used as a reversible Transformer mixer or reversible channel permutation while retaining nontrivial long-range mixing.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace raw pairwise attention or graph-edge scores by exact U-centered residuals, removing additive effects attributable to either endpoint. The resulting scores represent interaction beyond independent source and destination biases and satisfy zero row sums, preventing a few high-degree or high-activation tokens from dominating relational aggregation.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace a recursive product implementation of a rational spectral filter with an additive sum of independently evaluated resolvents. Use the layer on a graph Laplacian, token-similarity operator, or other sparse feature operator to obtain a high-order filter without multiplicative roundoff and gradient amplification; the independent solves can also be batched or distributed across devices.
Useful6/10
Difficulty6/10
Novelty6/10