Streaming Compression of Scientific Data via weak-SINDy
Not on the map. Why?
Abstract (arXiv)
In this paper a streaming weak-SINDy algorithm is developed specifically for compressing streaming scientific data. The production of scientific data, either via simulation or experiments, is undergoing an stage of exponential growth, which makes data compression important and often necessary for storing and utilizing large scientific data sets. As opposed to classical "offline" compression algorithms that perform compression on a readily available data set, streaming compression algorithms compress data "online" while the data generated from simulation or experiments is still flowing through the system. This feature makes streaming compression algorithms well-suited for scientific data compression, where storing the full data set offline is often infeasible. This work proposes a new streaming compression algorithm, streaming weak-SINDy, which takes advantage of the underlying data characteristics during compression. The streaming weak-SINDy algorithm constructs feature matrices and target vectors in the online stage via a streaming integration method in a memory efficient manner. The feature matrices and target vectors are then used in the offline stage to build a model through a regression process that aims to recover equations that govern the evolution of the data. For compressing high-dimensional streaming data, we adopt a streaming proper orthogonal decomposition (POD) process to reduce the data dimension and then use the streaming weak-SINDy algorithm to compress the temporal data of the POD expansion. We propose modifications to the streaming weak-SINDy algorithm to accommodate the dynamically updated POD basis. By combining the built model from the streaming weak-SINDy algorithm and a small amount of data samples, the full data flow could be reconstructed accurately at a low memory cost, as shown in the numerical tests.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 7 of its 28 references that are in the map. First posted on arXiv 29 Aug 2023.
Builds on
7 of 28 references.
References · 7
- 2020Weak SINDy For Partial Differential Equationscited by 155
- 2017Online dynamic mode decomposition for time-varying systemscited by 23
- 2021Kernel Learning for Robust Dynamic Mode Decomposition: Linear and Nonlinear Disambiguation Optimization (LANDO)cited by 22
- 2021Reduced operator inference for nonlinear partial differential equationscited by 21
- 2022Online Weak-form Sparse Identification of Partial Differential Equationscited by 13
- 2019The Occupation Kernel Method for Nonlinear System Identificationcited by 11
- 2022Convergence of weak-SINDy Surrogate Modelscited by 11
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 2; 2026: 1.
6 papers.
- 2023Coarse-Graining Hamiltonian Systems Using WSINDycited by 11
- 2024Attention Based Machine Learning Methods for Data Reduction with Guaranteed Error Boundscited by 5
- 2024Machine Learning Techniques for Data Reduction of CFD Applicationscited by 2
- 2026Streaming Operator Inference for Model Reduction of Large-Scale Dynamical Systemscited by 2
- 2025Parameter-Aware Ensemble SINDy for Interpretable Symbolic SGS Closurecited by 0
- 2025From STLS to Projection-based Dictionary Selection in Sparse Regression for System Identificationcited by 0
- 2026Streaming Operator Inference for Model Reduction of Large-Scale Dynamical Systems17 Jan 2026
- 2025From STLS to Projection-based Dictionary Selection in Sparse Regression for System Identification16 Dec 2025
- 2025Parameter-Aware Ensemble SINDy for Interpretable Symbolic SGS Closure13 Aug 2025
- 2024Attention Based Machine Learning Methods for Data Reduction with Guaranteed Error Bounds9 Sep 2024
- 2024Machine Learning Techniques for Data Reduction of CFD Applications28 Apr 2024
- 2023Coarse-Graining Hamiltonian Systems Using WSINDy9 Oct 2023