Unverified
2026
Build a deterministic complex-valued embedding for discrete IDs by evaluating finite-field polynomials through an additive character, but learn coefficients only for one representative of each Frobenius or cyclotomic orbit. The quotient removes parameters that generate exactly the same feature function after the trace map, avoiding flat optimization directions and reducing the size of the embedding layer.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Add a loss that prevents an intermediate feature map from being simultaneously concentrated inside a porous spatial region and a porous frequency region. The regularizer is based on the fractal uncertainty inequality: if frequency support is restricted to a porous set Y, then the fraction of feature energy inside a porous spatial set X is at most C h^beta; violations of this bound are penalized.
Useful5/10
Difficulty4/10
Novelty7/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
Represent MoE experts as leaves of a balanced ternary tree and regularize the hierarchical boundary of each expert's assignment mask. At fixed routing mass x, the ternary martingale isoperimetric theorem supplies the explicit minimum one-variation T_3(x), so the router can be penalized according to an occupancy-dependent profile rather than a uniform parent-child disagreement cost. This should favor coherent, stable routing regions while preventing small expert supports from obtaining…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a barycentric rational activation or filter whose interpolation nodes are periodically zoomed into the range of preactivations or eigenvalues actually encountered by the network. Protect the layer from catastrophic poles by monitoring the associated generalized eigenproblem and penalizing poles close to the active input interval. This targets rational networks whose expressivity comes from localized poles but whose training is destabilized by denominator zeros.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a neural architecture whose receptive field or attention span is increased according to an estimated disorder-to-order crossover scale. Local branches process windows below the crossover as if they were stochastic, while a global branch is activated only when the context exceeds the predicted scale needed to expose deterministic recurrence. This targets sequences or images containing long-range quasiperiodic, hierarchical, or algorithmically generated structure that is statistically…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained deep routing tree by a q-ary descendant hierarchy with an explicit even height h=0,2,4,... labeling feature scale or computation depth. Train the router so that empirical occupancy of heights follows the exact even-sector law from the Nagao quotient, preventing concentration at shallow layers or unstable overuse of very deep paths.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the tropical dynamical degree as an analytic expansion budget for repeated neural blocks. Layers with $pq>4$ deliberately expand along a known tropical eigendirection, while layers with $pq\leq4$ avoid exponential asymptotic growth; a schedule can therefore increase representational mixing without allowing hidden-state norms to explode.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace or augment conventional dot-product attention with features generated by a convex polytope's lattice Laplace partition function. For a query-dependent point inside a learnable polytope, the log-partition gradient is the expected lattice direction under a Gibbs distribution, while its Hessian is a covariance matrix that supplies curvature-aware features.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace softmax attention or dense MoE routing with a normalized Rayleigh–Jeans distribution over tokens or experts. If an item's energy is close to the chemical potential, its probability becomes disproportionately large, creating controllable low-energy condensation instead of the exponentially smooth allocation produced by softmax.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent selected activations, weights, or optimizer accumulators as four floating-point limbs and evaluate products through tensor-core matrix multiplications encoding limb convolution. Retain the convolution components during reductions and renormalize only at block boundaries, avoiding branch-heavy multi-double arithmetic inside every multiply-add.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a sparse attention mask from a fixed regular candidate graph and one scalar random label per token, retaining edge $(u,v)$ when $x_u+x_v\geq\tau$. Unlike independent random pruning, this produces correlated neighborhoods and a controllable distribution of token degrees, potentially giving some tokens broad receptive fields while retaining a fixed sparse budget.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Augment a graph neural network or graph transformer with counts of cyclic walks whose successive steps are required to be graph edges or graph non-edges according to a binary pattern. These features encode induced-subgraph structure that ordinary adjacency powers miss, and can be concatenated to the graph-level token or used as an auxiliary prediction target.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace an ordinary token aggregation step with a p-replica cyclic-equivariant block. Features are copied into p replicas, processed by shared operators, coupled through a cap-like bilinear interaction, and projected onto cyclic invariants. An auxiliary commutation loss enforces that applying the operator before or after the p-fold lift gives similar outputs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a neural layer's dense parameters by a real parameter tensor and a binary activity mask, then update the mask using importance scores measured across multiple perturbation intervals. Gates that repeatedly occur in non-dominated accuracy–cost configurations receive larger scores and are more likely to be retained or activated, avoiding uniformly random sparse rewiring.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace ordinary bag-of-events pooling for an ordered trajectory, graph walk, or token event stream with a reduced-word representation in a free group. Each event contributes a signed group word, and the model aggregates signed differences (w-1), preserving order-sensitive information while making explicitly paired local events cancel.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained order-k weight tensor with a sum of components that are symmetric only within selected contiguous index blocks. This preserves interactions between blocks while tying parameters under within-block permutations, providing a tunable middle ground between a fully dense tensor and a fully symmetric tensor.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the logarithmic exhaustion as a geometry for bounded hidden representations rather than only as a parameter constraint. A representation approaching the boundary receives an increasingly large metric, making ordinary Euclidean motion expensive and discouraging brittle saturation while preserving a bounded intrinsic gradient for the boundary coordinate.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Treat each directed attention matrix as a graph transition matrix and form its Laplacian L = I - A. Compute the principal-cofactor vector to identify tokens with weak global access to the rest of the layer, and regularize the nonzero-eigenvalue product so attention does not become reducible or nearly singular. This targets pathological attention heads that isolate token groups and produce unstable or poorly propagated representations.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace ordinary dot-product attention logits with a strictly totally positive kernel evaluated on positive, ordered scalar coordinates attached to queries and keys. Use the modified-Bessel kernel K(x,s)=I_s(x), whose every ordered minor is positive, then row-normalize it as an attention matrix. This creates an attention operator with a mathematically enforced anti-oscillatory structure rather than merely positive entries.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Calibrate the maximum attention logit in each head against the log-correlated extreme-value law instead of applying fixed clipping or a fixed max-norm penalty. Penalize only maxima that exceed the predicted log N minus three-quarter log log N baseline by an unusually large order-one fluctuation, allowing ordinary sharp attention while suppressing rare pathological spikes.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a Vandermonde conditioning objective to a mixture-of-experts router so that experts acquire distinct scalar routing signatures instead of collapsing onto the same score region. The regularizer uses powers of one learned scalar score and directly penalizes near-coincident expert scores, providing a finite-mode identifiability signal complementary to load balancing.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Train a sequence encoder-decoder with an explicit list-consistency objective: after insertion or deletion corruption, require the correct prediction to remain among the top $L$ hypotheses compatible with the clean latent sequence. Instead of optimizing only one alignment, retain multiple low-cost monotone alignments or candidate latent decodings and penalize the model when the clean target falls outside this list.
Useful5/10
Difficulty6/10
Novelty5/10