Unverified
2026
Approximate a dense symmetric interaction matrix in a neural layer by \(\widehat A=C\widehat M C^{\top}\), but compute the small core \(\widehat M\) from a two-sided sketched least-squares fit rather than from the landmark principal submatrix. This preserves signed or indefinite directions and avoids exploding outputs caused by an almost-singular \(A(I,I)\).
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add two scalar adaptive gains to a neural controller or learned dynamical model: one estimates the unknown norm of the ideal neural approximation weights, and the other estimates the combined approximation, friction, and disturbance envelope. Sigma modification prevents unbounded gain growth, while the robust residual correction uses only these scalar estimates, independent of the number of neural features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense unconstrained channel-mixing matrix with a differentiable product of exponentials of a few skew-symmetric generators and their iterated commutators. The resulting layer is exactly orthogonal, preserves feature norms, and can express rotations in directions not explicitly stored as independent parameters. This is especially suitable for residual MLP blocks, recurrent state transitions, and networks processing rotation- or pose-valued features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the bipartite equation-variable matching to turn a large neural equilibrium system into independently or weakly coupled mechanism blocks before applying Newton updates. Within each matched endogenous cluster, solve the coupled variables jointly; across clusters, apply causal-order updates on the partially oriented graph. This can reduce the cost and instability of generic dense Jacobian solves in implicit neural networks.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a stable linear latent state-space block whose controllability Gramian is trained toward a chosen positive-definite target using squared Bures–Wasserstein distance. Direction-specific semidefinite constraints can suppress disturbance amplification in nuisance coordinates while preserving controllability in coordinates needed for prediction.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach a low-dimensional reachable-set monitor to an RNN or state-space model and propagate the set of hidden states allowed by bounded inputs, parameter uncertainty, and process noise. Penalize or reset hidden states that leave the predicted tube, turning the paper's instantaneous set-membership fault test into a robust neural-state validity test.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment the coordinate embedding of a neural operator, PINN, or coordinate MLP with Chebyshev features plus rational features whose poles are selected by the AAA rational approximation algorithm. The rational features should represent boundary layers and other localized singular structures with fewer channels than a high-degree polynomial basis, reducing Gibbs-like oscillations and improving accuracy at small diffusion-to-advection ratios.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the generic nonlinear drift in a two-dimensional continuous-time recurrent cell by a learnable piecewise-linear Lienard restoring force. Fold breakpoints and jump breakpoints become explicit architectural controls for creating multiple oscillatory attractors, allowing hidden states to encode phase, mode, or periodic memory. Weak input coupling can select or perturb attractors while preserving the autonomous cycle structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained dense transition or recurrent matrix with a normal matrix $A=U\operatorname{diag}(\lambda)U^*$, where $U$ is unitary and $\lambda$ contains learnable eigenvalues. The layer can be initialized by fitting a normal matrix to input-output pairs through the paper's objective, then trained with Riemannian updates that keep $U$ unitary and preserve the normal-operator structure.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use paired recurrent channels with exactly reciprocal gains while applying a common phase rotation. One channel carries a controlled expanding mode and the other a matching contracting mode, creating a tunable hyperbolic memory spectrum without the optimization fragility of an unconstrained recurrent matrix.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Construct a recurrent or state-space layer whose equilibrium Jacobian is placed near a nondegenerate Bogdanov–Takens point, then use a small unfolding parameter to move between damped, oscillatory, and slowly relaxing regimes. Unlike eigenvalue-only initialization near one, this controls both the double-zero center structure and the quadratic nonlinear coefficients that determine the local phase portrait.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Constrain a low-dimensional neural state-space model so that its vector-field Hessian approximately satisfies the paper's Pascal-Hessian condition. Combine the resulting latent dynamics with an observer correction driven by the prediction residual, giving a model whose hidden-state estimation error can be assigned a desired linear decay rate.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a Jacobian cone-field regularizer to recurrent dynamics so that tangent directions expand and remain aligned with an unstable cone outside a designated critical neighborhood. The network is not forced to be uniformly expanding: the regularizer is disabled near the critical set, allowing controlled bifurcation-like behavior while exposing where long-horizon sensitivity changes.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
When a recurrent or graph coupling matrix is approximately rank one, replace expensive full spectral monitoring with a scalar small-gain controller. Adapt a residual mixing coefficient so that the dominant coupled mode remains below a prescribed contraction threshold.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a sparse fixed orthogonal mixer by repeatedly applying pi/4 rotations to randomly matched pairs of feature coordinates. Place this mixer before top-k feature pruning, sparse projection, or activation quantization so that information is spread across coordinates without using a dense random matrix.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
For a neural block with matrix-valued activations and transformation Y = A X B, regularize the exact coupled spectrum of the two-sided map instead of penalizing A and B independently. A large singular direction in A is penalized more strongly when the corresponding singular direction in B is also large, directly controlling joint feature amplification.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Treat the router state as a symbolic base process and expert transformations as nonstationary expanding fiber maps. Add a relative entropy/free-energy constraint so that the router's conditional entropy is calibrated against the empirically measured growth rate of distinguishable expert trajectories, preventing premature expert collapse while retaining useful specialization.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the weighted feature Gramian to remove nearly dependent Fourier, sinusoidal, or dictionary features during training instead of relying only on magnitude pruning. The criterion detects redundant directions even when their learned coefficients are individually large, improving conditioning of the linear readout and reducing inference cost.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Build each nonlinear correction in an inverse neural operator from explicit bilinear products of learned operator features, following the inverse Born expansion instead of using an unconstrained pointwise MLP. Use a square activation to implement multiplication exactly, and truncate the interaction order so the model has a controllable polynomial structure.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace standard black-box hyperparameter search with a trust-region optimizer whose local quadratic surrogate includes an explicit linear dependence on wall-clock time or training-step age. Fit the model with ridge-regularized quadratic interpolation, then use a drift-compensated trust-region ratio to avoid rejecting useful moves merely because the validation distribution has deteriorated over time.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the first several convolutional blocks of a small image model with a finite-depth convolution-modulus scattering stem built from a Parseval filter bank. Enforce exact energy accounting and use the paper's polynomial residual law to choose the smallest depth that captures the desired fraction of input energy, avoiding unstable or redundant deep scattering paths.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace dense token-to-token attention in a controlled ablation with a cyclic order-a recurrence whose coefficients are periodic across positions. The resulting mixer has linear cost in sequence length for fixed recurrence order and can enforce a fixed signed periodic boundary condition, providing a compact structured alternative to local attention or a lightweight state-space model.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use a window of observed neural-network update trajectories to identify the set of local quadratic objectives and preconditioners that are consistent with the observed optimizer behavior. Rather than selecting one arbitrary curvature model, retain the nullspace of compatible parameters and use its dimension or smallest singular value as an identifiability and stability diagnostic.
Useful6/10
Difficulty6/10
Novelty8/10