cd /news/machine-learning/dynamics-aware-identification-of-gov… · home topics machine-learning article
[ARTICLE · art-84265] src=machinebrief.com ↗ pub= topic=machine-learning verified=true sentiment=· neutral

Dynamics-aware identification of governing equations from sparse and noisy data

Researchers from the University of Washington evaluated Koopman-based upsampling techniques using dynamic mode decomposition (DMD), extended DMD (EDMD), and optimized DMD to improve sparse identification of nonlinear dynamics (SINDy) and PDE functional identification (PDE-FIND) from sparse and noisy data. In benchmarks on Lorenz-63, Van der Pol, Burgers, Fisher-KPP, and linear advection-diffusion systems, polynomial EDMD yielded the strongest ODE results, while DMD-assisted reconstructions improved Burgers and advection-diffusion discovery, though the raw baseline remained competitive for Fisher-KPP. The study concludes that Koopman-based upsampling serves as a dynamics-aware preprocessing step that can reduce derivative-estimation error when the observable representation and low-rank structure are appropriate.

read1 min views1 publishedAug 3, 2026

arXiv:2607.29036v1 Announce Type: new Abstract: Sparse identification of nonlinear dynamics (SINDy) and PDE functional identification (PDE-FIND) recover parsimonious ordinary and partial differential equations (ODEs and PDEs) from data. However, sparse and noisy temporal measurements can make derivative estimates unreliable. To address this problem, we evaluate Koopman-based upsampling techniques implemented with dynamic mode decomposition (DMD), extended DMD (EDMD), and optimized DMD. These methods learn finite-dimensional approximations of Koopman evolution on selected observables and are used to interpolate and denoise snapshots inside the observed time window before derivative estimation and sparse regression. The empirical benchmark comprises two ODE systems, Lorenz-63 and Van der Pol, and three periodic PDE systems, Burgers, Fisher-Kolmogorov-Petrovskii-Piskunov (Fisher-KPP), and linear advection-diffusion, over sparse and noisy sampling regimes. Polynomial EDMD gives the strongest ODE results, especially in coefficient accuracy. The PDE results are system-dependent: low-rank DMD-assisted reconstructions improve Burgers and advection-diffusion discovery, while the raw baseline (without upsampling) remains competitive for the Fisher-KPP data. A comparison against linear and smoothing-spline interpolation techniques shows that the selected Koopman-based preprocessors provide overall performance gains over these non-dynamical alternatives. We also demonstrate that DMD-assisted upsampling can stabilize Pareto-based non-oracle support-size selection. Overall, Koopman-based upsampling is best viewed as a dynamics-aware preprocessing step that can reduce derivative-estimation error when its observable representation and low-rank structure are appropriate for the data.

── more in #machine-learning 4 stories · sorted by recency
── more on @university of washington 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/dynamics-aware-ident…] indexed:0 read:1min 2026-08-03 ·