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
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 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
Build a fixed multiscale router that maps 2D coordinates to 3D voxel coordinates using the paper's X-shaped self-similar refinement. Use the router to run a 3D feature field or volumetric token mixer over a 2D-organized tensor, while retaining a mathematically controlled locality bound instead of an arbitrary flattening permutation. The first target is a 3D neural field or small voxel classifier where the router replaces either a dense 3D feature table or a naive raster-order token layout.
Useful5/10
Difficulty6/10
Novelty6/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
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
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
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
Replace pointwise pair interactions between mesh cells by quadrature of the interaction kernel over the full Cartesian product of the two cells. Decompose each cell pair into convex-hull pieces and apply a Duffy-like radial transformation so the coincidence singularity is confined to one quadrature coordinate, allowing fixed Gauss-Jacobi or adaptive quadrature to produce smooth, low-variance interaction features.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace a complex latent vector x in C^d by squared magnitudes of m learned complex linear projections. Set m equal to 2d: the paper proves that m less than or equal to 2d minus 1 cannot generically preserve the latent up to global phase, whereas m equal to 2d is generically sufficient, giving a principled minimal width for a phase-invariant neural bottleneck.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
For a neural model whose outputs lie on a d-dimensional analytic family in a very high-dimensional space, replace the full output vector by 2d+1 or a modestly oversampled number of fixed Gaussian scalar measurements. The paper's theorem predicts almost-sure injectivity in the noiseless setting, so an inverse network or decoder can recover the same latent instance without processing the full observation. Because the theorem does not provide a noise-stability constant, use M=4d+8 or M=8d in the…
Useful5/10
Difficulty4/10
Novelty5/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
Represent a continuous-time neural dynamical system as a symbolic Markov chain over regions together with a positive learned roof function giving the time spent in each region. Weight local reconstruction and prediction errors by the predicted vector-field speed, following the paper's scaled Hölder coding relation, so that the model does not over-penalize arbitrarily small coordinate errors near equilibria. This produces a hybrid latent model with discrete long-range structure and continuous…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a fixed or partially learnable equivariant change-of-basis module into a spherical or SO(3)-equivariant network. At each angular frequency \(\ell\), the module maps the line selected by the line-bundle quantization to the line selected by the Grauert-tube quantization, allowing the network to represent both holomorphic/base-local and geodesic-flow-adapted features without breaking rotation equivariance.
Useful5/10
Difficulty5/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
Replace an unconstrained geometric multiscale codebook by features generated from a finite digit set and a Pisot scale factor. The contracting algebraic-conjugate directions should suppress near-collisions between representations at different scales, producing a discretely separated hierarchy that can be used for embeddings, recurrent memory, or quantized transformer states.
Useful5/10
Difficulty6/10
Novelty9/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
Replace independent token scores with a query-conditioned positive-semidefinite low-rank quadratic score over a fixed-size selected subset. Repeatedly convert the quadratic objective into a linear exposure vector and apply a cheap top-k oracle, allowing the selector to model joint token interactions without constructing an n-by-n attention matrix. The margin between the current low-dimensional shadow and alternatives provides a practical confidence or early-stopping signal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/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
Replace a dense channel-mixing matrix in a sequence layer with alternating diagonal propagation and sparse unipotent Stokes jumps. The diagonal part carries independently controlled exponential phases, while the unipotent factors implement cheap residual-like mode conversion without changing determinant or requiring a dense matrix multiply. Constrain the phase magnitudes and jump coefficients during training to obtain a reversible, norm-monitorable mixer.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a softmax transition or mixture-of-experts router by probabilities obtained from squared amplitudes of an isometric latent transition. Each input state is mapped to an orthogonal latent subspace, and summing probability over the latent index produces the desired expert or next-state distribution. The latent amplitudes can retain information that would be destroyed by directly averaging expert outputs, while normalization is guaranteed by construction.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Build a parameter-free spectral channel mixer whose channels are arranged as components of an l-form and whose multiplier is the trace-free Beurling--Ahlfors transform. At every nonzero spatial frequency it mixes the exact and coexact channel subspaces with opposite signs, preventing a uniform channel-direction bias and preserving a structured cancellation property. Insert it as a residual branch before a convolution, MLP, or attention block, with one learned scalar gate controlling its…
Useful5/10
Difficulty6/10
Novelty8/10