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
Represent graph-node or token states as points and tangent velocities on a Riemannian latent manifold, and couple neighboring states using parallel-transported velocity discrepancies rather than subtracting coordinates in a chart. Add a bonding barrier that keeps connected states inside a prescribed radius below the injectivity radius, making the transport map unique and preventing chart or geodesic branch failures.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a latent factor map that is approximately 1-Lipschitz and require it to preserve important scalar 1-Lipschitz observables of the data distribution. Approximate the universal quantifier with an adversarial bank of neural probes, rewarding the encoder for retaining distributionally stable information while discarding high-frequency or sample-specific detail.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a degree-conditioned neighborhood-profile penalty to a GNN so that its effective message-passing graph has a controlled hub-neighborhood trend. The regularizer can either target a rank-one null profile, where neighbor degree is approximately independent of root degree, or deliberately target a learned/reference logarithmic trend when preferential-attachment-like structure is useful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a constant learning rate by an adaptive prescribed-time gain calibrated to a user-specified deadline. Apply the mechanism to a nonnegative training Lyapunov error such as the loss under a local Polyak-Lojasiewicz condition, or to disagreement errors in distributed training, so that the error reaches a target tolerance by time T without using a singular learning rate.
Useful6/10
Difficulty5/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
Replace one spatial convolution block by a recurrent Fourier-domain layer that couples every mode k to its opposite mode -k and gives the strongest amplification to a nonzero selected wave number k*. The layer crosses a controlled Turing-like instability at k* and uses cubic saturation to produce bounded structured features instead of unbounded activation growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent every predicted displacement and velocity as the sum of a prescribed boundary lift and a learned residual that is identically zero on the Dirichlet boundary. Feed the boundary velocity into the model through an explicit distributed-port feature and train an energy-balance residual so that the learned interior dynamics cannot inject arbitrary energy at the constrained boundary. This should eliminate boundary drift and reduce the burden on penalties or projection layers.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment standard pairwise attention composition with a shared ternary correction m_3(a,b,c), so two different parenthesizations of a three-token or three-edge composition need not agree exactly but are forced to differ by a learned bounded correction. This gives the network a structured way to represent context-dependent compositionality without replacing efficient quadratic attention with unrestricted third-order attention.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a collection of overlapping sliding-window features with approximately orthogonal incremental features: the length-m feature contains information not predictable from shorter consecutive windows. Use the paper's transition-operator Toeplitz precision matrix to decorrelate the resulting sequence of window features before attention, suppressing duplicated local evidence and improving conditioning.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a stable diffusive state-space model with pair states formed from products of slow latent modes. Single modes represent ordinary long-wavelength diffusion, while pair modes represent the interacting hydrodynamic operators responsible for late-time tails in quartic observables. Use the pair states only for selected readout channels or a low-rank subset of mode pairs, preserving near-linear inference cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a differentiable layer that enforces multiple affine consistency constraints by running several short strings of relaxed projections and averaging their outputs. Change the strings and weights across training steps, but impose bounded string length, positive averaging weights, and an almost-cyclic coverage rule so every constraint is revisited regularly. This creates an architecture-level analogue of dynamic string-averaging rather than applying one fixed projection order.
Useful6/10
Difficulty5/10
Novelty6/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
Regularize a generator so that the Gram determinant of its Jacobian with respect to Gaussian latent noise rarely becomes very small. This should reduce latent-space collapse and make the generated distribution more regular, improving the chance that small Wasserstein or MMD errors correspond to small density-level errors rather than narrow singular spikes.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a local convolutional block with a fractional nonlocal-gradient branch that aggregates directional feature differences over multiple spatial scales. The residual branch gives each location access to long-range variation while preserving the property that constant feature fields produce zero response. A learnable residual gate allows the network to suppress the branch if nonlocal interactions are unhelpful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Introduce two bounded state variables into training: x measures latent, reliable learning progress, while y measures the currently active population of high-gain parameter updates or difficult examples. Let x increase irreversibly when active updates are productive, while y grows through interaction with the latent pool and decays through exhaustion. Use y to gate the learning rate or curriculum intensity, producing a low-noise incubation phase followed by an endogenous acceleration phase once…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent state update by a locally parameterized invariant manifold h equals K of z, where the latent dynamics z at the next step equal R of z and preserve slow modes near a degenerate fixed point. Train the embedding and reduced map jointly with an invariance residual, while a weighted lattice norm discourages perturbations in distant channels or spatial sites from growing.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When clients optimize the same publicly known pair of losses but have private trade-offs, protect only the ratio of objective weights rather than the complete weight vector. Communicate a ratio-conditioned mixed gradient or controller statistic, with sensitivity defined over bounded ratio changes. This can reduce the required privacy noise when common rescaling of all objective weights carries no meaningful private information.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Instrument selected neural-network operators with cheap stochastic perturbations and estimate how much their outputs change under finite-precision perturbations. Use the resulting per-operator score to identify unstable kernels and selectively switch them to FP32, compensated accumulation, or a stable reformulation instead of running the entire model at high precision.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a single hidden state or a finite-order covariance/cumulant closure by an ensemble of independently propagated mean-field particles. The network output is reconstructed from particle averages, allowing bimodal and strongly non-Gaussian hidden-state distributions without explicitly evolving third- and higher-order tensors.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a multiplicative renewal clock to decide when a neural module is updated, rather than updating at every wall-clock tick or using a fixed iteration schedule. The resulting computation allocates many updates early and increasingly long intervals between later updates, while preserving a tunable stochastic distribution of update times; this is intended for anytime recurrent refinement, continual learning, or adaptive inference where late updates have diminishing marginal value.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace a costly full-data conjugate-gradient solve for a neural-network linearized least-squares step with a sequence of progressively larger sketched solves. Each solve starts from the previous solution, so early iterations cheaply identify the useful update direction and only the final few iterations use the full training batch.
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 the usual mean performance objective for a policy or predictor with a positive-margin CVaR objective over sampled deployment perturbations. The network is rewarded only when the mean of the worst perturbation tail remains above a chosen margin, which should suppress brittle solutions that perform well nominally but fail under a small subset of adverse conditions.
Useful6/10
Difficulty4/10
Novelty5/10