Unverified
2026
Build an RNN from fast nonlinear units coupled through a spectrally contractive slow state. The fast component can generate rich transients, while the slow component has a provable absorbing radius because its linear recurrence contracts and its neural forcing is bounded. Cross-coupling strength is swept to detect the onset of expressive high-dimensional attractors without permitting state explosion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a large stable linear state-space or recurrent layer by a lower-order balanced realization computed from frequency-targeted controllability and observability Gramians. Use generalized low-rank ADI with imaginary-axis shifts concentrated at frequencies that dominate the training data, then retain states associated with the largest approximate Hankel singular values. This should reduce recurrent inference cost while preserving the layer's input-output response in the selected frequency…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use BB1 for inexpensive curvature adaptation, but monitor the projective gradient state for the periodic behavior identified in the paper. When the normalized gradient and scalar step size approximately repeat after seven iterations, temporarily switch to BB2 or a damped gradient step to destroy the attracting cycle, then return to BB1.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a low-dimensional basis for the principal module generated by the all-ones vector, then perform adjacency and degree propagation in compressed coordinates. On forests, the paper states that this module equals the automorphism-orbit module, so the reduced representation can preserve principal adjacency-degree information while using far fewer coordinates than the number of vertices.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a graph neural network with features generated by noncommutative words in the adjacency matrix and diagonal degree matrix. Ordered patterns such as AD^2A and DADA distinguish where degree information occurs along a walk; the paper proves that the full scalar moment family determines every tree.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Partition network parameters or output-head parameters into two coupled groups, C and D, and use a Schur-complement preconditioner rather than one shared scalar learning rate. The update approximately accounts for the response of group C before applying the curvature seen by group D, reducing the effect of cross-group gradient coupling and large condition numbers.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
When training a neural state-space model, SSM, or recurrent world model from trajectories, constrain the data-generation policy or augmentation process to satisfy both a Hankel-rank condition and a task-weighted frequency-coverage condition. The rank condition prevents unidentifiable dynamics, while the frequency condition concentrates samples at frequencies that affect the target prediction horizon, tracking objective, or closed-loop controller instead of merely producing broadband-looking…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a shallow neural interpolation controller to a neural ODE or state-space model so one shared vector field matches prescribed derivatives at several anchor trajectories. At every control time, compute controller weights from a small linear system instead of learning all task-specific parameters by backpropagation.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a learned scalar ordering to a directed graph attention layer and retain only forward edges, producing a DAG attention mask without requiring a supplied topological order. Train the ordering with a differentiable surrogate for weighted surplus, and regularize it toward the paper's explicit half-weight-minus-l2 certificate. This supplies a principled alternative to random masking or unconstrained bidirectional graph attention when causal or hierarchical information flow is desirable.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Set the residual propagation coefficient of a simplicial neural layer from a cheap upper bound on the operator spectrum instead of tuning it blindly. The degree-majorization theorem supplies a bound on the largest eigenvalue, while the Brouwer-type inequality supplies a topology-count-based bound on sums of the top eigenvalues.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Use the conjugate degree sequence of codimension-one faces as a mathematically justified upper envelope for the spectrum of a simplicial up-Laplacian. Penalize violations of the corresponding top-k eigenvalue budgets in a simplicial message-passing layer, discouraging a few dominant propagation modes that cause oversmoothing or unstable amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's correspondence between KAN splines and finite-element or isogeometric shape functions to build coordinate-separable tensor-product trial layers. Replace additive coordinate aggregation with a multiplicative contraction of one-dimensional spline expansions, yielding an explicit tensor-product basis without storing a dense multidimensional grid.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Compose independently parameterized neural dynamical modules through power-preserving skew coupling instead of equality penalties or projected constraints. This creates a modular graph or world model in which information exchanged between modules is antisymmetric, so internal coupling cannot create or destroy total latent energy.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Compress a dense neural-network weight tensor with mode-wise selected fibers and a small sampled core, then convert the result into a Tucker layer for efficient execution. Select indices greedily using reconstruction residuals rather than random sampling, and fine-tune the compressed model to recover task accuracy.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Compute separate doubled-angle orientation order parameters for left and right image regions, then expose their sum and difference as symmetric and antisymmetric global features. This gives a network a low-dimensional inductive bias for global vertical structure versus left-right imbalance, while retaining magnitude channels that indicate when either readout is undefined because orientations cancel.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense block of a large neural-network weight matrix with an adaptively constructed cross approximation, but prevent premature termination using residual checks on O(m+n) additional diagonal-like entries. Accept a rank only after the probe residual has remained below tolerance for several consecutive iterations; otherwise continue adding pivots.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the explicit Euler, Heun, or fixed-step midpoint update used for a neural ODE or diffusion probability-flow trajectory with a two-stage randomized SDIRK step. Draw one random scalar per time step, use it in both implicit stage equations, and solve each stage with Newton or damped fixed-point iteration. The randomness targets quadrature error caused by nonsmooth score networks, while the singly diagonal structure permits reuse of the same Jacobian preconditioner for both stage solves.
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Construct a scalar feature or critic for oscillator-based neural dynamics that is invariant under the transformations imposed by free harmonic motion and elastic collisions. For finite-size rods, the module should represent only quantities compatible with common oscillator-phase rotations and momentum permutations, preventing a learned world model from inventing coordinate-dependent pseudo-conserved quantities that disappear after collisions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the ordinary combinatorial Hodge propagation in a simplicial neural network with a geometry-induced weighted Hodge Laplacian built from Euclidean simplex volumes. The operator preserves the harmonic/topological subspace while changing the positive spectrum according to the shape and scale of the simplices, allowing message passing to distinguish geometrically meaningful cells that have identical incidence patterns.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unsigned two-hop cyclic mixer by the paper's alternating signed circulant. The sign pattern preserves one-step and two-step interactions while reducing the exact spectral radius from 4 to 2√2, allowing a larger raw mixing coefficient under the same operator-norm stability constraint.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Construct attention groups as hyperedges of a linear r-uniform hypergraph: every pair of tokens is allowed to share at most one group, while each token participates in approximately the same number of groups. Apply local attention inside each group and aggregate the outputs across groups. The construction inherits the paper's sharp capacity bound and prevents both redundant pair interactions and high-degree token hubs.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a nonnegative attention or routing score matrix by two nonnegative vectors, X = uv^T, and learn only entries on a sparse bipartite graph of important query-key or token-expert interactions. Complete the remaining entries multiplicatively and monitor cycle residuals as a certificate of whether the sparse representation is compatible with rank one. Use local ratio violations to trigger additional edges or relax the rank-one approximation only where needed.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a distribution-level loss that compares minibatch embeddings only through the square roots of their ordered covariance eigenvalues, ignoring global translation and rotation of the embedding coordinate system. This implements the Gaussian specialization of the paper’s Procrustes-Wasserstein geometry and is useful when two embedding clouds are semantically equivalent up to a rigid change of coordinates.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace ordinary Frobenius or spectral-norm control of a tensorized multilinear layer by a sampled approximation to its oriented Schatten profile, the maximum Schatten norm of every input-output flattening. Regularizing this profile should control Gaussian or randomized polynomial activations uniformly over hidden width and tensor contraction pattern, reducing exploding activations and making higher-order layers easier to scale.
Useful6/10
Difficulty5/10
Novelty7/10