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
Restrict a fine-tuning adapter or output head to the subspace invariant under a prescribed monodromy, analogous to the paper's unbroken flavor lattice. This removes update directions intentionally changed by the domain-loop transformation, producing a parameter-efficient adapter with an explicit algebraic constraint.
Useful5/10
Difficulty4/10
Novelty8/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 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
For a neural module that forms causal or statistical ratios from minibatch covariances, replace raw denominator penalties and raw-scale uncertainty weights with a log-denominator or relative-error objective. The front-door covariance minor has variance proportional to its squared magnitude, so a small denominator is not intrinsically evidence of poor estimation under the Gaussian model. This should prevent the network from spuriously avoiding valid representations merely because their…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Regularize learned skew generators so that their iterated Lie brackets span many independent feature-mixing directions rather than collapsing to commuting or redundant matrices. This turns the paper's controllability family into a differentiable diversity objective for structured neural layers.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Give graph-neural-network clusters an explicit notion of boundary condition. Penalize assignments that create clusters with weak internal spectral structure or excessive interaction through their boundary, while retaining boundary edges when the task benefits from cross-cluster communication. This creates a tunable spectral isolation-versus-information-preservation tradeoff unavailable in ordinary feature-similarity clustering.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a deterministic feature layer that evaluates symmetric Schur-type features on a fixed cyclic orbit and learned reciprocal latent pairs, then projects the resulting channels onto selected residue classes with an exact roots-of-unity filter. The reciprocal construction makes the layer invariant under replacing each latent scalar by its inverse, while the torsion projector prevents leakage between cyclic frequency sectors.
Useful5/10
Difficulty6/10
Novelty6/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 the ordinary triangle-inequality budget for merging m linear residual branches or LoRA updates by the sharp quasi-reverse Minkowski certificate. During training, penalize or constrain the Schatten norm of the aggregate absolute update, which certifies the norm of the actually merged update with factor C_{p,m} rather than the loose factor m. This is especially attractive for p=2, where the certificate controls Frobenius energy and can be implemented with standard matrix operations.
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
Use the lifted convex hull as a training-time regularizer for pairs of nonnegative neural features, encouraging their empirical second- and third-order interaction statistics to lie in the paper's moment cone. This constrains correlations, squares, and cubic cross-moments jointly through PSD inequalities instead of merely penalizing large activations.
Useful5/10
Difficulty4/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 the symmetric Euclidean contrastive loss between embeddings with a two-point quadratic contrast whose displacement is generated by a local affine connection and measured using the metric at the source endpoint. Because the metric and transport need not be compatible, the loss can be asymmetric, allowing the model to represent directional relations between examples.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace raw updates of strongly coupled parameter blocks by updates in rescaled, approximately normal-form coordinates. The optimizer estimates the local coupling matrix between block directions, solves a small modulation system for transformed velocities, and optionally subtracts predictable first-order cross-block drift.
Useful5/10
Difficulty5/10
Novelty4/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
Apply the paper's augmented cusp-map construction to an implicit neural layer or recurrent equilibrium, treating selected weights, gains, or input statistics as bifurcation parameters. The scanner detects parameter values where an equilibrium loses uniqueness through a fold or cusp, allowing the model to avoid unstable regions or deliberately exploit controlled multistability. Unlike merely monitoring exploding gradients, it provides a local certificate based on residual size, inverse-Jacobian…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Apply a trainable scalar gate entrywise to a Min/Max structured affinity or covariance matrix while enforcing that the gate is nonnegative, nondecreasing, and convex. This preserves Loewner ordering on the structured cone and avoids unconstrained elementwise nonlinearities that can destroy PSD or order relations.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use multiplier bootstrap on minibatch activation covariances to determine whether a large top eigenvalue is a genuine representation direction or merely a high-dimensional bulk fluctuation. When a spike is repeatedly significant, apply a low-rank whitening or shrinkage correction to that activation subspace; otherwise leave the layer unchanged, avoiding destructive whitening of ordinary bulk variation.
Useful5/10
Difficulty5/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
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
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