Unverified
2026
Store a convex object as a direction-indexed vertex tuple and implement composition of objects through componentwise Minkowski addition and nonnegative scaling. This creates a structured residual or compositional layer where convexification is nonexpansive, making perturbation amplification controllable and avoiding repeated generic geometric optimization.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Construct a mesh neural network with node, edge, face, and cell feature spaces modeled on the four spaces of the discrete elasticity complex. Replace unconstrained cross-order message passing by fixed incidence and geometric operators whose compositions vanish exactly, so gradient-like, incompatibility-like, and divergence-like features cannot contain algebraically spurious components.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a cheap spectral gate to a state-space model or recurrent event detector that decides whether multi-step lookahead can change the threshold decision. If the learned threshold readout is approximately a nonnegative left eigenvector of the transition matrix, use the current state only; otherwise activate predictive heads and search over a small horizon. This avoids unnecessary rollout computation while preserving early-warning behavior in oscillatory or rotating dynamics.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a one-step recurrent update with a causal convolution over past affine innovations using an exponential-fractional kernel. Add mean reversion and calibrate the innovation amplitude so that activation mean and variance remain approximately invariant across sequence position while retaining long-range, power-law-like memory.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace or augment a low-dimensional recurrent transition with affine maps whose linear parts belong to a structured unipotent holonomy family, and train the cell so that positive accumulated translation produces a controlled projective attractor. This creates a measurable two-basin long-horizon behavior: hidden-state perturbation directions should align with a learned direction X or its antipode according to the sign of a scalar functional, rather than exhibiting unconstrained rotation or…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Give a shared neural dynamical state multiple local readout operators, such as a site channel and a neighboring-pair channel, and measure their space-time responses separately. Add a loss that encourages each channel to have its own dominant propagation velocity while constraining every channel to remain inside a common maximum-speed cone. This transfers the paper's result that spectroscopic selection rules reveal complementary dynamical pathways that are invisible in a single response function.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a scalar neural field on a bounded convex domain with a restricted half-Laplacian residual and an explicit strict-concavity barrier. The paper's theorem motivates requiring the learned potential to have negative-definite Hessian throughout the domain, while the nonlocal residual gives the model a global Cauchy-process-style inductive bias rather than only local smoothness.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a single Gaussian, Laplace, or Huber residual model with a conditional mixture containing an inlier component, a body component, and an explicit generalized-Pareto tail. The network learns both the prediction and the probability that an error belongs to the extreme tail, allowing rare large errors to be modeled without making the entire loss excessively sensitive to ordinary noise.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unrestricted GRU or attention-based history encoder with a fixed companion-form shift register driven by the current action and observation, followed by a learned nonlinear policy. The register stores a structured finite history, while a learned matrix or MLP readout maps that history to a control-relevant latent state. This should provide a cheaper and more interpretable memory mechanism for partially observed environments, especially when the relevant dynamics are approximately…
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Parameterize the time-dependent coefficients of a latent neural ODE in a Chebyshev system instead of an unconstrained neural network, and train the resulting Poincare residual to have a prescribed number of simple zeros. If the relevant Melnikov function belongs to a certified Chebyshev span, the model obtains an explicit upper bound on the number of isolated periodic latent trajectories and limits uncontrolled oscillatory behavior.
Useful5/10
Difficulty7/10
Novelty9/10
Unverified
2026
Apply the paper's augmented cusp-map construction to an implicit neural layer or recurrent equilibrium, treating selected weights, gains, or input statistics as bifurcation parameters. The scanner detects parameter values where an equilibrium loses uniqueness through a fold or cusp, allowing the model to avoid unstable regions or deliberately exploit controlled multistability. Unlike merely monitoring exploding gradients, it provides a local certificate based on residual size, inverse-Jacobian…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent a continuous-time neural dynamical system as a symbolic Markov chain over regions together with a positive learned roof function giving the time spent in each region. Weight local reconstruction and prediction errors by the predicted vector-field speed, following the paper's scaled Hölder coding relation, so that the model does not over-penalize arbitrarily small coordinate errors near equilibria. This produces a hybrid latent model with discrete long-range structure and continuous…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a spatiotemporal neural model with spectral penalties corresponding to several temporal-spatial scaling laws rather than using a single isotropic smoothness penalty. The model can remain spatially detailed while suppressing temporal oscillations, or learn the opposite preference when the data demand it.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a trajectory-level consistency constraint to a diffusion or Markov generative model by comparing the likelihood of each sampled path with the likelihood of its reversed path. The constraint uses the paper's sharp fluctuation floor to detect when a model produces too many strongly backward-looking trajectories or hides directional mismatch in a small number of extreme events. This is a regularizer and diagnostic for learned stochastic dynamics, not a replacement for the generative likelihood…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Constrain a neural vector field to vanish to order at least k at a designated anchor state c. The network predicts smooth coefficient functions, while a fixed degree-k monomial gate supplies the required vanishing behavior. This exactly enforces the equilibrium and suppresses all local drift terms below order k, potentially improving stability and extrapolation near known rest states.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a trajectory-level loss that matches the empirical distribution of consecutive velocity turning angles between observed and generated sequences. Because turning angles are unchanged by a common rotation of all coordinates, the model is forced to reproduce hidden anisotropic and temporally correlated motion without being given a fixed laboratory-frame orientation.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Equip a latent transition model with a near-identity polynomial coordinate transform that conjugates the nonlinear transition to a linear latent operator, at least locally around a reference state. Train the transform jointly with the dynamics using both the usual prediction loss and the paper's splitting/intertwining residual, so that multi-step prediction is performed partly in approximately linearised coordinates.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a softmax transition or mixture-of-experts router by probabilities obtained from squared amplitudes of an isometric latent transition. Each input state is mapped to an orthogonal latent subspace, and summing probability over the latent index produces the desired expert or next-state distribution. The latent amplitudes can retain information that would be destroyed by directly averaging expert outputs, while normalization is guaranteed by construction.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Regularize a neural predictor so that its temporal partial averages remain stable when evaluated over shrinking neighborhoods of nearby inputs. The paper's mechanism suggests controlling a temporal maximal envelope in an Orlicz space, rather than controlling only pointwise variance or an L2 norm; the expected threshold is logarithmic, with L log L for ordinary consecutive averages and L log^(q+1) L for q-logarithmically normalized averages.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a uniformly discretized recurrent or continuous-depth model with hybrid hidden-state dynamics: integrate a learned drift between event times, then apply a one-sided reflection update at each irregular observation or constraint event. The reflection prevents the hidden state from violating a lower obstacle, while the explicit jump decomposition avoids smearing abrupt information changes across many small residual steps.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Build a continuous-time neural dynamics module from scalar potential networks and their iterated Lie brackets instead of directly predicting an unrestricted vector field. Gradient primitives provide structured vector fields, while commutators add non-conservative and rotational directions; the paper proves that finite spans of such objects generate every smooth vector field on the stated compact manifold.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Insert a fixed or learnable complex coordinate stretch outside the region where a neural operator models the physical interaction, so outgoing waves are damped and resonant states become ordinary discrete eigenmodes on a finite grid. Train the network with eigenvalue or resolvent losses computed after the stretch, while preserving the physical field in the interior region.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train Fourier or state-space neural models by eliminating well-conditioned spectral modes first and retaining near-resonant modes until a later stage. The schedule is determined by the small-divisor geometry of a reference transport vector, with a cumulative Brjuno-like budget controlling how aggressively spectral corrections may be applied. This should prevent rare nearly resonant modes from producing disproportionately large gradients or unstable long-horizon rollouts.
Useful5/10
Difficulty5/10
Novelty8/10