Unverified
2026
Replace an unconstrained recurrent hidden-state channel with a two-dimensional oscillator constrained to the supercritical Hopf normal form. A learned control parameter can place the channel below threshold for decaying dynamics or above threshold for sustained periodic dynamics, while the cubic term bounds the amplitude and prevents recurrent-state explosion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Treat groups of neural-network states or experts as metastable sectors and estimate both sector imbalance and inter-sector connectivity from minibatch routing or trajectory transitions. At balanced sector usage, the effective two-sector spectral splitting becomes a direct estimate of connectivity: a large splitting indicates that the sectors are still strongly communicating, whereas a small splitting indicates genuine specialization or incipient collapse into disconnected modes.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a static MoE load-balancing penalty with a two-stage capacity allocator. First compute each expert's technically feasible token capacity from latency, memory, and overflow constraints; then redistribute capacity using cumulative proportional fairness so experts that were repeatedly under-served receive more capacity later. Constrain the redistribution by an explicit efficiency budget, so fairness cannot silently cause an uncontrolled increase in routing loss or expert compute.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
For a neural dynamical predictor, train or maintain several independently initialized models and aggregate their multi-step states using the signed displacement along the locally unstable forecast direction. The key mechanism is cancellation of opposite unstable-manifold errors: ordinary averaging should reduce this component at rate N^{-1/2} when errors are independent and centered, while robust aggregation should be activated when validation residuals show heavy tails or persistent bias.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's product-matched uniform cycle as a tractable spectral envelope for a cyclic recurrent or state-space layer. Instead of estimating the full nonnormal generator spectrum at every update, compute its forward and backward rate products and constrain each complex eigenmode to remain inside the corresponding comparison-cycle frequency bound.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
For a learned control-affine latent dynamics model, replace the ordinary reciprocal barrier 1/h₀(z) with B(z) = s(z)/h₀(z), where h₀ is the physical safety margin and s is positive but depends on a velocity-like quantity whose derivative is directly affected by the action. This preserves the singularity at h₀ = 0 while giving the policy or safety projection layer first-order action authority over the barrier derivative.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a uniformly time-stepped neural ODE or state-space layer with a finite set of neural dynamical modes and an event scheduler. The hidden state follows the smooth flow of the current mode until a learned guard function crosses zero, at which point the solver evaluates the state at the event, switches mode, and continues with the new dynamics; this avoids numerical smearing of hard routing, thresholding, and switching behavior.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the single backpropagated subgradient of a piecewise-smooth network loss by a minimum-norm convex combination of gradients evaluated at nearby parameter perturbations. Shrink the perturbation radius geometrically and restart the schedule when the sampled Goldstein direction becomes small, following the paper's INGD motivation.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use a learned dividing surface between two modes or basins of a neural energy model, and regulate Langevin or diffusion noise using the measured one-way crossing flux. The surface should be aligned with an estimated saddle direction and should reject immediate recrossings, so the controller responds to genuine mode transitions rather than local oscillations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add two scalar adaptive gains to a neural controller or learned dynamical model: one estimates the unknown norm of the ideal neural approximation weights, and the other estimates the combined approximation, friction, and disturbance envelope. Sigma modification prevents unbounded gain growth, while the robust residual correction uses only these scalar estimates, independent of the number of neural features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a small controller to choose the next integration step size in a learned dynamical model using only deviations of conserved or slowly varying quantities. Unlike standard local adaptive solvers, optimize the complete rollout objective, allowing a later coarse step to compensate for an earlier discretization error. The controller can reduce the number of model evaluations while preserving long-horizon behavior.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense unconstrained channel-mixing matrix with a differentiable product of exponentials of a few skew-symmetric generators and their iterated commutators. The resulting layer is exactly orthogonal, preserves feature norms, and can express rotations in directions not explicitly stored as independent parameters. This is especially suitable for residual MLP blocks, recurrent state transitions, and networks processing rotation- or pose-valued features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a stable linear latent state-space block whose controllability Gramian is trained toward a chosen positive-definite target using squared Bures–Wasserstein distance. Direction-specific semidefinite constraints can suppress disturbance amplification in nuisance coordinates while preserving controllability in coordinates needed for prediction.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained multiscale residual block by the sum of a fractional diffusion branch and a drift or transport branch whose strength follows the PDE scaling law. At finer spatial scales, the drift coefficient is multiplied by R^{2s-1}; this suppresses unstable transport when s>1/2 while preserving equal-strength diffusion and drift at the critical value s=1/2.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the generic nonlinear drift in a two-dimensional continuous-time recurrent cell by a learnable piecewise-linear Lienard restoring force. Fold breakpoints and jump breakpoints become explicit architectural controls for creating multiple oscillatory attractors, allowing hidden states to encode phase, mode, or periodic memory. Weak input coupling can select or perturb attractors while preserving the autonomous cycle structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Add a Renyi divergence penalty between the current network output distribution and a frozen reference distribution representing the pretrained model, a teacher, or a retained-data equilibrium. The Renyi order k becomes a control parameter: k greater than 1 strongly penalizes examples on which the new model assigns disproportionately more probability than the reference, while orders below 1 emphasize support mismatch and low-probability regions. Sweep or anneal k and detect a transition between…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Construct a recurrent or state-space layer whose equilibrium Jacobian is placed near a nondegenerate Bogdanov–Takens point, then use a small unfolding parameter to move between damped, oscillatory, and slowly relaxing regimes. Unlike eigenvalue-only initialization near one, this controls both the double-zero center structure and the quadratic nonlinear coefficients that determine the local phase portrait.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Partition a long integration interval into M short segments and assign one neural trajectory approximator to each segment. Instead of asking a single network to satisfy the ODE and initial condition over the entire horizon, construct every segment so that its value at the left boundary is exactly the terminal value predicted by the previous segment. This removes interface discontinuities from the optimization problem and should improve long-horizon trajectory accuracy and gradient stability.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Constrain a low-dimensional neural state-space model so that its vector-field Hessian approximately satisfies the paper's Pascal-Hessian condition. Combine the resulting latent dynamics with an observer correction driven by the prediction residual, giving a model whose hidden-state estimation error can be assigned a desired linear decay rate.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a Jacobian cone-field regularizer to recurrent dynamics so that tangent directions expand and remain aligned with an unstable cone outside a designated critical neighborhood. The network is not forced to be uniformly expanding: the regularizer is disabled near the critical set, allowing controlled bifurcation-like behavior while exposing where long-horizon sensitivity changes.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Approximate anisotropic diffusion in a neural operator by composing several ordered local propagation steps rather than learning one unrestricted dense attention matrix. Each directional step uses its own ordering function and bandwidth, and symmetric composition reduces the leading splitting error.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the localization theorem to turn a detected pointwise simulator error into a guaranteed region that must contain similarly large error, then place verification samples inside that region instead of sampling uniformly. The same bound can guide a training regularizer: errors with large amplitude and large local Lipschitz constants are penalized because they create planner-exploitable disagreement regions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Apply a set-oriented graph analysis to the latent state dynamics of an RNN, SSM, or world model. Partition latent trajectories into compact cells, estimate the multivalued transition graph and its Markov matrix, then regularize the model so that recurrent latent modes form coherent strongly connected components with controlled transition entropy rather than spurious unstable wandering. This preserves meaningful metastable modes while preventing long-horizon rollout statistics from drifting away…
Useful6/10
Difficulty5/10
Novelty7/10