Unverified
2026
Add a causal gate to a neural safe-RL controller that distinguishes between evidence observed before a potentially irreversible action and evidence generated by that action itself. The policy may switch from a conservative controller to a model-specific aggressive controller only when the precommitment likelihood ratio against every dangerous alternative exceeds a threshold; otherwise it must choose an action with a verified safe continuation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense node-to-landmark graph-attention or message-passing relation by a dictionary of distinct landmark-neighborhood signatures. Nodes sharing the same signature reuse the same structural landmark aggregate, while their individual hidden states are still passed through the output MLP, preserving node-specific predictions. On bounded-treewidth graphs the number of distinct signatures is provably linear in the number k of landmarks, with an explicit dependence on treewidth.
Useful6/10
Difficulty5/10
Novelty7/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
Use the paper’s sharply different scaling laws to decide whether additional data should be spent on more test-time views or on retraining and refining the dictionary. Extra test replication is useful for separating active coordinates, but cannot overcome unresolved dictionary orientation when Ns⁶ remains small.
Useful6/10
Difficulty4/10
Novelty8/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 k-means-style prototype assignment with a distance-decay capture layer whose scale varies across samples, tokens, or classes. Train with a cooperative concave surrogate over prototype centers and anneal toward hard nearest-prototype assignment; this explicitly preserves useful gradients for multiple nearby prototypes while retaining sparse facility-like behavior at inference.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace forward activation dropout in a deep residual network with an unbiased multiplicative mask applied only to gradients entering each residual unit or branch. The forward representation remains deterministic for a given minibatch, while the update receives zero-mean stochastic perturbations that are predicted to reproduce dropout-like limiting dynamics in large-width, large-depth ResNets.
Useful6/10
Difficulty4/10
Novelty7/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
Unverified
2026
Replace the usual inverse-eigenvalue weights in a low-rank feature-covariance preconditioner by inverse weights with an estimated isotropic floor subtracted. Retain only the top r eigendirections and require every corrected denominator to exceed a margin, preventing the shifted inverse from approaching a pole. This should undo systematic under-updating of predictive directions when many weak feature directions inflate the empirical covariance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the external field H as a slowly swept control variable for a neural module, loss coefficient, or optimizer gain, and deliberately retain the resulting branch memory instead of replacing it with an instantaneous equilibrium update. Forward and backward sweeps produce a hysteresis loop whose shape diagnoses first-order-like training transitions, while controlled disorder changes the loop area and can suppress harmful branch dependence. This supplies a continuation-based curriculum or…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace ordinary row-degree or symmetric normalization in a directed graph neural network with a nonlinear Dyson scaling. For a nonnegative directed adjacency matrix A, solve a positive vector equation and propagate with B = D A D, where D is the diagonal matrix of the solution. The resulting operator has row sums strictly below one, giving an explicit bound against exploding directed message propagation while retaining asymmetric edge information.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
For a neural ODE or recurrent state update, learn a positive-definite degree-two homogeneous Lyapunov function that is only C1, rather than restricting the certificate to polynomials or analytic neural networks. Parameterize its angular dependence with a positive spline or softplus mixture, and train it to decrease along the learned vector field; this can certify stable dynamics that polynomial Lyapunov searches systematically miss.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a learned embedding for each integer with a compositional embedding of its variable-length Gray codeword. Add an auxiliary constraint that numerically adjacent values have nearby representations, while preserving the ordinary task loss so that the model can learn when numerical adjacency matters.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace a dense channel-mixing matrix by a sparse complex generalised weighing matrix W with exactly w nonzero entries in every row and column, then use U=W divided by square root of w as a norm-preserving mixer. Restricting to k=2 gives a real matrix with entries in {+1,-1}; k=4 supports signed phase rotations. The exact isometry should preserve signal and gradient norms while reducing channel-mixing cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a recurrent or state-space layer with a bounded synaptic-depression variable that multiplicatively reduces recurrent transmission after activity. During training, estimate the layer's impulse-response transform and penalize characteristic roots approaching the unstable half-plane. This directly targets slow oscillations and exploding recurrent feedback rather than relying only on gradient clipping.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a neural embedding so that two augmented views of the same point cloud or graph induce homologous cycles whenever their embedded vertices move by at most δ. Instead of requiring identical topology at exactly the same distance threshold, compare homology at ε for one view with homology at ε+δ for the other, matching the paper's mathematically justified scale slack. This should discourage brittle holes and connected-component changes caused purely by augmentation noise while…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a Born–Infeld/Minkowski-gradient barrier to a coordinate MLP so that its spatial gradient remains below a prescribed speed limit, rather than using an ordinary quadratic smoothness penalty. Couple the barrier with a forcing or task loss; under strong forcing, the resulting field should preferentially approach a distance-to-boundary-like profile while avoiding exploding derivatives and oscillatory solutions.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Construct a barrier metric between neural-network checkpoints or low-loss states using transition rates on a sparse neighbor graph, and use its induced single-linkage hierarchy to restrict updates within the current basin before permitting cross-basin moves. In the large barrier-spread regime, the metric is controlled by the largest barrier along the best path, producing an ultrametric hierarchy that can replace unreliable Euclidean distance for trust-region and replay decisions.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Constrain a conditional stochastic neural module to define an approximate martingale kernel while minimizing its expected conditional Wasserstein distance to a reference law q. The module should change the input distribution only as much as necessary to match the target marginal, rather than freely reshaping every conditional distribution.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's fast-layer/reduced-problem decomposition as a training schedule: first optimize a cheap reduced neural dynamics on the critical manifold, then gradually restore the fast dynamics by increasing the stiffness parameter. This provides a continuation path from an easy slow problem to the intended recurrent or implicit model and supplies a concrete stopping criterion based on normal-hyperbolicity loss.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a single recurrent or neural-ODE state update by a fast subsystem for the rapidly relaxing state and a slow subsystem for context, memory, or parameters. Constrain the learned algebraic critical manifold to remain normally hyperbolic during ordinary operation, while treating its folds as explicit, detectable transition surfaces that can generate controlled regime changes rather than numerical blow-up.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained relative-position attention-bias table by a learnable two-dimensional Fourier representation, or regularize the bias toward a small Fourier ratio. The ratio favors coefficient concentration without depending on the absolute scale of the bias, allowing the trained bias to be reconstructed from a small number of dominant frequencies.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Choose the diffusion noise schedule to maximize the minimum DSM sensitivity to important distribution parameters, such as mixture weights. This should reduce mode amplification and improve recovery of rare modes without changing the score-network architecture.
Useful6/10
Difficulty6/10
Novelty7/10