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
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 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
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
Unverified
2026
Add a boundary-aware nonlocal regularizer to hidden-state sequences by subtracting the sharp Hardy weight from the fractional discrete-Laplacian energy. The resulting penalty is provably nonnegative on finite sequences under zero-padding at the left boundary, while its position-dependent Gamma-ratio weight concentrates protection near the sequence boundary.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent intermediate feature maps on a periodic rectangular grid and regularize each individual Fourier eigenspace so that its spatial energy cannot collapse almost entirely outside a chosen observation region. The target lower bound is derived from the paper's quantitative rectangular estimate and is applied only to narrow Fourier shells, where the feature map is analogous to a degenerate Laplacian eigenfunction.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace explicitly stored independent random positional features with deterministic multiplicative phase features generated from a small table of random phases indexed by primes. Restrict positions to integers whose prime factors exceed a slowly growing threshold, because the paper's central-limit result says periodic weighted sums over these rough integers recover Gaussian behavior despite strong multiplicative dependence.
Useful4/10
Difficulty5/10
Novelty9/10
Unverified
2026
Add a structured boundary-like operation to an MoE router that rapidly mixes expert probabilities toward a learned distribution while preserving predefined expert groups. The operation is a rank-one stochastic kernel, so it costs linear rather than quadratic work in the number of experts and can act as a controlled reset when routing becomes concentrated.
Useful4/10
Difficulty3/10
Novelty6/10