April 02, 2024

Dynamic Mode Decomposition (DMD) is a widely used data-driven algorithm for estimating the Koopman Operator. This paper investigates how the estimation process is affected when the data is quantized. Specifically, we examine the fundamental connection
between estimates of the operator obtained from unquantized data and those from quantized data. Furthermore, using the law of large numbers, we demonstrate that, under a *large data regime*, the quantized estimate can be considered a regularized
version of the unquantized estimate. This key theoretical finding paves the way to accurately recover the unquantized estimate from quantized data. We also explore the relationship between the two estimates in the *finite data regime*. The theory is
validated through repeated numerical experiments conducted on three different dynamical systems.

Koopman operator theory has found widespread applications in various fields such as fluid mechanics [1], plasma dynamics [2], control systems [3], unmanned aircraft systems [4], and traffic prediction [5]. In addition, it is also being used for machine learning tasks and training deep neural networks [6]. One area of active research is the finite-dimensional estimation of the Koopman operator using data-driven methods. Extended Dynamic Mode Decomposition (EDMD) is a prominent data-driven estimation technique that involves solving a least-square problem using data snapshots from the dynamical system [7]. It is well-understood that the quality of the Koopman operator estimate improves/degrades with an increase/decrease in the amount of data, as expected [8]–[10]. On the other hand, it is not clear how the quality of the data affects the estimation process.

Researchers has primarily focused on developing new data-driven methods or improving the existing ones for estimating the Koopman operator. It has been implicitly assumed that the systems implementing these algorithms have ample resources for handling large datasets, which becomes a significant concern when these data-intensive algorithms are implemented on resource limited systems, such as low-powered light-weight robotics applications [11], [12]. While implementing these methods on to systems with limited physical resources (e.g., memory, bandwidth etc.), we may need to suitably modify them in a resource-aware fashion to make them compatible with the underlying hardware and resource constraints. These resource constraints may necessitate the data to be quantized, where the qunatization resolution depends on the available resources.

Quantization is a natural remedy to communication constraints in practical implementations. This is particularly applicable to cyber-physical-systems, multi-agent systems, and networked control systems where communication among systems/components are necessary to receive data from distributed sensors. Other systems may themselves deploy a low data-length hardware where the data is quantized due to the computational limitations [13]–[15]. Therefore, it is natural to ask how the quantization process (i.e., the quality of the data) affects the estimation quality of the Koopman operator. Furthermore, one might also ask if there are any quantization schemes that are particularly suitable in this context.

To that end, we study the effects of *dither quantization* [16] – a highly effective and widely used quantization scheme in
communications and signal processing – on the EDMD method. The contributions of this work are: (1) We address the fundamental question of whether and how one may recover the original solution (i.e., the one obtained from unquantized data) even with
quantized data. Using the law of large numbers, we prove in that the estimation under quantized data is equivalent to a regularized estimation under the unquantized data, when we have a large number of data snapshots. We show the connection between the
regularization parameter and the quantization resolution. (2) We then further investigate this connection inn the small data regime as well. In that case also, we are able to analytically show how the difference between the estimates depends on the
quantization resolution. (3) We validate our theory on three different systems with repeated experimentation under different quantization resolutions.

The rest of the paper is organized as follows: We provide necessary background materials on Koopman Operator theory, Dynamic Mode Decomposition, and Dither Quantization in . We define our problem statement and research objectives in . We analyze the dither quantized dynamic mode decomposition (DQDMD) in and demonstrate the connection between the solution obtained from DQDMD and the regular DMD/EDMD. We discuss our observations from implementing DQDMD on three dynamical systems in . Finally, we conclude the paper in .

*Notations:* The set of non-negative integers are denoted by \(\mathbb{N}_0\). For a matrix \(M\), we denote its Moore–Penrose inverse by \(M^{\dagger}\), its transpose by \(M^\top\), and hermitian transpose by \(M^*\). The Big-O notation is denoted by \(O(\cdot)\).

Consider a discrete-time dynamical system on a \(n\)-dimensional compact manifold \(\mathcal{M}\), evolving according to the flow-map \({f}:\mathcal{M}\mapsto
\mathcal{M}\) as follows: \[\label{Eq:32Dynamics} {x}_{t+1} = {f}({x}_{t}),\quad {x}_t\in\mathcal{M},\quad t\in\mathbb{N}_0.\tag{1}\] Let \(\mathcal{F}\) be a Banach space of complex-valued observables \(\varphi:\mathcal{M}\rightarrow \mathbb{C}\). The discrete-time *Koopman operator* \(\mathcal{K}:\mathcal{F}\rightarrow \mathcal{F}\) is defined as \[\mathcal{K}\circ\varphi(\cdot) = \varphi \circ {f}(\cdot),\quad \text{with}~~\varphi({x}_{t+1})=\mathcal{K}\varphi({x}_{t}),\]
where \(\mathcal{K}\) is infinite-dimensional, and linear over its argument. The scalar observables \(\varphi\) are referred to as the Koopman observables.

A Koopman eigenfunction \(\phi_i\) is a special observable that satisfies \((\mathcal{K}\phi_i)(\cdot)=\lambda_i \phi_i(\cdot)\), for some eigenvalue \(\lambda_i
\in \mathbb{C}\). Considering the Koopman eigenfunctions (i.e., \(\{\phi_i\}_{i \in \mathbb{N}}\)) span the Koopman observables, any vector valued observable \({g}\in\mathcal{F}^p=[\varphi_1,~\varphi_2,~\ldots,~\varphi_p]^\top\) can be expressed as a sum of Koopman eigenfunctions \({g}(\cdot)=\sum_{i=1}^{\infty}\phi_i(\cdot){v}^{{g}}_i\), where \({v}^{{g}}_i\in\mathbb{R}^p, i=1,2,\ldots,\) are called the *Koopman modes* of the observable \(g(\cdot)\). This modal decomposition provides the growth/decay rate \(|\lambda_i|\) and frequency \(\angle{\lambda_i}\) of different Koopman modes via its time evolution: \[\label{eq:koop95decomp} {g}({x}_t) = \sum_{i=1}^{\infty}\lambda_i^t\phi_i({x}_0){v}^{{g}}_i.\tag{2}\] The Koopman eigenvalues (\(\lambda_i\)) and eigenfunctions (\(\phi_i\)) are properties of the dynamics only, whereas the Koopman modes (\(v^i_g\)) depend on the observable (\(g\)).

Several methods have also been developed to compute the Koopman modal decomposition, e.g., DMD and EDMD [7], [17], Ulam-Galerkin methods, and deep neural networks [18], [19]. In this work, we focus on the EDMD method, which is briefly described below.

