Unverified
2026
For a learned phase-space layer, estimate its symplectic Fourier bandwidth R and divide its output gain by the theorem's support-dependent factor R raised to an exponent determined by the Schatten index p. This creates a resolution-aware normalization: layers with larger phase-space bandwidth are automatically damped when p is not equal to 2, while the Hilbert-Schmidt case p = 2 remains unscaled.
Useful5/10
Difficulty5/10
Novelty6/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
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
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 a barycentric rational activation or filter whose interpolation nodes are periodically zoomed into the range of preactivations or eigenvalues actually encountered by the network. Protect the layer from catastrophic poles by monitoring the associated generalized eigenproblem and penalizing poles close to the active input interval. This targets rational networks whose expressivity comes from localized poles but whose training is destabilized by denominator zeros.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent each feature as belonging to one of three \(\mathbb{Z}_3\) charge sectors and constrain every linear and multiplicative operation to obey charge addition modulo 3. Add invariant cubic gates such as \(x_1x_2x_3\) or \(x_q^3\), which can express the same phase-insensitive interaction selected by the paper's three-photon drive. This should improve data efficiency and exact cyclic-augmentation consistency when the task has a genuine ternary symmetry.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Build an implicit layer from a piecewise-linear maximal monotone operator on visible variables z_* and auxiliary variables z_**, then eliminate the auxiliary block rather than exposing it in the network output. Compute the layer through a fixed point of the eliminated component of a nonexpansive resolvent, with damping when the auxiliary map is not strictly contractive.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a generic three-input concatenation MLP with a permutation-symmetric mixer built from the four signed combinations x+y-z, x-y+z, -x+y+z, and -x-y-z. Apply a shared truncated exponential to these combinations and aggregate symmetric pairwise products, producing controlled quadratic and higher-order interactions without materializing a full trilinear tensor.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Factor a neural linear layer as W = M A, where A is randomized at initialization and M is a deterministic channel mixer or learned feature transform. Regularize M toward low inverse-Hilbert–Schmidt norm under a scale constraint, because the paper's theorem predicts that this raises the high-probability lower bound on s_min(W) and reduces near-singular initialization events.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a standard two-layer multiplicative interaction block with auxiliary positive features X whose neighboring products generate two coupled feature grids x and y. Add the Y-diamond recurrence as either a hard recurrent update or a differentiable consistency loss, forcing local interactions to obey the same compatibility structure as an SL2/Y-frieze.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's explicit tree support pattern as a cheap certificate that a sparse neural linear map contains a nearly singular submatrix. During mask construction or rewiring, penalize root-row-child configurations with many disjoint child branches, or increase overlap and row degree locally when such a configuration is detected. The goal is to prevent sparse MLP, projection, or MoE expert matrices from developing directions that are almost annihilated by the layer.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a neural layer's dense parameters by a real parameter tensor and a binary activity mask, then update the mask using importance scores measured across multiple perturbation intervals. Gates that repeatedly occur in non-dominated accuracy–cost configurations receive larger scores and are more likely to be retained or activated, avoiding uniformly random sparse rewiring.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace an unconstrained order-k weight tensor with a sum of components that are symmetric only within selected contiguous index blocks. This preserves interactions between blocks while tying parameters under within-block permutations, providing a tunable middle ground between a fully dense tensor and a fully symmetric tensor.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a fractional oscillation penalty to scalar functions produced by a neural network on an ordered grid. Unlike a derivative penalty, this remains meaningful for nonsmooth or nowhere-differentiable outputs and interpolates between total-variation-like behavior and Sobolev-like smoothness.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Insert a rearrangement operation on scalar feature maps sampled along an ordered coordinate such as time, spatial position, or a neural-field input grid. The operation sorts values into non-increasing order, preserving the empirical histogram exactly while provably not increasing the Riesz fractional variation in the ideal one-dimensional continuous setting.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Split the trainable state into an explicit scalar scale coordinate and a residual perturbation, then update them with separate time scales. Penalize residuals according to their distance from the scale-dependent core, so the optimizer cannot obtain apparent progress by destabilizing the scale mode. The method is a neural optimization analogue of the paper's modulation argument, not a direct consequence of the geometric singularity theorem.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the logarithmic exhaustion as a geometry for bounded hidden representations rather than only as a parameter constraint. A representation approaching the boundary receives an increasingly large metric, making ordinary Euclidean motion expensive and discouraging brittle saturation while preserving a bounded intrinsic gradient for the boundary coordinate.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent the prediction as a sum of a smooth interior branch and a fractional boundary branch: u_theta(x)=u_int_theta(x)+d(x)^a u_bd_theta(x). This mirrors the paper's direct-sum solution structure and allocates separate network capacity to the globally regular component and the boundary layer.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the Bernoulli corank asymptotic to choose sparsity for binary or sparse linear layers and reject initial matrices with excessive numerical rank deficiency. The layer should also explicitly prevent zero columns, because the paper's probability law indicates that zero-column events are a leading mechanism behind large corank in the sparse regime.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
For two monotone prediction heads receiving binary features, penalize cases where their covariance is smaller than the sharp degree-weighted collision of their Fourier spectra. This discourages uncontrolled agreement on high-order interaction patterns while preserving low-order shared structure, and can be used either as a constraint or as a diagnostic for monotone multi-task models.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use linking number as a diagnostic and optional regularizer for representations of paired closed data manifolds. The probe identifies layers that collapse or separate class geometry through collisions and folds, giving an architecture-selection signal beyond loss and Jacobian singular values.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Parameterize candidate eigenfunctions with a neural network, project them into a finite spectral trial space, and compute Ritz eigenvalues from the resulting Galerkin matrices. Train against the paper's rigorous lower-bound transform rather than trusting the raw Ritz values, producing a certificate that the predicted eigenvalues do not underestimate the exact eigenvalues under the projection-error assumptions.
Useful5/10
Difficulty5/10
Novelty8/10