# Robust and scalable methods for the dynamic mode decomposition

arXiv: https://arxiv.org/abs/1712.01883 · HTML: https://mlsanity.com/paper/1712.01883/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Dec 2017.

## Built on by (most cited first, 2 of 2)

- [Sparse-mode Dynamic Mode Decomposition for Disambiguating Local and Global Structures](https://mlsanity.com/paper/2507.19787/) (2025)
- [An Interpretable Data-Driven Model of the Flight Dynamics of Hawks](https://mlsanity.com/paper/2602.19196/) (2026)

## Abstract (arXiv)

The dynamic mode decomposition (DMD) is a broadly applicable dimensionality reduction algorithm that approximates a matrix containing time-series data by the outer product of a matrix of exponentials, representing Fourier-like time dynamics, and a matrix of coefficients, representing spatial structures. This interpretable spatio-temporal decomposition is commonly computed using linear algebraic techniques in its simplest formulation or a nonlinear optimization procedure within the variable projection framework. For data with sparse outliers or data which are not well-represented by exponentials in time, the standard Frobenius norm fit of the data 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 PCA. As an alternative, we propose a framework and a set of algorithms for incorporating robust features into the nonlinear optimization used to compute the DMD itself. The algorithms presented are flexible, allowing for regu- larizers and constraints on the optimization, and scalable, using a stochastic approach to decrease the computational cost for data in high dimensional space. Both synthetic and real data examples are provided.