Second-order consistency for learning chaotic dynamics via randomized Jacobian matching

The paper introduces a method called model‑constrained randomized Jacobian matching to enforce second‑order consistency when learning chaotic dynamical systems. By comparing Jacobians at randomly perturbed inputs, the approach implicitly penalises Hessian mismatch without computing full Hessian tensors, achieving $O(d^2)$ memory cost. Experiments on Lorenz 63 and Lorenz 96 show that this second‑order supervision reduces invariant‑measure error, improves Lyapunov‑spectrum accuracy, and avoids spurious attractors that plague first‑order methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.