DMD is a data-driven method for extracting temporal feature from a sequence of time-series data using matrix factorization. Initially, DMD was introduced within the fluid dynamics community as a means of extracting spatiotemporal coherent structures from intricate flows [17]. Subsequently, it was demonstrated that the spatiotemporal modes derived through DMD exhibit convergence to the Koopman modes when applied to a specific set of linear observables [1]. This characteristic of the DMD has made it a primary computational tool for Koopman theory. DMD assumes that state variables themselves serve as the set of observables \(g(x) = x \in \mathbb{R}^n\) [1]. DMD requires a pair of snapshot matrices in order to generate a linear model approximating the desired dynamical system. They are created by sampling the state variables \(x\in\mathbb{\mathbb{R}}^n\) at a sequence of time instants (snapshots) and concatenating them to form snapshot matrices \(\mathbf{X} \in \mathbb{R}^{n\times T}\) and \(\mathbf{X}' \in \mathbb{R}^{n\times T}\), where \(\mathbf{X}'\) is one time snapshot ahead of the original snapshot matrix \(\mathbf{X}\), i.e., \[\begin{align} \mathbf{X} = \begin{bmatrix} {x}_0 & ... & {x}_{T-1}\\ \end{bmatrix}, \quad \mathbf{X}' = \begin{bmatrix}\label{eq:dmd95snap95mat} {x}_{1} & ... & {x}_{T}\\ \end{bmatrix}. \end{align}\tag{3}\] The DMD algorithm aims to find the best linear operator \(\mathcal{K}_{\rm DMD}\) that relates the two snapshot matrices \(\mathbf{X}\) and \(\mathbf{X}'\) in a least-square sense, i.e., \[\begin{align} \label{eq:dmd95linear95fit} \mathbf{X}' &\approx {\mathcal{K}_{\rm DMD}}\mathbf{X}, \end{align}\tag{4}\] where \(\mathcal{K}_{\rm DMD}=\mathop{\mathrm{\arg\!\min}}_{A\in\mathbb{R}^{n\times n}}\|\mathbf{X}' - {A}\mathbf{X}\|^2\). The algorithm efficiently extracts the eigenvalues and Koopman modes of the Koopman operator by determining the eigenvalues and eigenvectors of \(\mathcal{K}_{\rm DMD}\). The \(\mathcal{K}_{\rm DMD}\) matrix represents the Koopman operator in the newly mapped linear space of finite-dimensional observables. DMD is performed by computing the singular-value decomposition (SVD) of \(\mathbf{X}\), and then it is used for the prediction of \(x_t\): \[\begin{align} \label{Eq:32DMD} \begin{aligned} \mathbf{X} &= U {\Sigma} {V}^{*} \\ \mathcal{K}_{\rm DMD}&= \mathbf{X}' \mathbf{X}^{\dagger} = \mathbf{X}' {V} \Sigma^{-1 } {U}^{*} \\ \hat{x}_t &= (\mathcal{K}_{\rm DMD})^t x_0, \end{aligned} \end{align}\tag{5}\] where \(U, \Sigma\) and \(V\) are found from performing SVD on the data matrix \(\mathbf{X}\).

