Name
Abstract | ||
|---|---|---|
The dynamic mode decomposition (DMD) is a broadly applicable dimensionality reduction algorithm that decomposes a matrix of time-series data into a product of a matrix of exponentials, representing Fourier-like time dynamics, and a matrix of coefficients, representing spatial structures. This interpretable spatio-temp oral decomposition is classically formulated as a nonlinear least squares problem and solved within the variable projection framework. When the data contains outliers, or other features that are not well represented by exponentials in time, the standard Frobenius norm misfit penalty creates significant biases in the recovered time dynamics. As a result, practitioners are left to clean such defects from the data manually or to use a black-box cleaning approach like robust principal component analysis (PCA). As an alternative, we propose a robust statistical framework for the optimization used to compute the DMD itself. We also develop variable projection algorithms for these new formulations, which allow for regularizers and constraints on the decomposition parameters. Finally, we develop a scalable version of the algorithm by combining the structure of the variable projection framework with the stochastic variance reduction (SVRG) paradigm. The approach is tested on a range of synthetic examples, and the methods are implemented in an open source software package RobustDMD. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1137/21M1417405 | SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS |
Keywords | DocType | Volume |
robust statistics, dynamic mode decomposition, scalable algorithms | Journal | 21 |
Issue | ISSN | Citations |
1 | 1536-0040 | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Travis Askham | 1 | 12 | 3.40 |
| Peng Zheng | 2 | 0 | 0.34 |
| Aleksandr Y. Aravkin | 3 | 252 | 32.68 |
| J. Nathan Kutz | 4 | 225 | 47.13 |