arXiv · 2511.17772
Weighted Birkhoff Averages Accelerate Data-Driven Methods
Abstract
Many data-driven algorithms in dynamical systems rely on ergodic averages that converge painfully slowly. One simple idea changes this: taper the ends. Weighted Birkhoff averages can converge much faster (sometimes superpolynomially, even exponentially) and can be incorporated seamlessly into existing methods. We demonstrate this with five weighted algorithms: weighted Dynamic Mode Decomposition (wtDMD), weighted Extended DMD (wtEDMD), weighted Sparse Identification of Nonlinear Dynamics (wtSINDy), weighted spectral measure estimation, and weighted diffusion forecasting. Across examples ranging from fluid flows to El Ni\~no data, the message is clear: weighting costs nothing, is easy to implement, and often delivers markedly better results from the same data.
Explore related subjects
Keep this discovery
Maria Bou-Sakr-El-Tayar, Jason J. Bramburger, Matthew J. Colbrook. 2025-11-21. Weighted Birkhoff Averages Accelerate Data-Driven Methods. https://doi.org/10.1098/rspa.2025.0979
Cite the original work for its findings. Save a collection to share your selection of sources.