Unverified
2026
Constrain the Jacobian of a recurrent or state-space transition to preserve a prescribed cone of admissible hidden-state perturbations. This imports differential positivity into neural dynamics and makes long-run hidden trajectories order-preserving rather than allowing arbitrary sign-changing perturbation growth.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace Euclidean momentum with a kinetic process on a parameter manifold: parameters are positions, momentum is a tangent vector, and noise is injected only into momentum. Add a cross-covariance correction based on the imbalance between position-gradient and momentum-gradient energies, mirroring the paper's hypocoercive Lyapunov functional. The testable claim is faster escape from badly conditioned valleys and less sensitivity to parameter rescaling than SGD with momentum at matched gradient…
Useful6/10
Difficulty5/10
Novelty4/10
Unverified
2026
Replace raw squared penalties on generated feature means with the paper's nested information-projection statistic. A model output distribution is projected once onto structural constraints and once onto structural-plus-test constraints; their KL divergence produces a sample-size-scaled loss and an approximate chi-square p-value. This should help when constraints have different variances or are strongly correlated, because the KL geometry automatically adapts to their covariance instead of…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a neural encoder so its local pullback metric is bounded by the refined Schwarz-lemma constant instead of using a generic Frobenius Jacobian penalty. For an encoder into a negatively curved latent space, penalize only singular directions whose squared expansion exceeds the curvature- and dilatation-dependent threshold.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent recurrent hidden states as compact phases and monitor spacetime vortices, defined by wrapped phase differences around elementary space-time plaquettes. Add a feedback controller that increases relaxation toward the homogeneous phase when vortex activity becomes supercritical, while allowing larger recurrent gain when the system is excessively quiescent. This creates a falsifiable operating regime: useful computation should occur near, but below, the defect-proliferation transition…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Learn an endpoint-conditioned scalar potential whose level sets represent states with the same asymptotic behavior, analogous to the paper's stable magnetic orthospheres. Train the dynamics to contract differences within a level set while preserving differences between distinct endpoint classes, producing a latent representation organized by stable manifolds rather than Euclidean proximity.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Insert a hyperspherical adapter that splits an embedding into several unit-sphere blocks, changes the dimension of each block, and recombines them with a synchronized spherical join. Train the adapter to preserve pairwise angular distances, while using the paper's max-distortion composition principle to avoid uncontrolled accumulation of blockwise errors.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Insert a proximal layer after a graph, mesh, or spherical convolution that groups all coordinates belonging to the same Laplacian eigenspace and applies one shared shrinkage gate to the whole group. Unlike coefficientwise spectral pruning, the result is unchanged if the eigenvectors inside a repeated eigenspace are rotated, preventing arbitrary basis-dependent feature selection.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent adaptive computation or MoE routing as a continuous latent trajectory that crosses convex mode walls, with a Minkowski norm defining computational speed. At a wall, choose the outgoing latent velocity by the same constrained variational rule as billiard reflection, and use the local path-length certificate to detect or prevent pathological accumulation of infinitely many routing events in finite depth.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace unconstrained attention score vectors by normalized SU(2) coherent-state responses of a positive operator on an (N+1)-dimensional spin space. Each query produces a smooth bounded response over a fixed spherical grid, while values are aggregated normally. The coherent-state kernel imposes geometric structure and exposes a controllable concentration parameter N.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a projective normalization and spectral monitor into a recurrent or deep residual dynamical block. If the effective linearized map has one real eigenvalue whose modulus dominates all others, the block is predicted to collapse features toward one direction; constrain the spectral ratio or preserve a controlled two-dimensional rotational mode to maintain representational rank.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Generate relational training examples by first coupling two graphs or kernels and then interpolating every matched pair of node or edge attributes along a geodesic in Z. Unlike ordinary mixup, this preserves the intrinsic Gromov-Wasserstein correspondence and produces constant-speed paths in the relational metric when Z is geodesic.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a fixed spherical t-design as the direction codebook for a directional attention or feature-aggregation module instead of independently sampled random directions. Equal weights provide exact zero mean and isotropic second moments, while exactness for spherical polynomials up to degree t reduces directional aliasing and seed-dependent anisotropy.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a low-dimensional polynomial model of local training dynamics to detect when the leading nonlinear restoring behavior becomes degenerate. Shrink the optimizer step in that region, or fit higher-order terms before restoring it, because the paper shows that quartic nondegeneracy determines whether local nonlinear stability can be certified and that sixth-order terms resolve inconclusive cases.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Track where the loss Hessian's eigenvectors are most sensitive to the current minibatch perturbation, rather than using only eigenvalues or a global learning-rate estimate. Apply extra damping only to spectral bands with high geometric response, allowing flat and well-separated curvature modes to retain a larger step size.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Use the conditioning of a learned symmetry-commutant manifold as a training-time detector for frozen or weakly reachable hidden-state regions. When replica observables become nearly linearly dependent, the commutant Gram matrix becomes ill-conditioned; reduce injected noise and learning rate there, or perturb only directions with measurable response. The mechanism predicts a transition in relaxation curves at a conditioning threshold rather than relying only on validation loss.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Construct a recurrent layer with a hidden clock coordinate that advances by a nonzero drift and use that coordinate to define a state-dependent metric for the remaining hidden channels. The layer may contain neutral or sign-flipping Euclidean modes, but the metric is designed so that forward and backward Jacobian products become uniformly contracting on complementary subspaces, imitating the White-map mechanism. This targets vanishing or exploding gradients in long sequences while preserving…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize a recurrent or state-space transition matrix using numerical ranges after bounded-condition-number similarity transforms, rather than only penalizing eigenvalues or the raw spectral norm. The resulting penalty targets nonnormal transient amplification and can certify bounds on powers or other polynomial functions of the transition matrix.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Run local neural experts on overlapping subsets of an irregular support and impose the paper's restriction-and-extension condition on their outputs. Instead of averaging inconsistent local predictions, add an overlap compatibility loss and optionally compute a global feature by a least-squares extension, producing representations with no discontinuous seams between patches.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build several Gaussian similarity matrices on minibatch embeddings, using empirical distance quantiles as their bandwidths, then combine them before degree normalization and spectral embedding. Add a regularizer that encourages the resulting row-normalized spectral coordinates to form compact pseudo-clusters, making the representation robust to multiple geometric scales rather than one manually tuned temperature.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Represent each recurrent latent state as a pair of unit quaternions \((q_1,q_2)\in\mathrm{SU}(2)^2\), and evolve it with a composition of elementary Nielsen maps corresponding to a chosen hyperbolic matrix \(A\in\mathrm{SL}(2,\mathbb{Z})\). The layer exactly preserves the group manifold and Haar volume, preserves the commuting locus \(q_1q_2=q_2q_1\), and reproduces toral hyperbolic dynamics there, giving a structured long-horizon prior instead of an unconstrained matrix recurrence.
Useful6/10
Difficulty5/10
Novelty8/10