Parametric dynamical systems supply a rare benchmark with analytic ground truth for weight-space methods, because bifurcation locations are known exactly. The paper extends JEPAWG—a joint-embedding hypernetwork originally developed for lattice field theories—to populations of forecasters trained across a grid of control parameters. Its core idea is to decode weights at unseen parameters and measure their parameter derivative $G(p) = \|\nabla_p \hat{\theta}(p)\|_F$, treating this response as an interpretable probe of local and global bifurcations. The work matters because it offers a falsifiable testbed for reading physical structure directly from the geometry of trained network weights.

Neural emulation need not require learning a substitute for known physics. This paper investigates PolyNets that compile continuous-time polynomial dynamics and discrete-time RK4 integration into a single tensor graph, benchmarking the approach on the 1D Korteweg–de Vries equation against classical CPU/GPU solvers and three trained neural models. The central finding is that when governing coefficients are known, the resulting network requires no training yet preserves numerical fidelity while achieving competitive GPU throughput.

This paper addresses the challenge of learning minimal, interpretable piecewise-linear representations of unknown nonlinear dynamical systems from time-series data. The authors propose training a higher-capacity almost-linear RNN first, then hierarchically reducing it via a fixed-point-guided procedure that linearizes redundant ReLU units while preserving distinct fixed-point symbols, and finally retraining the compact model from the parent initialization. The central insight is that redundant nonlinear capacity can act as a structural and optimization scaffold for discovering reliable minimal models, which matters because directly training at the theoretical minimal capacity often fails catastrophically.