Unverified
2026
Replace a collection of dense task-specific linear layers with a common sparse structural matrix and task-specific edge strengths. All tasks share the same learned connectivity pattern, but retain independent values on active connections, allowing parameter sharing without forcing identical interactions.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
For every unordered pair of scalar features, construct invariant coordinates from the elementary symmetric quantities s=x+y and q=xy, then feed a truncated orthogonalized polynomial basis in (s,q) to the neural network. Estimate the basis by weighted Gram-Schmidt or Cholesky whitening under the paper's triangle weight, so polynomial channels have low redundancy and controlled scale instead of requiring an unconstrained MLP to learn both symmetry and decorrelation.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace a singular inverse interaction kernel by the finite part of its meromorphic continuation at an exceptional dimension, producing an explicit polynomial-times-logarithm feature interaction. This gives a controlled alternative to adding an arbitrary ridge term when a learned polynomial Gram matrix becomes rank-deficient.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace dense spatial pooling or integral evaluation over a planar domain by a sparse cubature layer whose nodes are poles of a rational approximation fitted only on the domain boundary. For analytic or nearly analytic neural-field channels, the same learned field can then be integrated using substantially fewer evaluations than a uniform grid, while the boundary approximation residual supplies a cheap reliability signal.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a single-hidden-layer network whose hidden weights and biases are sampled from a non-continuous distribution supported on a dense subset of parameter space, then train only the output coefficients. The result motivates discrete or mixed-precision hidden parameters without requiring a continuous Gaussian initialization; finite-width experiments can test whether this retains accuracy while reducing hidden-layer storage and arithmetic cost.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Construct positional features from a self-similar digit system whose Fourier characters are orthogonal under a prescribed nonuniform measure, rather than sampling frequencies independently. Use several admissible multiplier values to create frequency bands while preserving the underlying Hadamard structure, giving a deterministic multiscale encoding with a better-conditioned feature Gram matrix on fractal or highly clustered coordinates.
Useful5/10
Difficulty4/10
Novelty5/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
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
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
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
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
Estimate the simplex-based ratio of a target or learned convex piecewise-linear polytope and use the theorem \(\rho_\Delta(P)\le 2^d-1\) to choose a minimum useful ReLU depth. During training, monitor whether the learned polytope is approaching a high-\(\rho\) target; if it is, widen the model without increasing depth only when the diagnostic indicates that depth is the bottleneck.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Add a bank of quadratic features encoding tangent contact with the reciprocal manifold x1 x2 = 1, rather than forcing a generic MLP to discover this interaction from arbitrary monomials. For positive bounded feature pairs, each feature is nonnegative and becomes exactly zero at a selected reciprocal operating point. The module can be used either as an input feature expansion or as a regularizer encouraging learned gates and scales to follow a reciprocal geometry.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10