Optimal Matrix Sketching over Sliding Windows

Matrix sketching, aimed at approximating a matrix boldsymbolA ∈ ℝN× d consisting of vector streams of length N with a smaller sketching matrix boldsymbolB ∈ ℝℓ× d, ℓ ll N, has garnered increasing attention in fields such as large-scale data analytics and machine learning. A well-known deterministic matrix sketching method is the Frequent Directions algorithm, which achieves the optimal Oleft(fracdvarepsilonright) space bound and provides a covariance error guarantee of varepsilon = lVert boldsymbolA^top boldsymbolA - boldsymbolB^top boldsymbolB rVert2/lVert boldsymbolA rVertF2. The matrix sketching problem becomes particularly interesting in the context of sliding windows, where the goal is to approximate the matrix boldsymbolAW, formed by input vectors over the most recent N time units. However, despite recent efforts, whether achieving the optimal Oleft(fracdvarepsilonright) space bound on sliding windows is possible has remained an open question. In this paper, we introduce the DS-FD algorithm, which achieves the optimal Oleft(fracdvarepsilonright) space bound for matrix sketching over row-normalized, sequence-based sliding windows. We also present matching upper and lower space bounds for time-based and unnormalized sliding windows, demonstrating the generality and optimality of dsfd across various sliding window models. This conclusively answers the open question regarding the optimal space bound for matrix sketching over sliding windows. Furthermore, we conduct extensive experiments with both synthetic and real-world datasets, validating our theoretical claims and thus confirming the correctness and effectiveness of our algorithm, both theoretically and empirically.