Unverified
2026
Replace an untied stack of recurrent or polynomial-filter blocks with a delayed recurrence whose coefficients repeat with period r and whose characteristic polynomial has exact (r+1)-fold rotational symmetry. The resulting layer couples the current state to a state r steps back, producing a structured spectrum rather than arbitrary eigenvalues and potentially improving long-horizon propagation with fewer parameters.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an arbitrary graph spectral filter with a constrained transition-band filter that is exactly one on the lowest L graph frequencies and zero above frequency N. Train or initialize the transition coefficients to minimize the induced infinity-norm excess above one, which controls amplification and sign overshoot while retaining low-frequency information exactly. The paper predicts that widening the transition band reduces the best achievable excess quadratically rather than linearly.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unrestricted recurrent state with a current input-driven state coupled to a fading average of its own history. The memory coupling provides a distributed dissipative channel, while the recurrent Jacobian is constrained below a measurable contraction boundary. This creates a recurrent or state-space block whose long-horizon sensitivity can be tested against explicit characteristic roots.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace independent softmax routing or attention normalization with a differentiable approximate distribution over one-to-one assignments, using the Bethe permanent as the partition-function surrogate. Constrain the allowed token-to-expert or query-to-key support graph to have high girth, which gives an explicit bound on the approximation error and reduces short-cycle-induced correlations.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Parameterize a scalar or vector implicit neural field on each spatial cell with Bernstein polynomials and constrain its coefficients instead of sampling many points to enforce output bounds. The Bernstein convex-hull property gives a deterministic pointwise bound everywhere in the cell, making the method useful for neural fields representing densities, concentrations, masks, or material parameters.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Build a neural interaction layer for multiple populations whose cross-population kernels are ordered, so the response of population s to population t need not equal the response of t to s. Evaluate the interaction in divergence form and apply an explicit moment-nullspace projection so each layer preserves total mass, momentum, and energy instead of learning these constraints from penalties.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a fixed expander channel before a covariance-dependent feature transformation. The channel repeatedly conjugates the feature covariance by a constant number of sparse Pauli/CNOT unitaries, preserving total feature energy while contracting anisotropic covariance components. Use the mixed covariance for whitening or as a regularized normalization statistic, and test whether it gives more stable training than dense whitening or an explicit isotropy penalty.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Augment an RNN or state-space model with a finite-state binary-context module whose transitions are those of a de Bruijn graph, while a signed transition channel records a quadratic parity function of the recent context. The exact finite-memory branch preserves cancellation-sensitive parity features that a continuous hidden state may forget, and a learned readout can combine it with the ordinary neural state.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a local smoothness penalty or local state transition along a sequence or depth coordinate by a marginal fractional quadratic energy with Fourier multiplier |k|. The sigma=1 kernel is nonlocal and scale-free, so it can preserve long-range correlations while suppressing high-frequency instability more selectively than an ordinary Laplacian penalty.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace dense attention weights with a compactly supported anisotropic bump derived from the obstacle solution, using one learnable ellipsoid per attention head or feature group. Tokens outside the learned ellipsoid receive exactly zero weight, while tokens inside receive smoothly decaying weights according to a fractional exponent. The learned positive-definite matrix represents orientation, scale, and correlations between feature dimensions.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Insert a projection-space mixer that combines several fixed or learned directions using reciprocal correlations with the current feature, then normalize the result. The exact construction has a universal beta law for its squared input-output cosine, so it can create controlled angular diversity while remaining deterministic and independent of the chosen direction dictionary.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a sparse multivariate Legendre expansion as the geometry-to-network-weights map, rather than an unconstrained MLP that consumes all shape parameters. The hypernetwork predicts only coefficients for a selected set of polynomial multi-indices, allowing high-dimensional or countably parameterized shape uncertainty to be handled with a number of learned terms determined by coefficient decay rather than ambient dimension.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace pointwise high-order derivative residuals in an eigenvalue PINN by an assembled dynamic-stiffness residual \(\mathbf W(\omega)q_\theta\), where each element matrix is obtained from homogeneous PDE solutions. The network predicts nodal degrees of freedom or element boundary traces, while the exact frequency-domain operator enforces the physics without differentiating the network multiple times with respect to coordinates.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a fixed or lightly parameterized graph-level feature extractor based on short non-backtracking cycle counts, and concatenate its Poisson log-likelihood-ratio features with the output of a graph neural network. The feature scaling uses the paper's explicit means, so the network receives statistics that are approximately independent and correctly normalized rather than raw, highly correlated cycle counts.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a sparse heavy-tailed nonlocal mixing operator into a residual sequence, graph, or spatial network so that information can traverse distant positions without stacking many local layers. Use the critical tail exponent s = 1/2, whose truncated first moment grows logarithmically and predicts an effective propagation distance proportional to depth times log depth rather than merely depth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a fixed, spatially correlated perturbation field to every layer of a CNN or 2D state-space model, with the perturbation decomposed into transverse and longitudinal Fourier components. Unlike ordinary injected noise, the same field is reused for all training examples and all forward passes, allowing it to act as a structured architectural flow that can promote global feature alignment. Sweep the transverse fraction at fixed total perturbation variance and test for the predicted ordering…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a neural controller's pointwise action outputs over a finite horizon with Bernstein control points whose convex hull satisfies actuator and trajectory constraints. The network predicts the control points, while a robust margin accounts for bounded tracking or model-prediction error, making continuous-time actuator feasibility checkable from finitely many inequalities.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a generative or recurrent neural architecture with several contractive or mildly expanding branches, and explicitly control the geometric complexity of its invariant set using the sub-additive singular-value pressure of branch-Jacobian products. Instead of regularizing only the operator norm, the model can preserve anisotropic directions while targeting a desired attractor dimension, potentially improving coverage of structured data without uncontrolled folding or collapse.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the dense output of selected linear projections with a two-sided magnitude threshold that emits zero for small values but preserves signed large values. Learn one positive threshold per projection, or optionally one threshold per output channel, so the network discovers where sparse events can be removed while retaining outlier information.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace an explicit recurrent transition with a learned descriptor relation in latent space, allowing some latent coordinates to satisfy algebraic constraints rather than being numerically integrated. Fit the relation using total-least-squares or iterative PCA on the jointly observed trajectory, so noise in every channel is treated symmetrically and the model can discover whether the latent system is index-0 or index-1.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use exhaustive finite-state analysis as an architecture-search objective for coupled recurrent motifs. Instead of independently tuning a normalization gate and a WTA gate, enumerate their possible interfaces and select couplings that create group action only on a small joint image set, yielding controlled reversible subdynamics embedded in an otherwise dissipative system.
Useful6/10
Difficulty6/10
Novelty9/10
Unverified
2026
Represent a neural density or feature field by two positive reciprocal branches whose product is the modeled density, analogous to the forward and backward fields in the paper. Add stochastic branching perturbations to the two branches and train their cross-covariance so that the diagonal paired density matches the target while off-diagonal correlations remain finite-range. This creates a structured alternative to an unconstrained single-field uncertainty representation.
Useful6/10
Difficulty6/10
Novelty7/10