ML: Dynamics

Machine-learning ideas tagged Dynamics in the ML taxonomy of the Math2NN corpus.

△ Mechanism confirmed, baseline not beaten 2026

Unconditionally Positive Gain-Loss Neural ODE

Replace an unconstrained Neural ODE vector field with nonnegative production and destruction networks and discretize the resulting dynamics by an NSFD rational update. The update remains nonnegative for every step size, allowing stable coarse-step training and inference without clipping, projection, or tiny adaptive solver steps.

Useful8/10
Difficulty4/10
Novelty7/10
Paper: Structure-Preserving Neural ODEs via Nonstandard Finite Difference Discretization arXiv:2607.10858
△ Mechanism confirmed, baseline not beaten 2026

Monotone Forced-Response Adapter

Separate a pretrained sequence model's passive prediction from the causal effect of an action, and learn only the latter with a compact monotone adapter. The adapter receives the current latent state and an action deviation, but its action-to-output Jacobian is constrained to have the physically correct sign, preventing intervention predictions that move opposite to the applied control.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: ThermoForce: A Physics-Structured Interventional World Model for Building HVAC Control arXiv:2607.03942
✗ Mechanism failed 2026

Nonlinear Laplacian Equilibrium GNN Layer

Replace several fixed message-passing layers with an implicit graph layer whose state is the solution of a nonlinear flow equilibrium. Learn monotone edge laws from endpoint features, solve for node potentials with damped chord-Newton steps, and use the resulting edge flows or potentials as the layer output. Monotonicity and the Laplacian Jacobian provide a principled stability mechanism while retaining sparse graph computation.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: NLF: A Resistor-Network Framework and Linear-Time Solver for Convex Network-Flow Equilibria arXiv:2607.02041
Unverified 2026

Hard Sequential Neural ODE Solver

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
Paper: Modeling of an ODE-constrained optimization problem describing tumor dynamics, and numerical approximation via sequential physics-informed neural networks arXiv:2608.18974
✗ Mechanism failed 2026

Chebyshev-Stabilized SDIRK Neural ODE

Replace explicit RK integration in a stiff neural ODE or continuous-depth residual network with the paper's stiffly accurate SDIRK4 discretization. Instead of performing a dense Newton solve for each implicit stage, solve the diagonal stage equation using a Chebyshev-accelerated residual iteration whose polynomial damps the negative, high-magnitude Jacobian modes responsible for stiffness.

Useful6/10
Difficulty7/10
Novelty7/10
Paper: Explicit stabilized implementation of singly diagonally implicit Runge-Kutta methods arXiv:2607.07497