** Remark 1**. *When the data matrix \(\mathbf{X}\) has full row rank, \(\mathbf{X}^\dagger\) has the closed form expression \(\mathbf{X}^\top
(\mathbf{X}\mathbf{X}^\top)^{-1}\). In that case, we may write \(\mathcal{K}_{\rm DMD}= \mathbf{X}' \mathbf{X}^\top (\mathbf{X}\mathbf{X}^\top)^{-1}\).*

Since the singular-values decay rapidly, first \(r\) significant singular-values of \(\mathbf{X}\) can be used for computing a reduced-order matrix \(\mathcal{K}_{{\rm DMD}, r}\in \mathbb{R}^{n\times n}\) by projecting \(\mathcal{K}_{\rm DMD}\) to a lower \(r\)-dimnesional space as follows: \[\begin{align} \label{Eq:32ReducedDMD} \begin{aligned} \mathbf{X} &= U {\Sigma} {V}^{*} \approx {U}_r {\Sigma}_r {V}^{*}_r\\ \mathcal{K}_{\rm DMD}&= \mathbf{X}' {V}_r \Sigma_r^{-1 } {U}_r^{*} \\ \mathcal{K}_{{\rm DMD}, r}&= U_r^* \mathcal{K}_{\rm DMD}U_r = U_r^*\mathbf{X}' {V}_r \Sigma_r^{-1 } \end{aligned} \end{align}\tag{6}\] We project \(\mathcal{K}_{{\rm DMD}, r}\) back to the full dimension \(n\) by constructing a matrix \(\Upsilon\), which then can be used to predict the state: \[\begin{align} \label{eq:ReducedOrderPrediction} \begin{aligned} \Upsilon &= \mathbf{X}'V_r\Sigma_r^{-1}W\\ \hat{x}_t &= \Upsilon \Lambda^t \Upsilon^{\dagger}x_0, \end{aligned} \end{align}\tag{7}\] where \(W\) and \(\Lambda\) can be found from \(\mathcal{K}_{{\rm DMD}, r}\) via its eigendecomposition \(\mathcal{K}_{{\rm DMD}, r}= W\Lambda W^{-1}\).

The algorithm 5 or 6 is extended [7] to a use a set of observables or dictionary functions \(\varphi(\cdot) = [\varphi^1(\cdot),\ldots,\varphi^N(\cdot)]^T: \mathcal{M} \mapsto \mathbb{C}^N\). We again define data matrices \(\Phi, \Phi' \in \mathbb{R}^{N \times T}\) such that \[\begin{align} \label{eq:dataMatrix} \begin{aligned} \Phi &= \begin{bmatrix} \varphi(x_0) ~ \varphi(x_1) ~ \ldots ~ \varphi(x_{T-1}) \end{bmatrix}, \\ \Phi' &= \begin{bmatrix} \varphi(x_1) ~ \varphi(x_2) ~ \ldots ~ \varphi(x_{T}) \end{bmatrix} . \end{aligned} \end{align}\tag{8}\] Now \(\Phi'\approx \mathcal{K}_{\rm DMD}\Phi\) is assumed and the same SVD-based methods are utilized to identify \(\mathcal{K}_{\rm DMD}\) or \(\mathcal{K}_{{\rm DMD}, r}\), yielding the Extended Dynamic Mode Decomposition (EDMD).

** Remark 2**. *Note that DMD is a special case of EDMD where \(N=n\) and \(\varphi^i(x)=x^i,\,i \in\{1,\ldots,n\}\), and \(x^i\) is the \(i^{\text{th}}\) component of \(x\).*

A quantizer \(q :(u_{\min},u_{\max})\subseteq \mathbb{R}\to \{0,\ldots, (2^b-1)\}\) is a function that maps any \(x\in (u_{\min},u_{\max}) \subset \mathbb{R}\) to a \(b\)-bit binary word. For example, a uniform quantizer takes the form \[\begin{align} q(x)=\left\lfloor\frac{x-u_{\min}}{\epsilon} \right\rfloor,
\end{align}\] where \[\begin{align} \label{eq:quantizationResolution} \epsilon=\frac{u_{\max}-u_{\min}}{2^b}
\end{align}\tag{9}\] denotes the quantization resolution. Although \(q(\cdot)\) is defined on the interval \((u_{\min},u_{\max})\), one may extend the definition of \(q(\cdot)\) on the entire real line as follows: \[\begin{align} \bar{q}(x)=\begin{cases} q(x),\quad &x\in (u_{\min},u_{\max}),\\ 0, & x\le u_{\min},\\ 2^b-1, & x\ge u_{\max}, \end{cases}
\end{align}\] where \(\bar q(\cdot)\) is the extended version of \(q(\cdot)\). The region outside the interval \([u_{\min},u_{\max}]\) is the
*saturation* region of the quantizer \(\bar{q}\).

The decoding of a mid-point uniform quantizer is performed by \[\begin{align} \mathcal{Q}(x) =\epsilon q(x) + u_{\min} + \frac{\epsilon}{2}.
\end{align}\] The quantization error is defined to be \(e(x) = \mathcal{Q}(x) - x\). For all \(x\in (u_{\min}, u_{\max})\), we have \(|e(x)| \le
\frac{\epsilon}{2}\). The distribution of the quatization error plays an important role in analyzing the performance of a system employing quantization. The distribution of this error is correlated with the distribution of the source signal \(x\). This correlation often results in poor performance, besides making the analysis of such systems complicated. It has been well-established that dither quantization leads to a better performance, as demonstrated in the very
first work on TV communication [20] as well as in applications to controls [21]. Since then, a significant amount of research has been devoted in *dither* quantization.

*Dither* quantization prescribes adding a noise \(w\) to the source signal \(x\) prior to quantization and subtract that noise during decoding [16], which yields the decoded signal to be \(\mathcal{Q}(x+w) - w\). Thus, the quantization error becomes \[\begin{align} e(x) = \mathcal{Q}(x+w) - w - x.
\end{align}\] Under certain assumptions on the distribution of \(w\), it can be shown that this new error \(e(x)\) is distributionally independent of the source \(x\). Furthermore, this error can be shown to have a uniform distribution in \([-\frac{\epsilon}{2}, \frac{\epsilon}{2}]\). A typical choice of \(w\) is to
consider an uniformly distributed random variable with support \([-\frac{\epsilon}{2}, \frac{\epsilon}{2}]\), which satisfies all the necessary and sufficient conditions to ensure that \(e\)
is independent of \(x\) and uniformly distributed in \([-\frac{\epsilon}{2}, \frac{\epsilon}{2}]\); see [16]. Throughout this work, we will consider the *dither* quantization scheme.

When \(x\) is a vector, we perform the quantization and the decoding component-wise. For quantizing a time-varying vector-valued process \(\{x_t\}_{t\ge 0}\), we will consider a
time-varying vector-valued i.i.d process \(\{w_t\}_{t\ge 0}\) as the *dither* signal. Furthermore, in the subsequent sections we will use \(\mathcal{Q}^w(x)\) as a shorthand notation
for \(\mathcal{Q}(x+w)\).

Our objective in this exploratory work is to understand the effects of quantization on the estimated Koopman operator. To that end, we assume that we have access to quantized observables, i.e., \(\tilde{\varphi}^i(\cdot) = \mathcal{Q}^w\circ \varphi^i (\cdot)\) for \(i = 1,\ldots, N\), where \(\mathcal{Q}^w(\cdot)\) is the dither quantization-decoding operator. Hence, for time instance \(t\), the available data is \[\begin{align} \label{eq:tildeObservables} \tilde{\varphi}(x_t) = \begin{bmatrix} \mathcal{Q}^w(\varphi^1(x_t)) - w^1_t \\ \vdots\\ \mathcal{Q}^w(\varphi^n(x_t)) - w^n_t \end{bmatrix}, \end{align}\tag{10}\] where \(w^i_t\) is the dither signal used during the quantization of the \(i\)-th observable of time \(t\), and \(\mathcal{Q}^w(\varphi^i(x_t)) = \mathcal{Q}(\varphi^i(x_t) + w^i_t)\) for all \(i = 1, \ldots, N\) and \(t = 0,\ldots, T\).

Let \(\tilde{\mathcal{K}}_{\rm DMD}\) denote the estimate of the Koopman operator obtained from the quantized data. That is, \[\begin{align} \label{eq:EDMD95quantized} \tilde{\mathcal{K}}_{\rm DMD}= \mathop{\mathrm{\arg\!\min}}_{A \in \mathbb{R}^{N \times N}} \| \tilde{\Phi}' - A \tilde{\Phi}\|^2, \end{align}\tag{11}\] where \[\begin{align} \tilde{\Phi} &= \begin{bmatrix} \tilde{\varphi}(x_0) ~ \tilde{\varphi}(x_1) ~ \ldots ~ \tilde{\varphi}(x_{T-1}) \end{bmatrix}, \\ \tilde{\Phi}' &= \begin{bmatrix} \tilde{\varphi}(x_1) ~ \tilde{\varphi}(x_2) ~ \ldots ~ \tilde{\varphi}(x_{T}) \end{bmatrix} , \end{align}\] and where \(\tilde{\varphi}(\cdot)\) is defined in 10 . On the other hand, the estimate obtained from the unquantized data is \[\begin{align} \label{eq:EDMD} \mathcal{K}_{\rm DMD}= \mathop{\mathrm{\arg\!\min}}_{A \in \mathbb{R}^{N \times N}} \| \Phi' - A \Phi\|^2, \end{align}\tag{12}\] where \(\Phi, \Phi' \in \mathbb{R}^{N \times T}\) are the data matrices defined in 8 .

Having obtained the matrices \(\mathcal{K}_{\rm DMD}\) and \(\tilde{\mathcal{K}}_{\rm DMD}\) (or, their reduced order versions), we may predict the state using 5 (or, using 6 and 7 ). In this work, we investigate the normalized estimation errors for both full and reduced order Koopman operators, as well as we are interested in the prediction error of the reduced order model. That is, we quantify how \(\frac{\| \mathcal{K}_{\rm DMD}- \tilde{\mathcal{K}}_{\rm DMD}\|}{\|\mathcal{K}_{\rm DMD}\|}\), \(\frac{\|\mathcal{K}_{{\rm DMD}, r}- \tilde{\mathcal{K}}_{{\rm DMD}, r}\|}{\|\mathcal{K}_{{\rm DMD}, r}\|}\), and \(\frac{1}{T}\sum_{t=0}^{T-1} \frac{\|\hat{x}_t - x_t \|}{\|x_t\|}\) change as we vary the word length for the quantization.

In addition to quantifying the degradation due to quantization using the three aforementioned metrics, we are also interested in developing a framework where one may obtain an improved estimate, \(\tilde{\mathcal{K}}_{\rm DMD}^*\), that is closer to \(\mathcal{K}_{\rm DMD}\) than \(\tilde{\mathcal{K}}_{\rm DMD}\) is. In this work we discuss such a potential method for the large data regime (i.e., when \(T\to \infty\)).

**Assumption 1**. *The observables are bounded functions. That is, for all \(i\) there exists \(\ell_i < u_i\) such that \(\ell_i \le
\varphi^i(x) \le u_i\) for all \(x\in \mathbb{R}^n\).*

A direct consequence of this assumption^{5} is that we may assume \(u_{\min} \le \varphi^i(x) \le u_{\max}\) for all \(i\). In case \(\varphi^i(\cdot)\) is not bounded in between \(u_{\min}\) and \(u_{\max}\), we may consider a shifted and scaled
version \(\bar\varphi^i(\cdot) = \frac{\varphi(\cdot) + s}{c}\) such that \(\bar\varphi^i(\cdot)\) satisfies , where the shift and scaling coefficients \(s,c \in
\mathbb{R}\) are chosen appropriately. From this point onward we will therefore use the following assumption (Assumption 1\('\)) in place of without any additional loss of generality.

**Assumption 1\('\).** *The observables satisfy \(u_{\min} \le \varphi^i(x) \le\) \(u_{\max}\) for all \(i\) and \(x\in \mathbb{R}^n\).*

The main result of this section is summarized in the following theorem.

**Theorem 1**. *For a large \(T\), \[\begin{align} \label{eq:equivalence} \begin{aligned} \tilde{\mathcal{K}}_{\rm DMD}&=
\mathop{\mathrm{\arg\!\min}}_{A \in \mathbb{R}^{N \times N}} \frac{1}{T} \| \tilde{\Phi}' - A \tilde{\Phi}\|^2 \\ &= \mathop{\mathrm{\arg\!\min}}_{A \in \mathbb{R}^{N \times N}} \frac{1}{T} \| \Phi' - A \Phi\|^2 + \frac{\epsilon^2}{12} \|A\|^2.
\end{aligned}
\end{align}\qquad{(1)}\] *

*Proof.* The proof is presented in . ◻

Theorem 1 states that the solution \(\tilde{\mathcal{K}}_{\rm DMD}\) can be interpreted as a solution to a regularized DMD problem, where the regularization parameter depends on the resolution of the quantizer \(\epsilon\). A consequence of is that the solution \(\tilde{\mathcal{K}}_{\rm DMD}\) converges to \(\mathcal{K}_{\rm DMD}\) as \(\epsilon\) approaches to \(0\). Recall from 9 that the quantization resolution \(\epsilon\) is coupled with the qunatization word length. Thus, as the number of bits \(b\) increases, we obtain \(\tilde{\mathcal{K}}_{\rm DMD}\to \mathcal{K}_{\rm DMD}\), as one would expect.

** Remark 3**. *shows the connection between \(\mathcal{K}_{\rm DMD}\) and \(\tilde{\mathcal{K}}_{\rm DMD}\) via the quantization resolution \(\epsilon\). It is to be noted that the relationship ?? holds because the quantization noises are i.i.d., which is due to the fact that dither quantization is being used. A similar conclusion may not hold for other forms of
quantization.*

** Remark 4**. *By solving the optimization on the r.h.s. of ?? , one obtains \[\begin{align} \label{eq:KDt} \tilde{\mathcal{K}}_{\rm DMD}= \Phi' \Phi^\top \left( \Phi \Phi^\top + \frac{T
\epsilon^2}{12} I \right)^{-1}.
\end{align}\qquad{(2)}\] In the unquantized case (i.e., \(\epsilon = 0\)), where the data matrix \(\Phi\) is rank deficient, one needs to use the Moore–Penrose inverse (see 5 ). However, the matrix \(\Phi \Phi^\top + \frac{T \epsilon^2}{12} I\) is always invertible, thus alleviating the need for computing any pseudo-inverse.*

not only helps in identifying the relationship between \(\mathcal{K}_{\rm DMD}\) and \(\tilde{\mathcal{K}}_{\rm DMD}\), but also provides a convenient framework to potentially recover \(\mathcal{K}_{\rm DMD}\) from the quantized data, as discussed later in .

So far we have characterized the connection between \(\mathcal{K}_{\rm DMD}\) and \(\tilde{\mathcal{K}}_{\rm DMD}\) in a large data setting, i.e., when \(T\) is large (theoretically, we need \(T\to \infty\)). Next, we discuss the relationship between \(\mathcal{K}_{\rm DMD}\) and \(\tilde{\mathcal{K}}_{\rm DMD}\) when \(T\) is finite and potentially small (i.e., fewer time snapshots). The main result of this section is presented in the following theorem.

**Theorem 2**. *Let \(\Phi\) and \(\tilde{\Phi}\) be of full row rank. Then, there exists a \(\mathcal{K}_\epsilon\) such that \(\|\mathcal{K}_\epsilon\| = O(\epsilon)\) and \[\begin{align} \tilde{\mathcal{K}}_{\rm DMD}= \mathcal{K}_{\rm DMD}+ \mathcal{K}_\epsilon.
\end{align}\]*

*Proof.* The proof is presented in .

◻

The condition that \(\Phi\) and \(\tilde{\Phi}\) have full row rank in is sufficient but not necessary. In fact, the proof may be extended without this condition through some tedious derivations. For the ease of the exposition, we do not delve into such details here and leave that discussion for a future work.

Similar to , here also we note that \(\tilde{\mathcal{K}}_{\rm DMD}\to \mathcal{K}_{\rm DMD}\) as \(\epsilon \to 0\), as one would expect. However, is a stronger result than since it holds true for any \(T\) whereas holds when \(T \to \infty\). The benefit of having a large \(T\) in previous sections is that we may potentially recover \(\mathcal{K}_{\rm DMD}\) even from the quantized data, as will be discussed in . On the other hand, we may not recover \(\mathcal{K}_{\rm DMD}\) from the quantized data since \(\mathcal{K}_\epsilon\) cannot be computed without having knowledge of the unquantized data matrix \(\Phi\).

It should be noted that \(\mathcal{K}_\epsilon\) depends on the realization of the dither noise, and therefore, it is a random matrix. We leave the investigation on the statistical properties of \(\mathcal{K}_\epsilon\) as a potential future work.

The effect of dither quantization on EDMD is demonstrated on three different systems: a simple pendulum with negative damping, Van der Pol oscillator, and fluid-flow past a cylinder.

A two dimensional oscillatory system with slight instability is considered as a first example. The dynamics of a simple pendulum with a destabilizing term is described as: \[\begin{align} \label{Eq:32Pendulum} \dot{x}_1 &=& x_2\nonumber\\ \dot{x}_2&=&0.01x_2-\sin x_1. \end{align}\tag{13}\] Since \(x\in\mathbb{R}^2\) is very low-dimensional, we choose Hankel delay-embedding as our EDMD dictionary, i.e., we stack up \(\varphi(x_t)\triangleq [x_t,\ldots,x_{t+m-1}]^\top \in\mathbb{R}^{2m}\) for \(t=0,\ldots,T-1\). The data is generated by solving the system for \(10^4\)s and it is sampled at an interval \(\Delta t = 0.1\)s. We used an embedding dimension of \(m=100\) and performed the DMD with dither quantization for \(50\) independent Monte-Carlo trials for training length \(T=500\). The relative 2-norm error \(\frac{\| \mathcal{K}_{\rm DMD}- \tilde{\mathcal{K}}_{\rm DMD}\|}{\|\mathcal{K}_{\rm DMD}\|}\) for full-order DMD matrix, \(\frac{\|\mathcal{K}_{{\rm DMD}, r}- \tilde{\mathcal{K}}_{{\rm DMD}, r}\|}{\|\mathcal{K}_{{\rm DMD}, r}\|}\) for reduced order DMD matrix, and the time-average relative two norm error \(\frac{1}{T}\sum_{t=0}^{T-1} \frac{\|\hat{x}_t - x_t \|}{\|x_t\|}\) between predictions using \(\tilde{\mathcal{K}}_{{\rm DMD}, r}\) and \(\mathcal{K}_{{\rm DMD}, r}\) are shown in Fig. 1.

We notice that the prediction error in Fig. 1 (c) decreases exponentially with the quantization word length. The trend is consistent in all the three subplots, where the average relative errors (shown by the red line segments) decrease with the word length. It is particularly interesting to see that a two-bit quantizer can provide an average normalized prediction error of less than 0.02.

Now, we consider the limit-cyclic Van der Pol oscillator: \[\begin{align} \label{Eq:32Vanderpol} \dot{x}_1 &=& x_2\nonumber\\ \dot{x}_2&=&(1-x_1^2)x_2-x_1, \end{align}\tag{14}\] with the same Hankel stacking \(m\), sampling interval \(\Delta t\), and training length \(T\) to form the data matrices. The relative error metrics for this example are shown in Fig. 2 for \(50\) independent Monte-Carlo trials. In this experiment too, we notice the same trend. The average normalized prediction error is of the order of \(10^{-3}\) even with two bits for quantization.

Flow past cylinder [22] is another common dynamical system used for benchmarking data-driven models [3], [23]. The simulation was carried out using MATLAB’s FEAtool [23]. A cylinder with a diameter of \(0.1\)m is located at a height of \(0.2\)m. The fluid is characterized by its density \(\rho=1\) Kg/m\(^3\), and dynamic viscosity \(\mu=0.001\) Kg/m s. The flow is unsteady with a maximum velocity of \(1\)m/s and mean velocity being \(\frac{2}{3}\) of the maximum velocity. The simulation is run for \(80\)s until the steady state is achieved, and the horizontal \(u\) component of the velocity is probed at every 0.02s starting from 20s. The complete dataset \(\Phi\in\mathbb{R}^{2647\times 3001}\) consists of 3001 time samples. More details regarding the simulation setup can be found in .

Due to a large number of states, we only perform the reduced order DMD on the quantized data for 30 independent realization of dither signal and report the error metrics \(\frac{\|\mathcal{K}_{{\rm DMD}, r}- \tilde{\mathcal{K}}_{{\rm DMD}, r}\|}{\|\mathcal{K}_{{\rm DMD}, r}\|}\) and \(\frac{1}{T}\sum_{t=0}^{T-1} \frac{\|\hat{x}_t - x_t \|}{\|x_t\|}\) in Fig. 3 for different word lengths

Here the normalized prediction error follows the same exponential trend with the available word length. However, the normalized matrix error metric \(\frac{\|\mathcal{K}_{{\rm DMD}, r}- \tilde{\mathcal{K}}_{{\rm DMD}, r}\|}{\|\mathcal{K}_{{\rm DMD}, r}\|}\) decreases at a slower rate. Also, for the 8-bit quantization, the existence of several outliers warrants larger number of Monte-Carlo runs in future. However, these outliers are in our favor since they all produced lower relative errors.

Whereas a regular DMD problem prescribes 11 , we propose the following regularized version in presence of quantization \[\begin{align} \label{eq:regularized95DMD} \tilde{\mathcal{K}}_{\rm DMD}^{\rm reg}= \mathop{\mathrm{\arg\!\min}}_{A} \| \tilde{\Phi}' - A \tilde{\Phi}\|^2 + \gamma \|A \|^2, \end{align}\tag{15}\] where \(\gamma \in \mathbb{R}\) is a regularization parameter. Our hypothesis is that, by appropriately choosing \(\gamma\), one may obtain an estimate \(\tilde{\mathcal{K}}_{\rm DMD}^{\rm reg}\) such that \(\tilde{\mathcal{K}}_{\rm DMD}^{\rm reg}\approx \mathcal{K}_{\rm DMD}\).

** Proposition 1**. *For a given quantization resolution \(\epsilon\), one may recover \(\mathcal{K}_{\rm DMD}\) from the dither quantized data, if the following regularized DMD is
solved for a large \(T\) \[\begin{align} \label{eq:prop1} \frac{1}{T}\| \tilde{\Phi}' - A \tilde{\Phi}\|^2 - \frac{\epsilon^2}{12} \|A \|^2.
\end{align}\qquad{(3)}\] *

*Proof.* From the proof of (see 19 ), we observe that, for a large enough \(T\), \[\begin{align} \frac{1}{T}\| \tilde{\Phi}' - A \tilde{\Phi}\|^2 =
\frac{1}{T} \| \Phi' - A \Phi\|^2 + \frac{\epsilon^2}{12}\|A\|^2 + \frac{N\epsilon^2}{12}.
\end{align}\] Therefore, \[\begin{align} & \mathop{\mathrm{\arg\!\min}}_A \frac{1}{T} \| \tilde{\Phi}' - A \tilde{\Phi}\|^2 - \frac{\epsilon^2}{12} \|A \|^2 \nonumber \\ & \qquad =
\mathop{\mathrm{\arg\!\min}}_A \frac{1}{T} \| \Phi' - A \Phi\|^2 + \frac{N\epsilon^2}{12} = \mathcal{K}_{\rm DMD}.
\end{align}\] This completes the proof. ◻

** Remark 5**. *When is deployed for recovering \(\mathcal{K}_{\rm DMD}\) from a finite amount of data, one must be cautious about the convexity of the optimization problem in ?? . In some cases, the problem may not
be convex due to the term \(- \frac{\epsilon^2}{12} \|A \|^2\) and thus the optimization becomes futile. In such cases, one may attempt to use a regularizer \(\gamma \in ( - \frac{\epsilon^2}{12},
0)\) to ensure convexity. A thorough investigation on recovering \(\mathcal{K}_{\rm DMD}\) from quantized data is still warranted.*

Another interesting avenue to pursue could be understanding the trade-off between the quality and quantity of the data. It has already been established that the estimation quality of the operator typically improves as the amount of (unquantized) data increases. In this work, we demonstrate that the estimation quality also improves with the word length of the quantization. A higher word length per quantized data implies a smaller amount of data can be processed (i.e., communicated). This, in turn, negatively affects the estimation quality while the higher quantization resolution is attempting to improve the estimation quality. Understanding this trade-off between quantity and quality of data would provide valuable insights for practical implementations under communication constraints.

In this work, for the very first time, we investigate the effects of dither quantization on EDMD. In a large data regime, we show that the EDMD optimization problem with quantized data may be interpreted as a regularized EDMD optimization with unquantized data. We leveraged the law of large numbers to prove our claim. We also investigated the connection between the estimates of the Koopman operator under quantized and unquantized data in a finite data regime. We show that the quantized estimates converge to the true estimate as the quantization resolutions approach zero.

The authors thank Indranil Nayak for generating the flow past cylinder data using MATLAB FEAtool.

In this section we provide some technical results that are used in the proof of Theorem 1. Although similar results may be derived from textbook knowledge, we provide these proofs for completeness.

** Lemma 1**. *Let \(e^i_t = \tilde{\varphi}^i(x_t) - \varphi^i(x_t)\) be the quantization error of the \(i\)-th observable at time step \(t\). Then,
\[\begin{align} \mathbb{E}[e^i_t e^j_s] = \begin{cases} \frac{\epsilon^2}{12}, \qquad i= j ~~\mathrm{and}~~ t =s,\\ 0, \qquad~~ \mathrm{otherwise}. \end{cases}
\end{align}\]*

*Proof.* Due to the dither quantization scheme and the dither noise being uniform in \(\left[ -\frac{\epsilon}{2}, \frac{\epsilon}{2} \right]\), each \(e^i_t\) is independent and
also uniformly distributed between \(\left[ -\frac{\epsilon}{2}, \frac{\epsilon}{2} \right]\). Consequently, when \(i\ne j\) or \(t\ne s\), we have \(\mathbb{E}[e^i_t e^j_s] = \mathbb{E}[e^i_t] \mathbb{E}[e^j_s] = 0\). On the other hand, \(\mathbb{E}[(e^i_t)^2] = \frac{1}{\epsilon}\int_{-\epsilon/2}^{\epsilon/2} e^2 \mathrm{d}e =
\frac{\epsilon^2}{12}.\) ◻

** Corollary 1**. *For any fixed \(i,j \in \{1,\ldots, N\}\), let \(y^{ij}_t = e^i_t e^j_t\), where \(i\ne j\). Then, \[\begin{align} \lim_{T\to \infty}\frac{1}{T}\sum_{t=0}^{T-1} y^{ij}_t = 0.
\end{align}\]*

*Proof.* One may notice that \(\{y^{ij}_t\}_{t\ge 0}\) is an i.i.d. sequence of random variables with \(\mathbb{E}[y^{ij}_t] = 0\) (due to Lemma 1) and \(\mathbb{E}[(y^{ij}_t)^4] < \infty\). Therefore, from strong law of large numbers, \(\frac{1}{T}\sum_{t=0}^{T-1} y^{ij}_t
\to 0\) almost surely. ◻

** Corollary 2**. *For any fixed \(i,j \in \{1,\ldots, N\}\), let \(z^{ij}_t = e^i_t e^j_{t+1}\), where \(i\ne j\). Then, \[\begin{align} \lim_{T\to \infty}\frac{1}{T}\sum_{t=0}^{T-1} z^{ij}_t = 0.
\end{align}\]*

*Proof.* The proof follows the same steps as in the proof of . ◻

** Corollary 3**. *Let \(z^i_t = e^i_t e^i_{t+1}\). Then, \[\begin{align} \lim_{T\to \infty}\frac{1}{T}\sum_{t=0}^{T-1} z^{i}_t = 0.
\end{align}\]*

*Proof.* Although \(\{z^i_t\}_{t\ge 0}\) is an identically distributed sequence, it is not independent. Therefore, the standard strong law of large numbers does not apply readily.

To proceed with the proof, let us first note that, for all \(\tau \ge 1\), where the second inequality follow from the fact that \(e^i_t\) is independent of \(e^i_{t+1}e^i_{t+\tau}e^i_{t+\tau+1}\) for all \(\tau \ge 1\). Therefore, 16 proves pairwise uncorrelation of the sequence \(\{z^i_t\}_{t\ge 0}\).

Now let us define the random variable \(\vartheta_T = \sum_{t=0}^{T-1} z^i_t\). We note that, \[\begin{align} \mathbb{E}[(\vartheta_T)^4] &= \mathbb{E}\left[ \!\bigg( \sum_{t=0}^{T-1} z^i_t \bigg)^{\!\! 4} \right] \\ & = T \mathbb{E}[(z^i_0)^{4}] + 3T(T-1) \mathbb{E}[(z^i_0 z^i_1)^2], \end{align}\] where we have used \(\mathbb{E}[z^i_k (z^i_\ell)^3] = 0\) since \(z^i_k\) and \(z^i_\ell\) are uncorrelated for all \(k\ne \ell\) and \(\mathbb{E}[z^i_k] = 0\) for all \(k\). Given that \(e^{i}_t\) is uniformly distributed in \(\left[ -\frac{\epsilon}{2}, \frac{\epsilon}{2} \right]\), there exists a \(K < \infty\) such that \[\begin{align} K = 4 \max\{ \mathbb{E}[(z^i_0)^4], \mathbb{E}[(z^i_0 z^i_1)^2]\}, \end{align}\] which then implies \[\begin{align} \label{eq:32KBound} \mathbb{E}[(\vartheta_T)^4] \le K T^2, \end{align}\tag{17}\] for all \(T \ge 1\). Next, we use this bound to show that \(\frac{1}{T}\sum_{t=0}^{T-1} z^{i}_t \to 0\) almost surely. To that end, let us start with \[\begin{align} \mathbb{E}\left[ \sum_{T \ge 1} \left( \frac{\vartheta_T}{T} \right)^4\right] = \sum_{T \ge 1} \mathbb{E}\left[ \left( \frac{\vartheta_T}{T} \right)^4 \right] \le \sum_{T \ge 1} \frac{K}{T^{2}} < \infty, \end{align}\] where the first equality follows from the Fubini-Tonelli Theorem, and the first inequality follows from 17 . Having proven that \(\mathbb{E}\left[ \sum_{T \ge 1} \left( \frac{\vartheta_T}{T} \right)^4\right] < \infty\), we may conclude that \(\sum_{T \ge 1} \left( \frac{\vartheta_T}{T} \right)^4 < \infty\) almost surely. Therefore, since the series converges, the underlying sequence must converge to zero, which implies \[\begin{align} \left( \frac{\vartheta_T}{T} \right)^4 \to 0 \qquad \text{almost surely}. \end{align}\] Consequently, we may conclude that \[\begin{align} \frac{1}{T}\sum_{t=0}^{T-1} z^{i}_t = \frac{\vartheta_T}{T} \to 0 \qquad \text{almost surely}. \end{align}\] This concludes the proof. ◻

Notice that we may write \[\begin{align} \| \tilde{\Phi}' - A \tilde{\Phi}\|^2 = \sum_{t=0}^{T-1}\| \tilde{\varphi}(x_{t+1}) - A \tilde{\varphi}(x_t)\|^2.
\end{align}\] Now, let us define \(e^i_t \triangleq \tilde{\varphi}^i(x_t) - \varphi^i(x_t)\) to be the quantization error on the \(i\)-th observable at time \(t\), which is a zero-mean i.i.d. process due to the dither quantization. This implies \(\mathbb{E}[e^i_t e^j_s] = 0\) when \(i\ne j\) or \(t\ne s\). Let us further define \(e_t = [e^1_t,\ldots, e^N_t]^\top\). We may expand \(\| \tilde{\varphi}(x_{t+1}) - A \tilde{\varphi}(x_t)\|^2\) as follows
\[\begin{align} \label{eq:tilde95expansion} \| \tilde{\varphi}(x_{t+1}) & - A \tilde{\varphi}(x_t)\|^2 = \| \varphi(x_{t+1}) - A \varphi(x_t) + e_{t+1} - Ae_t \|^2 \nonumber \\
\nonumber = &~ \| \varphi(x_{t+1}) - A \varphi(x_t)\|^2 + \| e_{t+1} \|^2 + \|A e_t\|^2 \\ \nonumber &~~ - 2e_{t+1}^\top A e_t + 2 e_{t+1}^\top (\varphi(x_{t+1}) - A \varphi(x_t)) \\ &~~ - 2 e_t^\top A^\top (\varphi(x_{t+1}) - A \varphi(x_t)).
\end{align}\tag{18}\] Now recall that \(\{e^i_t\}_{t= 0:T}^{i = 1:N}\) is an i.i.d sequence, therefore, using the *law of large numbers*, we may write \[\begin{align}
\lim_{T\to \infty}\frac{1}{T}\sum_{t=0}^{T-1} e^i_t = 0
\end{align}\] for all \(i\), with almost sure probability. Similarly, we may also write \[\begin{align} \lim_{T\to \infty} \frac{1}{T} \sum_{t=0}^{T-1}\|e_{t+1}\|^2 = \mathbb{E}[\|e_0\|^2]
= \sum_{i=1}^N \mathbb{E}[(e^i_0)^2] \overset{(\dagger)}{=} N \frac{\epsilon^2}{12}
\end{align}\] almost surely, where \((\dagger)\) follows from . Similarly, \[\begin{align} \lim_{T\to \infty} \frac{1}{T} \sum_{t=0}^{T-1} e_{t+1}^\top A e_t = 0,
\end{align}\] almost surely, due to and .

Therefore, for a large enough \(T\), we may write \[\begin{align} \label{eq:mainEquation} \frac{1}{T}\sum_{t=0}^{T-1} \| \tilde{\varphi}(x_{t+1}) - A \tilde{\varphi}(x_t)\|^2 = & \frac{1}{T} \sum_{t=0}^{T-1} \| \varphi(x_{t+1}) - A \varphi(x_t)\|^2 \nonumber \\ &+ N \frac{\epsilon^2}{12} + \frac{\epsilon^2}{12} \|A\|^2, \end{align}\tag{19}\] where we have used \(\frac{1}{T}\sum_{t = 0}^{T-1} e_t = \mathbb{E}[e] = 0\) on the last two terms of 18 . Thus, \[\begin{align} &\tilde{\mathcal{K}}_{\rm DMD}= \mathop{\mathrm{\arg\!\min}}_A \| \tilde{\Phi}' - A \tilde{\Phi}\|^2 \\ &= \mathop{\mathrm{\arg\!\min}}_A \frac{1}{T}\sum_{t = 0}^{T-1} \| \tilde{\varphi}(x_{t+1}) - A \tilde{\varphi}(x_t)\|^2 \\ & = \mathop{\mathrm{\arg\!\min}}_A \frac{1}{T} \sum_{t = 0}^{T-1} \| \varphi(x_{t+1}) - A \varphi(x_t)\|^2 + \frac{\epsilon^2}{12} \|A\|^2. \end{align}\] This concludes the proof of .

The closed form solution to the DMD problem in 11 with quantized data is \[\begin{align} \label{eq:KDt95solution} \tilde{\mathcal{K}}_{\rm DMD}= \tilde{\Phi}' \tilde{\Phi}^\top \big( \tilde{\Phi} \tilde{\Phi}^\top\big)^{-1}. \end{align}\tag{20}\] Let us denote \(\tilde{\Phi} = \Phi + \Phi_\epsilon\), where the \(ij\)-th element of \(\Phi_\epsilon\) is \(e^i_j\), which is the quantization error corresponding to the \(i\)-th observable at time-step \(j\). Given that \(e^i_j\) is uniformly distributed in the range \(\big[-\frac{\epsilon}{2}, \frac{\epsilon}{2} \big]\), one may conclude that \(\|\Phi_\epsilon\| = O(\epsilon)\), where \(O(\cdot)\) is the Big-O notation. Similarly, we may also define \(\tilde{\Phi}' = \Phi' + \Phi'_\epsilon\) and conclude that \(\|\Phi'_\epsilon\| = O(\epsilon)\).

After substituting \(\tilde{\Phi} = \Phi + \Phi_\epsilon\) and \(\tilde{\Phi}' = \Phi' + \Phi'_\epsilon\) in 20 , and after some simplifications, we obtain \[\begin{align} \tilde{\mathcal{K}}_{\rm DMD}& = \mathcal{K}_{\rm DMD}- \mathcal{K}_{\rm DMD}\big( \Phi \Phi^\top\Psi_\epsilon^{-1} + I \big)^{-1} + \Gamma_\epsilon \big( \tilde{\Phi} \tilde{\Phi}^\top\big)^{-1} , \end{align}\] where \(\Psi_\epsilon = \Phi_\epsilon \Phi^\top + \Phi \Phi_\epsilon^\top + \Phi_\epsilon \Phi_\epsilon^\top\) and \(\Gamma_\epsilon = \Phi'_\epsilon \Phi^\top + \Phi' \Phi_\epsilon^\top + \Phi'_\epsilon \Phi_\epsilon^\top\). Therefore, we may write \[\begin{align} \tilde{\mathcal{K}}_{\rm DMD}= \mathcal{K}_{\rm DMD}+ \mathcal{K}_\epsilon, \end{align}\] where \(\mathcal{K}_\epsilon = \Gamma_\epsilon \big( \tilde{\Phi} \tilde{\Phi}^\top\big)^{-1} - \mathcal{K}_{\rm DMD}\big( \Phi \Phi^\top\Psi_\epsilon^{-1} + I \big)^{-1}\). The theorem is proven once we have shown that \(\|\mathcal{K}_\epsilon\| = O(\epsilon)\). To that end, let us note that \(\|\Psi_\epsilon\| = O(\epsilon)\) and \(\|\Gamma_\epsilon\| = O(\epsilon)\), and therefore, \(\|\mathcal{K}_\epsilon \| = O(\epsilon)\). This concludes the proof.

The simulation setup [23] is shown in Fig. 4. The 2-D solution domain \((2.2~\text{m} \times 0.41~\text{m})\) is discretized using irregular triangular mesh with number of nodes \(N_0=2647\), and number of elements \(N_2=5016\). The cylinder has the diameter of \(0.1\) m with its center located at \((0.2~\text{m},0.2~\text{m})\). The flow is assumed to be incompressible, and governed by the Navier-Stokes equations with \(\mathbf{u}\), \(\mathbf{v}\) denoting the horizontal and vertical component of the velocity respectively while \(\mathbf{p}\) denotes the pressure field. The density of the fluid is \(\rho=1\) Kg/m\(^3\) and its dynamic viscosity \(\mu=0.001\) Kg/m s. The flow is unsteady with a maximum velocity of 1 m/s and mean velocity \(\frac{2}{3}\) of the maximum velocity. The simulation starts with initial conditions \(\mathbf{u}_0=\mathbf{v}_0=0\) and \(\mathbf{p}_0=0\). The leftmost boundary is set as an inlet with a parabolic velocity profile, representing a fully developed laminar flow at the inlet. The rightmost boundary is set as an outflow (pressure boundary), where we specify the pressure but do not specify the velocity, allowing the flow to exit naturally based on the internal flow field. All other boundaries are treated as walls with a no-slip condition, i.e., the fluid velocity at the walls is zero. The simulation runs for a total of \(80\) seconds, with a time-step size of \(0.01\) seconds.

[1]

C. W. Rowley, I. Mezić, S. Bagheri, P. Schlatter, and D. S. Henningson, “Spectral analysis of nonlinear flows,” *Journal of Fluid Mechanics*, vol. 641, pp. 115–127,
2009.

[2]

I. Nayak, F. L. Teixeira, and M. Kumar, “Koopman autoencoder architecture for current density modeling in kinetic plasma simulations,” in *2021 International Applied
Computational Electromagnetics Society Symposium (ACES)*, pp. 1–3, IEEE, 2021.

[3]

S. Peitz, S. E. Otto, and C. W. Rowley, “Data-driven model predictive control using interpolated Koopman generators,”
*SIAM Journal on Applied Dynamical Systems*, vol. 19, no. 3, pp. 2162–2193, 2020.

[4]

S. S. K. S. Narayanan, D. Tellez-Castro, S. Sutavani, and U. Vaidya, “Se(3) koopman-mpc: Data-driven learning and control of quadrotor uavs,” 2023.

[5]

A. M. Avila and I. Mezić, “Data-driven analysis and forecasting of highway traffic dynamics,” *Nature Communications*, vol. 11, no. 1, p. 2090,
2020.

[6]

A. S. Dogra and W. Redman, “Optimizing neural networks via koopman operator theory,” in *Advances in Neural Information Processing Systems*(H. Larochelle, M. Ranzato,
R. Hadsell, M. Balcan, and H. Lin, eds.), vol. 33, pp. 2087–2097, Curran Associates, Inc., 2020.

[7]

M. O. Williams, I. G. Kevrekidis, and C. W. Rowley, “A data–driven approximation of the Koopman operator: extending Dynamic Mode Decomposition,” *Journal of
Nonlinear Science*, vol. 25, pp. 1307–1346, Dec 2015.

[8]

H. Arbabi and I. Mezić, “Ergodic theory, dynamic mode decomposition, and computation of spectral properties of the koopman operator,” *SIAM Journal on Applied Dynamical
Systems*, vol. 16, no. 4, pp. 2096–2126, 2017.

[9]

S. M. Hirsh, K. D. Harris, J. N. Kutz, and B. W. Brunton, “Centering data improves the dynamic mode decomposition,” *SIAM Journal on Applied Dynamical Systems*,
vol. 19, no. 3, pp. 1920–1955, 2020.

[10]

J. Lee, L. Zimmer, T. Saito, S. Nakaya, and M. Tsue, “Effects of spatial resolution of the data on dynamic mode decomposition and its quantitative analysis,”
*Experimental Thermal and Fluid Science*, vol. 151, p. 111077, 2024.

[11]

C. Folkestad, S. X. Wei, and J. W. Burdick, “Koopnet: Joint learning of koopman bilinear models and function dictionaries with application to quadrotor trajectory tracking,”
in *2022 International Conference on Robotics and Automation (ICRA)*, pp. 1344–1350, 2022.

[12]

A. Cleary, K. Yoo, P. Samuel, S. George, F. Sun, and S. A. Israel, “Machine learning on small uavs,” in *2020 IEEE Applied Imagery Pattern Recognition Workshop
(AIPR)*, pp. 1–5, 2020.

[13]

D. F. Hougen, S. Benjaafar, J. C. Bonney, J. R. Budenske, M. Dvorak, M. Gini, H. French, D. G. Krantz, P. Y. Li, F. Malver, *et al.*, “A miniature robotic system for
reconnaissance and surveillance,” in *International Conference on Robotics and Automation*, vol. 1, pp. 501–507, IEEE, 2000.

[14]

A. Gholami, S. Kim, Z. Dong, Z. Yao, M. W. Mahoney, and K. Keutzer, “A survey of quantization methods for efficient neural network inference,” *arXiv eprint
arXiv:2103.13630*, 2021.

[15]

S. Li, X. Ning, L. Wang, T. Liu, X. Shi, S. Yan, G. Dai, H. Yang, and Y. Wang, “Evaluating quantized large language models,” *arXiv preprint arXiv:2402.18158*,
2024.

[16]

R. M. Gray and T. G. Stockham, “Dithered quantizers,” *IEEE Transactions on Information Theory*, vol. 39, no. 3, pp. 805–812, 1993.

[17]

P. J. Schmid, “Dynamic mode decomposition of numerical and experimental data,” *Journal of Fluid Mechanics*, vol. 656, pp. 5–28, 2010.

[18]

S. E. Otto and C. W. Rowley, “Linearly recurrent autoencoder networks for learning dynamics,” *SIAM Journal on Applied Dynamical Systems*, vol. 18, no. 1,
pp. 558–593, 2019.

[19]

E. Yeung, S. Kundu, and N. Hodas, “Learning deep neural network representations for koopman operators of nonlinear dynamical systems,” in *2019 American Control
Conference (ACC)*, pp. 4832–4839, 2019.

[20]

L. Roberts, “Picture coding using pseudo-random noise,” *IRE Transactions on Information Theory*, vol. 8, no. 2, pp. 145–154, 1962.

[21]

S. U. S. E. Laboratories, T. Ishikawa, U. S. O. of Naval Research, U. S. A. S. Corps, U. S. A. Force, and U. S. Navy, *Linearization of Contactor Control Systems by External Dither
Signals*. 1960.

[22]

G. Batchelor, *An Introduction to Fluid Dynamics*. Cambridge Mathematical Library, Cambridge University Press, 1967.

[23]

I. Nayak, D. Goswami, M. Kumar, and F. Teixeira, “Temporally-consistent koopman autoencoders for forecasting dynamical systems,” *arXiv preprint arXiv:2403.12335*,
2024.

The research of D. Maity was supported by the grant ARL DCIST CRA W911NF-17-2-0181.↩︎

D. Maity is with the Department of Electrical and Computer Engineering and an affiliated faculty of the North Carolina Battery Complexity, Autonomous Vehicle, and Electrification Research Center (BATT CAVE), University of North Carolina at Charlotte, NC, 28223, USA. Email:

`dmaity@charlotte.edu`

↩︎D. Goswami is with the Department of Mechanical and Aerospace Engineering, The Ohio State University, Columbus, OH, 43210, USA. Email:

`goswami.78@osu.edu`

↩︎S. Narayanan is with the Department of Mechanical and Aerospace Engineering, The Ohio State University, Columbus, OH, 43210, USA. Email:

`narayanan.121@osu.edu`

↩︎For practical purposes, we only need that the data matrices \(\Phi\) and \(\Phi'\) are bounded, since the EDMD algorithm deals only with the data and not the functions. Therefore, the observables do not need to be bounded functions as long as the measured data is bounded.↩︎