Unverified
2026
When the Schrödinger generator is learned, regularize its spectrum and eigenvectors so that the magnitude trajectory remains well-conditioned for recovering hidden complex states. Penalize small singular values of the squared-eigenvector matrix and near-colliding eigenvalue pair sums, preventing a learned dynamical layer from becoming spectrally invisible or phase-ambiguous.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a learned self-adjoint contraction so that its eigenvalues move toward 0 or 1 rather than accumulating in the transition interval. This suppresses ambiguous mixing modes and can enable a smaller binary spectral approximation at inference.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Compute one-dimensional persistent homology and minimum-norm harmonic representatives, then use their absolute edge coefficients as topology-aware saliency in a graph transformer. Add the saliency to attention logits or use it as a soft regularizer so the model preferentially propagates information along edges that are essential to persistent cycles.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
For a learned recurrent or state-space model, estimate leading Koopman or transfer-operator modes and force their evaluations on a small set of latent states to be linearly independent. This transfers the paper's generic invertibility construction and discourages duplicated, weakly observable, or spectrally collapsed dynamical modes, potentially improving long-horizon prediction and interpretability.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Learn a low-dimensional active frame for a neural scalar quantity on a curved latent manifold, rather than averaging gradients in unrelated ambient tangent spaces. Use the frame as the only input to a low-rank adapter or as a constraint on fine-tuning updates, with parallel transport making gradient statistics comparable across samples.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a learned latent transition not merely to fit one-step data, but to require only a small operator correction before its selected spectral modes become exact eigenmodes. The correction is a measurable backward error, so the regularizer penalizes models whose apparent eigenstructure is highly sensitive to noise or finite-sample error. At inference time, the correction norm can trigger conservative rollout or mode suppression.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Select the coordinates of a sparse adapter or sparse fine-tuning mask using both Fisher width and inverse-Fisher width. The mask should avoid parameter subsets that are cheap in the Fisher geometry but extremely large in the inverse-Fisher geometry, or vice versa, thereby controlling both prediction sensitivity and estimator-like uncertainty.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a density-weighted kernel operator whose features are multiplied by sqrt(rho) on both input and output sides. Under bounded kernels, changing the density by L1 distance changes the operator in Hilbert-Schmidt norm only at square-root order, giving a directly testable robustness guarantee for adaptive attention or graph layers.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Construct the connectivity mask of a sparse MLP or MoE layer so that every active feature group is covered by a matching to an independent input or sample group. If the mask contains unmatched vertices, repair it with the fewest additional edges or low-rank skip connections before training. The goal is to avoid width- or sparsity-induced singular regimes that can produce sharp interpolation-like loss and generalization spikes.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a generic optimizer for equality-constrained neural-network updates with an augmented KKT solve that separately preconditions parameter and constraint variables. Add a positive semidefinite constraint penalty to the parameter block; this does not change an exactly feasible solution but makes the primal block better conditioned and the constraint Schur complement more robust.
Useful6/10
Difficulty6/10
Novelty6/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
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
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
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
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
Represent a small vector of neural control variables as a two-objective max-affine feasibility problem, such as clean-loss budget versus corruption-loss budget or task-performance budget versus activation-range budget. Rather than launching many independent weighted-sum optimizations, construct the active linear boundary and jump from breakpoint to breakpoint with the paper's Newton continuation step. This is intended for frozen-backbone calibration, LoRA gain tuning, activation clipping, or…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use fresh unlabeled covariates to train a frozen-teacher student against pseudo-labels, then form an affine combination of teacher and student predictions. Estimate the combination weight on a small independent labeled calibration set, requiring no access to the teacher training data and no additional teacher or student fitting.
Useful6/10
Difficulty3/10
Novelty5/10
Unverified
2026
Partition parallel neural-network replicas, experts, or parameter blocks into clusters and communicate their parameters through a directed nonnegative weight matrix whose dominant eigenvector is constant within each cluster. The optimizer contracts within-cluster disagreement while retaining separate cluster-level parameter states, providing controlled specialization instead of destructive global averaging.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a width- and degree-aware regularizer that prevents hidden polynomial neurons from collapsing to the same pivot. The paper's critical-point analysis says that non-global local minima and nontrivial saddles for cubic activation occur only when all pivots coincide, while global representations require at least d distinct active and visible pivots; the barrier directly targets this degeneracy.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the unconstrained final classifier with equal-norm regular-simplex class directions and train it under explicit isotropic Gaussian feature noise. At fixed signal energy and equal class priors, the paper's Gaussian-max theorem predicts that this geometry maximizes finite-noise maximum-likelihood decoding probability, making it a concrete candidate for robust classification heads.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Treat each neural-network block as a local strength system and measure how perturbations in its input channels affect multiple output observables, rather than using a single gradient norm. Use the estimated maximum directional gain to cap residual updates or assign a layerwise learning-rate multiplier, preventing weak high-gain layers from destabilizing training while allowing strong layers to move faster.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense learned linear operator on continuous or image features by a truncated Hermite projection expansion whose coefficients are directly regularized in a Schatten-p norm. The layer becomes a structured low-rank operator, while the radial Hermite-Laguerre correspondence provides an analytically tractable parameterization and an exact spectral penalty.
Useful6/10
Difficulty6/10
Novelty7/10