Unverified
2026
Replace an unconstrained attention or MoE routing matrix with a row-stochastic matrix that preserves a learned Gibbs-like distribution over groups. Anneal its temperature so that the router converges to a block-upper-triangular operator: mixing remains flexible within equal-energy groups, while cross-group traffic becomes directional rather than oscillating or collapsing. This creates a hierarchy-aware inductive bias and can reduce the number of active expert or attention connections.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace dense token attention with K asynchronous local nonlinear consensus updates on a sparse token graph. Each selected token is moved to the unique incident p-mean of its neighbors, producing a tunable message-passing operator that is averaging for p=2 and nonlinear for other p.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace dense long-range token interactions with sparse message passing on a balanced hierarchical tree. Boundary token features are extended to internal tree nodes by weighted harmonic relaxation, and the resulting weighted normal derivative is used as a learned multiscale interaction or regularization signal.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace heuristic softmax load balancing with a convex entropic projection that computes expert assignment fractions satisfying explicit linear capacity and load constraints. The projection is bounded componentwise and keeps poorly identified routing decisions away from extreme 0/1 allocations, reducing expert collapse and overload under noisy or shifted batches.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a sparse directed attention mask over ordered tokens by treating token pairs as edges labeled by time or position. Apply a recursive three-hop spanner construction so that every dense temporal route has a sparse route using at most three times as many hops. Run attention only on the selected edges and use three sparse message-passing layers, or a small learned hop-composition block, to approximate dense causal attention.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Insert a projection-space mixer that combines several fixed or learned directions using reciprocal correlations with the current feature, then normalize the result. The exact construction has a universal beta law for its squared input-output cosine, so it can create controlled angular diversity while remaining deterministic and independent of the chosen direction dictionary.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace unconstrained token-to-expert routing with a nonnegative mixture of a small set of feasible routing or communication patterns. Enforce resource limits using the paper's one-sided positive-contribution bound, which gives a conservative certificate without enumerating all joint token activation scenarios. Expand the pattern set only when a separation procedure finds a routing pattern that improves the router objective while adding useful capacity information.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the dense output of selected linear projections with a two-sided magnitude threshold that emits zero for small values but preserves signed large values. Learn one positive threshold per projection, or optionally one threshold per output channel, so the network discovers where sparse events can be removed while retaining outlier information.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use cumulative control measures as the input to a neural surrogate instead of the full sequence of control values. For a quasi-static free-boundary system satisfying the paper's average-pressure path-independence assumption, two nonnegative control histories with identical integrals up to time t should produce the same state at t, allowing a smaller training input and fewer distinct control trajectories in the dataset.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace the linear phase progression in a positional encoding or rotary attention mechanism with a deterministic quadratic phase. The resulting position signal is generated by an irrational rotation with linearly changing increments, and the paper proves that its infinite diffraction measure is purely absolutely continuous, suggesting disorder-like spectral coverage without random sampling.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Partition neural modules into two empirically identified reliability or noise classes and restrict their communication graph to a two-block stochastic block model. Allocate a fixed connectivity budget across within-class and cross-class edges using a water-filling update that favors block pairs producing the largest increase in validation utility. The resulting layer is sparse and modular, with a testable prediction that optimal connectivity concentrates on a few block pairs rather than…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a residual neural network or graph message-passing layer whose skip edges are sampled with probability proportional to their distance as $|i-j|^{-(1+\sigma)}$, while retaining a small local backbone. The paper's mechanism predicts that coarse-grained propagation is governed by the long-range kinetic operator and is therefore asymptotically insensitive to the particular Bernoulli graph realization, yielding controllable superdiffusive information transport without dense all-to-all…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Model dynamic routing as a multitype branching process: an active token of type d probabilistically creates child activations of type d'. Estimate the corresponding mean offspring operator and regulate its Perron root to a target reproduction rate, typically near one. This should make adaptive-depth or recursively routed networks use sparse computation without producing either rapidly vanishing paths or uncontrolled activation explosions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace unrestricted global attention or purely local convolution by a sparse distance-dependent interaction graph on a two-dimensional feature map. The edge probability or attention prior decays as \(r^{-(2+\sigma)}\), and \(\sigma\) becomes an explicit architectural control knob: small \(\sigma\) supplies mean-field-like global mixing, intermediate \(\sigma\) supplies long-range Wilson–Fisher behavior, and \(\sigma>2\) approaches a short-range model. The architecture should be evaluated not…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained Fourier-domain linear mixer with a bank of positive spectral kernels and a max-times erosion aggregator. For a nonnegative Fourier magnitude f, each kernel produces a quotient response f/psi_k and the layer takes the pointwise supremum over kernels, giving exact positive homogeneity and monotonicity. This is most suitable as a drop-in spectral mixing block in a CNN, vision transformer, or state-space model.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Convert a neural operator block into a shared-weight iterative fixed-point refinement scheme that exploits repeated smoothing while avoiding repeated low-resolution projections. Compute all refinement steps at an overresolved latent bandwidth and apply the target-bandwidth projection only at the end, reducing the opportunity for unresolved frequencies to alias into retained channels.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an MoE router's single softmax distribution with a normalized coordinate-wise product of several simplex-valued routing factors. The product preserves positivity and normalization but, as depth grows, concentrates mass on a small subset of experts, creating a mathematically controlled heavy-tailed routing prior rather than relying only on an auxiliary load-balancing loss.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace repeated substrings in long sequences with nonterminal symbols from an acyclic straight-line grammar, then run the transformer on the compressed sequence. Unlike ordinary fixed tokenization, the compression objective explicitly minimizes the number of reusable binary productions, allowing repeated document-specific or corpus-level motifs to become single units. An expansion map lets the model recover token-level outputs for selected positions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a sparse fixed orthogonal mixer by repeatedly applying pi/4 rotations to randomly matched pairs of feature coordinates. Place this mixer before top-k feature pruning, sparse projection, or activation quantization so that information is spread across coordinates without using a dense random matrix.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Attach each token or graph node a learned scalar charge q_i and add a fractional stable kernel K_ij = exp(-tau D |q_i-q_j|^alpha) to the interaction mechanism. Constrain 0 < alpha <= 2, the exact range in which the kernel is positive semidefinite for arbitrary finite real charge sets, and optionally make tau layer-dependent to obtain multiscale interactions. This provides a principled alternative to unconstrained learned distance biases and can be used either as an attention-logit bias or as a…
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace dense token-to-token attention in a controlled ablation with a cyclic order-a recurrence whose coefficients are periodic across positions. The resulting mixer has linear cost in sequence length for fixed recurrence order and can enforce a fixed signed periodic boundary condition, providing a compact structured alternative to local attention or a lightweight state-space model.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Parameterize a sequence attention graph by a finite graph motif on positions [r], then lift that motif to arbitrary sequence lengths using strictly increasing embeddings. Instead of learning an independent positional mask for every context length, the model learns a small collection of order-preserving edge types whose induced graph is valid at every length and can be extended without retraining.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace overflow dropping in a mixture-of-experts layer with a discrete-convex load repair procedure. The router first chooses experts from neural logits, then applies capacity-aware exchange moves that preserve the total number of dispatched tokens and monotonically improve the routing objective whenever a feasible swap exists.
Useful6/10
Difficulty6/10
Novelty7/10