Unverified
2026
Replace a conventional signed-graph message-passing layer with two coupled feature channels: a fixed channel invariant under switching and an anti-fixed channel that changes sign under switching. Unsigned aggregation updates invariant features, while signed aggregation updates anti-invariant features, implementing the paper's sphere-plus-involution representation at the hidden-state level.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a structural penalty to a learned hypergraph or sparse routing graph that measures the gap between its conjugate vertex-degree spectrum and the squared spectrum of its up-Laplacian. The paper's identity says this gap equals twice the number of failed elementary shifts, so minimizing it encourages an ordered incidence structure rather than merely matching degree statistics or sparsity.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Parameterize continuous representation sectors using the Hodge geometry of the character torus rather than arbitrary Euclidean coordinates. Use the resulting metric to encode sector locations and impose local spectral smoothness, allowing a model to interpolate between geometrically nearby twists while retaining non-topological variation.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace raw pairwise attention or graph-edge scores by exact U-centered residuals, removing additive effects attributable to either endpoint. The resulting scores represent interaction beyond independent source and destination biases and satisfy zero row sums, preventing a few high-degree or high-activation tokens from dominating relational aggregation.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Represent a neural deformation of a mesh or simplicial graph by vertex positions \(f\), and constrain every oriented simplex to retain positive signed volume. Add a logarithmic barrier during feasible optimization and use a feasibility-restoration phase for initially inverted elements, turning foldover prevention into a hard geometric invariant rather than a soft penalty.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent or residual transition with a block-structured contractive realization whose input-dependent multiplier is a direct sum of bounded branches. The resulting layer has a built-in non-expansive energy bound on the chosen normalized input domain, while still allowing different branches to respond to different coordinates or feature groups.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Attach a symbolic sparse head to a neural encoder instead of using a dense final MLP. The head evaluates a library of learnable power-law and interaction terms on nonnegative learned features, jointly optimizes linear coefficients and exponents, and removes inactive terms with coefficient sparsity. This should provide a compact model with better relative-error behavior on positive targets spanning several orders of magnitude.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Model stochastic training or recurrent inference as a random dynamical system and penalize the exponential growth of volumes transported by its Jacobian. This converts the paper's entropy and volume-growth relation into a computable regularizer that discourages chaotic sensitivity while retaining directions needed for fitting.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent transition on several probability-valued latent states with a nonlinear Markov operator whose transition coefficients depend on pairwise inner products between the states. Enforce the paper's coefficient margin so the layer preserves nonnegativity and normalization for every input, avoiding exploding or invalid probability states while allowing state-to-state interference.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment a mixture-of-experts router with a relative transverse-curvature score computed between experts, rather than relying only on the router MLP logits. Experts that provide a broader, less stiff local response in task-relevant directions receive higher routing probability, while common nuisance or spectator directions cancel from the comparison. The score is invariant under a common linear reparameterization of the routing coordinates and can be restricted to a low-dimensional…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a one-dimensional recurrent or neural-ODE model whose global generator is a sum of translated nearest-neighbour operators H = sum_i h_(i,i+1), and penalize the three-site Reshetikhin residual. The resulting model is encouraged to conserve its total local energy current, which should reduce secular errors in long-horizon rollout while retaining a local, parameter-efficient interaction structure.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an expensive global resolvent calculation for a recurrent or state-space transition operator by measurements on overlapping finite patches. Penalize patches whose shifted operator has small minimum gain, while adding the paper's explicit O(1/n) truncation penalty so that increasing the patch size produces a predictable tightening of the stability certificate. This targets non-normal transient amplification that is invisible to ordinary eigenvalue or spectral-radius regularization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use three learned state-transition operators corresponding to three data axes, and train them to satisfy the paper's pullback-style interchange rule. For every local pair of axes, two successive updates should reach the same square state; for triples of axes, all six update orders should agree. This reduces sensitivity to scan direction and limits long-horizon drift caused by inconsistent local transitions.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace arithmetic averaging of feature covariances by the weighted Bures–Wasserstein barycenter of several SPD covariance matrices. The layer aggregates covariance statistics from augmentations, heads, channels, or local patches in a way that respects the geometry of centered Gaussian feature distributions and remains invariant under congruence changes of coordinates.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Train a neural network that predicts a symmetric matrix family without choosing a particular latent basis. In addition to matching pointwise eigenvalues, match gauge-invariant relational quantities formed by traces of products of matrices at several inputs; these distinguish matrix families that have identical spectra at every input but differ in their shared eigenvector geometry. Evaluate the result after one global orthogonal Procrustes alignment, not by independently aligning every sample.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace random edge dropout in a GNN with an order-aware filtration that removes edges in decreasing local spectral coherence. High-coherence edges are those whose rank-one Laplacian perturbations align strongly with the current local Laplacian, so their removal creates structured, spectrally meaningful augmentations rather than arbitrary damage. Train the GNN jointly on the original graph and several filtration states using supervised loss plus prediction or embedding consistency.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Attach vector-valued local features to simplices, nodes, edges, or hyperedges and penalize violations of sheaf restriction maps that should make local predictions agree on shared higher-order structures. Evaluate the compatibility loss on progressively degraded subcomplexes, producing a persistence-style robustness objective that rewards features whose global consistency survives structural failures.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent a multiparameter feature stream as a direct sum of interval modules over the nonempty-subset lattice of several corruption, scale, or context variables. Each learned channel is active only on a connected order-convex region of the lattice, replacing a dense bank of unrelated per-condition adapters with reusable feature channels having explicit parameter-space lifetimes.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Apply the paper's mechanism-contrast idea to ReLU decoders by requiring each piecewise-affine branch to produce a detectable and distinctive change across at least one activation boundary. Penalize branches with vanishing Jacobian jumps or nearly identical boundary signatures, discouraging observationally interchangeable decoder mechanisms.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Compress representations of graph fragments according to their empirical edge-connection rank instead of using a generic hidden dimension. For fragments with t open ends, learn only the quotient space of boundary behaviors that remain distinguishable after gluing, producing a compositional graph network whose boundary-state dimension is capped by an estimated R^t.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Parameterize a large linear layer as a sum of binary tensor products, W = Σ_l A_l ⊗ B_l, and regularize a factor-level upper bound on its top-k singular-value sums. The bound controls all Ky Fan norms of W while requiring SVDs only of the small factors, making it suitable for tensorized MLP or attention projections.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's derivative-dispersion mechanism as a neural regularizer: the input-dependent forcing should produce different derivatives in different hidden directions. Penalize collapse of the Jacobian of the forcing map while retaining a contracting recurrent transition, so hidden states do not converge to a low-dimensional manifold caused by nearly parallel inputs.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use attractor separation and noise-induced basin coalescence as a robustness test for recurrent networks with multiple learned memories or modes. Estimate the smallest perturbation amplitude at which initially distinct hidden-state attractors become geometrically indistinguishable, then train or operate below that threshold with a safety margin.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a single recurrent transition with a finite bank of candidate positive linear transitions and use a minimax controller to choose the feedback action at every time step. The controller evaluates candidate successors, selects the action whose worst-case predicted cost is smallest, and clips the action to preserve nonnegative hidden states. This should make an SSM or RNN less sensitive to transition-matrix mismatch and long-horizon disturbances.
Useful6/10
Difficulty6/10
Novelty7/10