Unverified
2026
Replace one local spatial aggregation in a CNN or vision transformer with a discretized Riesz potential whose kernel is proportional to $\|x-y\|^{-(n-s)}$. Normalize the layer using the paper's sharp weak-type constant and penalize empirical violations of the resulting tail bound, encouraging nonlocal context without allowing a small set of pixels or tokens to generate arbitrarily large responses.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace raw polynomial features in a scalar MLP expansion with endpoint-weighted orthonormal Jacobi features. The paper's envelope gives a degree- and parameter-aware scale for each feature, preventing high-degree terms or endpoint behavior from dominating gradients while preserving a richer approximation basis than low-degree monomials.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a task-aware error-protection code to a binary or low-cardinality latent representation. The encoder remains systematic, preserving the original latent coordinates, but appends repeated or parity coordinates computed from a linear task map so that latent states with different task values are separated by at least a chosen Hamming distance. Redundancy is allocated according to the rank of the task map rather than the full latent dimension.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary simplicial incidence matrices in a graph or mesh neural network by integer-ratio weighted incidences derived from a divisibility hierarchy on simplex weights. The resulting up/down message-passing operators preserve exact chain cancellation, so features propagated around a filled simplex cannot create spurious boundary signals. Train the weights either from known metadata or as positive integer powers of a small prime, while retaining an ordinary-incidence baseline for ablation.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct positional or relative-position features as a nonnegative mixture of lattice cosine functions instead of independently signed sinusoidal features. The resulting bias is the Fourier transform of a positive discrete measure with explicitly bounded spectral support, while the mesh and degree can be initialized in the paper's dense-but-controlled frequency regime.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Parameterize a learned token metric as a nonnegative sum of sparse integral rank-one projections with unimodular support, rather than learning an unconstrained dense positive-semidefinite matrix. Graph-incidence covectors give an immediately implementable support family, while nonnegative coefficients guarantee positive semidefiniteness by construction.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use reverse plane partitions of a minuscule heap as the discrete codebook for a VQ-VAE or discrete sequence model. Codes are not arbitrary indices: each code is an order-preserving array, and crystal raising/lowering operators define a sparse, semantically structured neighborhood graph for augmentation, routing, and metric regularization.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Insert an overcomplete sparse feature bottleneck into an MLP or embedding stream: encode an activation h with z = ReLU(W^T h + b), then reconstruct or continue computation from Wz. Normalize dictionary columns and train them to remain nearly tight and low-coherence, while choosing a negative bias from an estimate of worst-case cross-feature interference. The hypothesis is that this gives cleaner, more stable feature supports than an ordinary L1 sparse autoencoder at the same latent width.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Construct a Fourier layer whose active frequencies lie on several nonparallel polygonal patches or thin annular sectors, and cap repeated difference vectors generated by pairs of patches. The bounded-multiplicity geometry limits how many input frequency pairs can contribute to the same output frequency, potentially reducing spectral aliasing and gradient variance in nonlinear Fourier mixing.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained three-token interaction block by three distinct pair maps constructed from anticommuting channel generators. For every token triple, enforce equality of the two composition paths A12 B13 C23 and C23 B13 A12, while retaining different parameters for the three edges. This creates a globally consistent three-way interaction without collapsing to a single shared pair operator.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Construct a learnable spectral pooling block as an erosion followed by its adjoint dilation, making the resulting opening idempotent, increasing, and anti-extensive. The block can suppress frequencies outside a learned passband while guaranteeing that applying it twice does not continue changing the representation, which is useful in multi-stage CNN pyramids and U-Net skip paths.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a deterministic mixture-of-experts residual block with K population-indexed stochastic expert states coupled through a graphon matrix. The layer uses a shared drift and expert-dependent diffusion, while an empirical convex-order penalty makes later representations more dispersed than a reference representation without permitting a mean shift.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace unconstrained transformation composition in a geometric or sequence encoder with time-dependent Lie-algebra controls whose flows compose according to the paper's flow-product rule. Add a holonomy consistency loss so different control trajectories that induce the same endpoint automorphism produce the same latent transformation, reducing sensitivity to arbitrary path parameterization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a positivity-preserving fractional Schrödinger resolvent into a 1D neural sequence block. Given a nonnegative learned potential V, the layer transforms an input signal f using V^a(-Delta+V)^(-a)f, allowing the network to learn where to smooth or suppress features while retaining an L1 bound independent of the potential magnitude. Use a in (0,1] as a fixed hyperparameter or a clipped learned scalar.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct multiplicative neural gates directly on encoded tensors so that operands are multiplied coordinatewise without decoding between every operation. Polynomial evaluation makes this operation algebraically consistent with multiplication, allowing redundant gated MLPs or bilinear layers to retain fault tolerance while reducing the frequency of expensive correction steps.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an ordinary elementwise interaction between two feature matrices by a noncommutative functional-calculus layer \(\varphi(A,B)\), where \(A\) and \(B\) are Hermitian channel operators that need not commute. Add a soft penalty on \([A,B]=AB-BA\), and use a Besov-smooth parameterization of \(\varphi\) so that perturbations are controlled in Schatten \(p\)-norm for \(p\leq2\). This creates a principled matrix interaction module that can remain stable when feature operators or graph…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace independent top-k expert decisions by a global fractional routing problem that enforces token-side and expert-side capacities together with an additional diversity constraint represented by a partition or laminar matroid. Use the resulting Hall-type deficiency certificate to identify overloaded token subsets and penalize the actual structural cause of routing failure rather than relying only on an aggregate load-balancing loss.
Useful5/10
Difficulty6/10
Novelty4/10
Unverified
2026
Replace a polynomial layer's single-replica output statistics with a finite fingerprint computed from several correlated Gaussian replicas. Train the fingerprint to be invariant under orthogonal reparameterizations while remaining discriminative between genuinely different polynomial maps, preventing models from collapsing distinct tensor functions that have identical marginal output laws. This is a practical symmetry-aware regularizer or auxiliary embedding for tensorized MLPs and polynomial…
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Construct a spatially varying diffusion layer whose coefficient matrix is explicitly uniformly elliptic and whose local mean oscillation is penalized. Use it inside an implicit residual block, so the learned operator remains a controlled perturbation of a constant-coefficient elliptic operator rather than becoming an unstable collection of unrelated local filters.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a sharp graph-Laplacian spectral filter with a Bochner–Riesz filter whose smoothness exponent increases when the graph contains regions with different effective dimensions. Estimate the largest local dimension and dimension gap from neighborhood growth, then choose the exponent above both the classical spectral threshold and the asymmetric obstruction threshold. This should suppress unstable high-frequency mixing in heterogeneous graphs while preserving more low-frequency signal than…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a small number of differentiable graphical mean-curvature-flow steps between a neural network's raw vector-field prediction and its task loss. The relaxation performs geometry-aware smoothing rather than isotropic Gaussian smoothing, and it can enforce fixed boundary values after every step.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent Bernoulli branch dropout in a tree-structured mixture or hierarchical MLP with connectivity gates sampled from a q<1 wired random-cluster model. The q<1 law provides conditional negative association across branches, so increasing statistics of disjoint branches have nonpositive covariance; this should reduce redundant expert activation while preserving structured stochastic exploration.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a measurement-conditioned attention layer with two explicitly separated fields: a geometry-only inverse-temperature profile that controls interaction strength and an outcome-dependent chemical-potential bias. For a region bounded by coordinates a and b, force the interaction gate to vanish as the square root of the distance from either boundary, while allowing a separate potential channel to encode measured values.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a small number of latent region-offset variables to a graph or token-mixing layer, interpreting selected edges as low-permeability barriers that suppress cross-region information flow. Eliminate the latent variables analytically, yielding a visible-node update with a structured low-rank correction rather than adding persistent hidden node states. The module is intended to preserve within-cluster propagation while preventing oversmoothing or contamination across learned boundaries.
Useful5/10
Difficulty6/10
Novelty6/10