Unverified
2026
Construct a sparse attention or message-passing mask by sampling edges with preferential weights (d_u+alpha)(d_v+alpha), while keeping the edge count below the predicted connectivity threshold. This creates hub-like local communication patterns but prevents one giant component from forcing dense information mixing, reducing attention cost and potentially mitigating oversmoothing.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a differentiable penalty to a graph generator or graph predictor when its soft higher-order clique density violates the sharp lower bound implied by its lower-order clique density. The regularizer encourages generated graphs to have mathematically consistent motif statistics without hard-discretizing the predicted adjacency matrix.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent entities, tokens, or graph nodes by learnable rays subject to orthogonality constraints on prescribed hypergraph contexts. In addition to enforcing orthogonality within each context, penalize distinct vertices that become collinear, because contextual orthogonality alone can permit or force geometric collapse. This creates a structured embedding layer for graph neural networks or context-aware attention.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual uniform expert-load target in sparse MoE training with a random, heavy-tailed capacity allocation generated by a conditioned Poisson point process. The constant profile reproduces a Poisson–Dirichlet-like allocation, while a profile such as \(\phi_\gamma(x)=1+e^{-\beta\gamma x}\) deliberately changes the frequency of large versus small expert allocations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Generate temporal attention or convolution weights with the Graham–Knuth–Patashnik recurrence instead of learning every lag weight independently. For nonnegative recurrence parameters, the resulting lag sequence is strongly log-concave, so its normalized kernel is naturally unimodal and suppresses high-frequency sign-free oscillations without requiring a separate smoothness penalty. The six parameters can be learned per head, channel group, or layer, giving O(1) learned parameters for an…
Useful5/10
Difficulty3/10
Novelty6/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 finite-state message-passing layer that tracks local configurations corresponding to perfect edge domination or dominating induced matchings instead of transmitting unconstrained node embeddings alone. On graphs with a tree, series-parallel, or small-separator decomposition, the layer produces an exact or differentiable partition function over globally valid edge configurations, which can be used as node features, an auxiliary loss, or a structural prior.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Estimate the simplex-based ratio of a target or learned convex piecewise-linear polytope and use the theorem \(\rho_\Delta(P)\le 2^d-1\) to choose a minimum useful ReLU depth. During training, monitor whether the learned polytope is approaching a high-\(\rho\) target; if it is, widen the model without increasing depth only when the diagnostic indicates that depth is the bottleneck.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Build a sparse neural mixing layer from colored directed strands rather than a dense all-to-all matrix. Feature channels are assigned ordered colors, local trivalent junctions conserve every color, and an edge width is the weighted sum of the colors carried by that edge; a differentiable penalty favors monotone, crossing-free routings that define a canonical leading term. This creates a structured routing prior that can be compared directly against dense attention and unconstrained sparse…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained pairwise attention score with an intersection of coordinate-wise threshold or interval compatibility heads. Each head is a supergraph that permits pairs satisfying one constraint, while the final attention edge exists only when every head permits the pair. This provides an interpretable inductive bias for multi-constraint relations and prevents the model from approximating a conjunction using a single unstable nonlinear score.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent a sparse higher-order attention head by a 3-uniform hypergraph whose hyperedge $(v,x,y)$ allows anchor token $v$ to aggregate a pairwise interaction between tokens $x$ and $y$. During mask construction, greedily reject edges that would create a $4$-cycle in the link graph $L(v)$, so the same pair of source tokens cannot reach an anchor through multiple redundant pairings. This produces a diversity-constrained sparse attention pattern with an explicit, measurable collision bound.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a generic MoE router entropy bonus with a branching-pressure objective that values routes according to both their stochastic entropy and their number of valid fine-grained continuations. The module can be implemented as a hierarchical router: a coarse state chooses a base transition, while a validity mask determines how many valid expert or latent branches lift that transition.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independently sampled random-walk paths used for GNN neighbor or subgraph sampling by persistent rotor walks on the training graph. Each node stores a pointer into a fixed cyclic ordering of its outgoing neighbors; every visit advances the pointer and selects the next neighbor, producing deterministic coverage with no repeated random choices. Use several short rotor trajectories per seed and periodically reinitialize only the rotors in an encountered subgraph.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use the hysteresis threshold as a regularizer for attractor diversity. Estimate how many initial states converge to each fixed point and select thresholds that maximize basin entropy or penalize domination by one attractor, reducing attractor collapse in discrete recurrent classifiers and memory modules.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a fixed or lightly gated lower-triangular binomial-transform layer into a sequence model to create global interactions across positions without forming attention logits. For a sequence of length N, mix each output position with all earlier positions using coefficients determined by an integer m; initialize the layer fixed and optionally learn a diagonal channel gate or a small mixture over m values.
Useful4/10
Difficulty5/10
Novelty8/10
Unverified
2026
Tie neural parameters across feature channels according to the Schur multiplicity pattern of the fermionic coinvariant representation. In the two-fermion case, use one learned parameter block for each Schur degree instead of independently parameterizing every ordered pair of fermionic channels, eliminating redundant copies while preserving the relevant GL2 channel symmetry.
Useful4/10
Difficulty5/10
Novelty7/10
Unverified
2026
For a neural scalar field defined on the vertices of a mesh or graph, generate several random level interfaces by adding continuous perturbations and thresholding the field. Penalize the deviation between the empirical mean Euler characteristic of these interfaces and the value predicted from the host complex's f-vector, encouraging decision boundaries with stable global topology.
Useful4/10
Difficulty6/10
Novelty7/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
Unverified
2026
Convert an attention or MoE routing affinity matrix into a soft graph and constrain its K_r-density relative to its observed K_s-density. The regularizer penalizes pathological affinity patterns in which moderate s-way coactivation is accompanied by an implausibly low or unstable r-way coactivation.
Useful4/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a monomial polynomial feature block by a fixed Narayana basis transformation. If the input polynomial has nonnegative coefficients and only real roots, the transformed polynomial is guaranteed to have only real roots as well, giving a certified stability-preserving coordinate change for polynomial neural networks.
Useful4/10
Difficulty5/10
Novelty9/10
Unverified
2026
Represent the active experts or channels of a sparse layer by a presence set and impose a reaction-style dependency graph on possible support changes. During a growth phase, activate only the least support set closed under enabled dependencies; during later pruning, allow trajectory-dependent removals but never add structurally unreachable experts. This should reduce routing churn and dead experts while preserving adaptive sparsity.
Useful4/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a fixed polynomial mixer before an MLP or retrieval index for tuples of discrete features. The mixer maps n+2 bounded scalar feature codes to one or several expanded scalar codes, and the paper's theorem guarantees that its image cannot collapse below order |A|^n when all coordinates come from a finite alphabet A. Use multiple independent permutations or coefficient choices to obtain a vector representation while retaining the deterministic algebraic structure.
Useful4/10
Difficulty4/10
Novelty7/10