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
Replace count-only MoE load balancing with greedy balancing of aggregate token-feature vectors. A token is assigned to the expert for which adding its feature vector produces the smallest increase in that expert's squared aggregate norm, encouraging experts to receive complementary semantic mixtures rather than identical token counts.
Useful6/10
Difficulty5/10
Novelty6/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 raw polynomial or Fourier-like features in a small MLP with basis functions orthonormal under a Sobolev inner product that jointly measures feature magnitude and input derivative magnitude. This explicitly controls feature smoothness while preserving decorrelation, potentially improving conditioning and reducing the need for large derivative-regularization coefficients.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a continuous allocation or routing decision with a lattice-valued decision whose unit size is explicitly normalized by total capacity. Round allocations downward rather than to the nearest lattice point, preserving per-example capacity feasibility, and train or evaluate against the resulting granularity ratio rather than treating discretization as an implementation detail.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent each recurrent latent state as a pair of unit quaternions \((q_1,q_2)\in\mathrm{SU}(2)^2\), and evolve it with a composition of elementary Nielsen maps corresponding to a chosen hyperbolic matrix \(A\in\mathrm{SL}(2,\mathbb{Z})\). The layer exactly preserves the group manifold and Haar volume, preserves the commuting locus \(q_1q_2=q_2q_1\), and reproduces toral hyperbolic dynamics there, giving a structured long-horizon prior instead of an unconstrained matrix recurrence.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a learned dense bilinear map with a structured family of signed orthogonal matrices. Given feature vectors y,z in R^n, produce r interaction features h_a = y^T H_a z / sqrt(n), where the H_a form a Hadamard/Clifford-like family; the resulting bilinear map has operator norm at most one when r is within the Hurwitz–Radon limit. Learn only channel projections and optional scalar gates around this fixed mixer.
Useful6/10
Difficulty6/10
Novelty7/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 real diagonal state-space channels with complex damped oscillators whose hidden states encode both amplitude and phase. Train with parallel causal convolution and deploy with the equivalent one-step recurrence, allowing the same layer to support efficient batched training and low-memory streaming inference.
Useful6/10
Difficulty5/10
Novelty4/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
Implement f(A)b inside a neural network with a short Lanczos recurrence instead of an eigendecomposition or dense matrix-function operation. Use an SPD operator A such as a regularized graph Laplacian or feature covariance matrix, and choose the number of iterations by monitoring successive approximations. For Stieltjes functions, Lanczos is guaranteed to be close to the best vector in the same Krylov subspace.
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
Replace a Euclidean low-rank latent decoder with a geodesic factor decoder on a Riemannian manifold. A learned location α provides the component center, a small set of tangent loading vectors V captures anisotropic variation, and latent coefficients z generate curved manifold-valued features through the exponential map. Multiple such decoders can form a mixture-of-geodesic-experts layer for multimodal representations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute a compact multiscale interaction signature between colored point clouds and append it to a point-cloud or multimodal neural network as a learned interaction token. The signature captures separated, overlapping, and higher-order enclosing configurations while remaining invariant to rigid transformations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use an LKJ correlation factor as the correlation component of a variational posterior over a compact adapter, LoRA factor, or Bayesian neural-network parameter block. The model learns marginal scales separately while the correlation matrix remains automatically positive semidefinite and unit-diagonal, avoiding unconstrained covariance matrices, invalid correlations, and fragile covariance decompositions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Compute each graph edge's Lin–Lu–Yau curvature exactly from one p=1/2 Wasserstein problem, then use the resulting scalar as an edge bias or multiplicative gate in graph attention. Positive-curvature edges receive stronger message exchange while negatively curved edges are attenuated, giving the network a geometry-derived inductive bias rather than requiring the model to learn all edge importance from scratch.
Useful6/10
Difficulty5/10
Novelty5/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 Kemeny’s constant as a diffusion-quality gate when adding shortcut edges or cliques to a graph used by a GNN. Candidate augmentations are accepted only when they reduce estimated average hitting time, preventing rewiring operations that superficially shorten paths but make the random walk mix more slowly.
Useful6/10
Difficulty5/10
Novelty7/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
Construct a recurrent module with a phase variable and a transverse memory coordinate modeled on a perturbed twist map. Train the transverse state to lie on an invariant graph over the phase, while the phase follows an approximately irrational rigid rotation. A KAM-inspired graph correction and residual penalty should reduce long-horizon drift in recurrent prediction.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained geometric latent vector with a state consisting of discrete chain coefficients, a continuous current, and an integral-current curvature. Neural updates are projected through the differential-homology boundary operator, so learned states remain compatible with conservation and boundary structure on meshes or point clouds.
Useful6/10
Difficulty5/10
Novelty7/10