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
Replace or augment a scalar periodic positional coordinate with a normalized bank of odd Fourier harmonics, keeping every position on the same-radius sphere. The resulting representation has an explicit translation-invariant similarity kernel, allowing the frequency count and spectral weighting to control how sharply attention distinguishes nearby versus distant phases.
Useful5/10
Difficulty3/10
Novelty3/10
Unverified
2026
Insert a fixed reversible lattice shear into a residual network so successive blocks follow a structured monodromy orbit rather than using unrelated learned transformations. Apply the transformation to a small learned subspace of hidden channels while leaving the remaining channels unchanged. This creates deterministic phase-dependent feature mixing with no additional trainable parameters.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Interpret successive neural representations as an RG flow and constrain coarse-graining layers to remove unstable or redundant information monotonically. The paper reports monotonic decrease of an effective central charge along measurement-induced RG flows; a neural analogue can use a measurable information-complexity proxy and reject compression steps that increase it while preserving task-relevant information.
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
Replace dense attention on tree-structured inputs with stochastic attention neighborhoods formed by metric balls of sampled radii. Use the paper's exact trimming rule to ensure that every sampled cover remains valid while its total radius budget is bounded, then average predictions over several independent covers during training. This creates sparse, globally covering attention masks with an explicit locality-versus-coverage control.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace or augment the first embedding layer for antipodally identified inputs with the normalized traceless quadratic map from the Veronese construction. Because q and -q produce exactly the same feature, the layer enforces projective invariance by construction rather than learning it from augmented examples. The resulting matrix-valued features can be flattened, projected, or processed by an equivariant linear layer.
Useful5/10
Difficulty2/10
Novelty6/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 a classifier whose normalized class vectors form an explicit 2d-line equiangular tight frame instead of using independently initialized weights. The ETF gives every class the same norm, equal pairwise coherence, and an isotropic frame operator, which should make final-layer gradients better conditioned and reduce accidental class crowding. The classifier can be fixed, or restricted to a learned unitary rotation of the ETF so that its geometry is preserved during training.
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Use the finite-order characterization to learn a nonlinear similarity function for token, patch, or graph-node Gram matrices while preserving PSD by construction or by a differentiable certificate loss. This creates a kernelized attention or graph-readout mechanism in which nonlinear affinity transformations cannot introduce indefinite similarity geometry.
Useful5/10
Difficulty6/10
Novelty6/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
Group neural features into small Hermitian matrix elements and scale each group with the paper's tracial spectral Lp norm rather than independently normalizing scalar channels. This introduces a coupled spectral geometry while remaining implementable with ordinary eigendecompositions in the associative Hermitian-matrix special case.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a structured token-mixing layer based on commuting sums of swap operators rather than unconstrained pairwise attention. The layer learns a low-degree spectral filter in the Jucys–Murphy operators, allowing it to represent hierarchical interactions while retaining an explicit algebraic inductive bias.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent a directed interaction graph by a Laurent-polynomial Euler-like matrix and use its evaluation as a signed message-passing or attention-mixing operator. During dynamic rewiring, require the new graph representation to preserve the associated bilinear form up to the congruence transformation induced by the change of basis, so equivalent routings produce equivalent hidden states.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Encode each scalar or discrete code t by the strictly convex lift γ(t)=(t,t²), optionally followed by a learned linear projection and normalization. Because three-code sums on this curve have only near-minimal additive energy, the representation should produce fewer collisions when a model composes three tokens, codes, or retrieved items by addition.
Useful5/10
Difficulty3/10
Novelty7/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
Parameterize a learned 3-state transition operator as a product of at most seven elementary row-stochastic matrices rather than learning its nine entries independently. Each factor performs one convex pull-in of row i toward row j, so every intermediate and final matrix remains row-stochastic and the layer has a sparse, bounded-depth interpretation.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Assign each of K entity or token types an integer code from a B_{2,\Delta}-set A, so every unordered pair {i,j} produces a unique and margin-separated scalar code a_i+a_j. Use this code as a compact symmetric pair feature for graph edges, attention biases, or pairwise relation MLPs, avoiding collisions that occur when ordinary low-dimensional additive encodings are quantized or hashed.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Augment every graph node with weighted participation in simple cycles of lengths 3 through K, computed using the paper's squarefree trace construction. Feed these features into a graph transformer or message-passing network so nodes with identical local degrees and ordinary spectral statistics can still be distinguished by their exact loop environment.
Useful5/10
Difficulty5/10
Novelty7/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