Unverified
2026
Replace dense spatial pooling or integral evaluation over a planar domain by a sparse cubature layer whose nodes are poles of a rational approximation fitted only on the domain boundary. For analytic or nearly analytic neural-field channels, the same learned field can then be integrated using substantially fewer evaluations than a uniform grid, while the boundary approximation residual supplies a cheap reliability signal.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct a neural mixing layer on Fourier or positional modes using a small set of exponentiated Virasoro generators instead of a dense mode-to-mode matrix. The generator coefficients are shared across all inputs, while the Lie bracket fixes how different mode shifts interact; an optional central channel captures the special coupling between modes whose indices sum to zero.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's structure-inheriting crossover to construct discrete token-to-expert assignments from two parent routers instead of randomly reinitializing routing assignments. Build a sparse token-similarity graph and optimize an objective combining within-expert similarity, cross-expert separation, and expert-load balance; use the resulting assignment to initialize router logits or to periodically repair overloaded experts. The method is especially suitable for small calibration batches or…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an ordinary graph diffusion or message-passing operator with a positive-semidefinite Laplacian whose kernel contains a prescribed node-wise subspace. The layer smooths only feature components orthogonal to that subspace, preserving global constants, positional modes, or other structural signals even when graph edges are dynamically added or removed.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the calibrated compact-support maximum-entropy law as a latent prior or representation regularizer in a VAE or autoencoder. Unlike a Gaussian prior, it prevents latent codes from drifting arbitrarily far while retaining explicitly controlled mean and covariance.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a single-hidden-layer network whose hidden weights and biases are sampled from a non-continuous distribution supported on a dense subset of parameter space, then train only the output coefficients. The result motivates discrete or mixed-precision hidden parameters without requiring a continuous Gaussian initialization; finite-width experiments can test whether this retains accuracy while reducing hidden-layer storage and arithmetic cost.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a preprocessing and inference module to a permutation-labeled graph network that computes the states globally compatible with all cycle transports. The module masks node or root-state logits to this fixed-point set, replacing exponential global assignment search with graph traversal plus permutation-table operations. A soft version can use the fixed-point mass as an auxiliary compatibility regularizer during training.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace a fixed-norm Fourier feature layer by a Fourier transform followed by spatially varying modular normalization. Use a baseline exponent approaching the endpoint regime at large coordinates and permit only bounded, smooth deviations so the transform remains controlled while the network can emphasize localized details.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct positional features from a self-similar digit system whose Fourier characters are orthogonal under a prescribed nonuniform measure, rather than sampling frequencies independently. Use several admissible multiplier values to create frequency bands while preserving the underlying Hadamard structure, giving a deterministic multiscale encoding with a better-conditioned feature Gram matrix on fractal or highly clustered coordinates.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Periodically project a rectangular neural-network weight matrix onto an approximately orthonormal-column matrix using LU-preconditioned CholeskyQR rather than ordinary QR or a polar iteration. Pivoted LU handles badly scaled and nearly dependent columns, while Householder orthogonalization of the LU factor produces a triangular preconditioner that makes the subsequent Cholesky step safer in fp16 or bfloat16.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the isolated positive spectral mode created by a finite branch defect on an otherwise long cycle as a graph positional feature. The feature should concentrate around structurally unusual vertices while remaining insensitive to the total cycle length, providing a principled alternative to raw Laplacian eigenvectors for cycle-with-branch graphs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a dense or irregular binary interaction matrix in a value-aggregation layer with a signed sum of blocky masks. Each blocky mask groups a set of query rows with a disjoint set of key columns, allowing all queries in a group to reuse one summed value vector. This is most suitable for linear attention, graph message passing, or any layer where the interaction matrix is applied directly to values rather than passed through a row-wise softmax.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Represent each sequence chunk by a distribution over local descent-set patterns, then compose two chunks using the shuffle-algebra product rather than concatenating their embeddings alone. The module explicitly models how local order statistics change under interleaving, providing an inductive bias for event streams, code tokens, time-series segments, or mixtures of independently generated sequences.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a locally oriented three-channel feature frame by its positive-definite polar factor, removing arbitrary SO(3) basis rotations before the feature enters an MLP, attention block, or graph message-passing layer. Process the resulting SPD matrix in log coordinates so the downstream network receives a globally unconstrained symmetric representation rather than a gauge-dependent frame.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Learn or select sparse cyclic convolution or relative-attention offsets whose pairwise differences collide less often modulo the sequence length. The paper's Fourier fourth-power identity turns this combinatorial objective into an FFT-computable differentiable loss, enabling fixed-K sparse patterns with lower aliasing and interference than random offsets.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a structural positional channel formed from the Krylov sequence generated by the graph adjacency matrix and the all-ones vector. For graphs with k main eigenvalues, this sequence has rank k, so a GNN can retain all information obtainable from global walk counts using only k node features rather than storing many adjacency powers.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace an unconstrained linear map on matrix-valued features by an exact operator-norm isometry assembled from parallel copies of X and its transpose. Contractive compression matrices and unitary basis changes allow a wider family than ordinary orthogonal layers, while a contractive remainder can increase output width without increasing the layer's spectral norm.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a graph diffusion or neural-operator encoder whose sparse-observation loss is weighted according to graph distance from the observed nodes. For early diffusion times, suppress supervision or cross-attention demands that are geometrically impossible because signals at distance \(d\) are attenuated like \(e^{-d^2/(2t)}\); gradually release those constraints as diffusion time grows.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained bilinear matrix fusion or covariance head with \(\Phi(A,B)=\sum_{r=1}^R V_r^*(A\otimes B)V_r\). The output is PSD by construction, and the stronger block-level property makes the layer compatible with minibatches, mixtures, and Gram-matrix inputs rather than merely preserving positivity pointwise.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a fixed top-k expert count with a stochastic, token-specific fanout generated by a supercritical binary branching process stopped at a geometric time. The resulting number of active experts has finite mean but a power-law tail with log-periodic modulation, allowing most tokens to use little compute while reserving larger computation for difficult or ambiguous tokens.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct a shared latent transformation as a neural monad-like operator Γ=Ω∘Σ, and expose its iterates Γ^{q+1}Y as a refinement trajectory rather than stacking unrelated layers. Aggregate the resulting representations with a learned or fixed realization weighting, while training an algebra-action map θ:ΓY→Y to make one-step refinement compatible with the original representation. This creates a shallow-parameter, arbitrarily deep computation path with explicit compositional…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace homogeneous feature propagation with a discretized wave equation containing a positive, spatially varying learnable potential. The potential changes Hamiltonian trajectories so that feature energy reaches the layer's readout or sensor region instead of remaining in dynamically hidden modes. Train the potential jointly with the task objective and an empirical observability penalty.
Useful5/10
Difficulty6/10
Novelty8/10
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
Use the paper's finite-habitat approximation as a warning and design principle: averaging token- or state-dependent routing environments can reduce the persistence of specialized subnetworks. Partition inputs into environments, estimate environment-specific interaction kernels, and retain the heterogeneity that produces positive invasion margins instead of replacing it with one global average.
Useful5/10
Difficulty5/10
Novelty6/10