Consistent Low-Rank Approximation

2026-03-02

AI Summary

This work addresses the problem of maintaining a consistent low-rank approximation for matrices whose rows arrive in a streaming fashion, with the dual objective of preserving approximation accuracy while minimizing recourse—the total amount of change in the output sequence over time. The authors propose a novel recursive subspace update algorithm that, at each time step, produces a near-optimal rank-$k$ approximation. They establish the first tight theoretical bounds characterizing the trade-off between recourse and both additive and multiplicative approximation errors. Leveraging techniques from streaming matrix processing, low-rank approximation, and condition number analysis, their theoretical framework significantly sharpens upper bounds under certain conditions. Empirical evaluations on real-world datasets demonstrate the algorithm’s efficiency and stability in practice.

Technology Category

• Machine Learning: Matrix & Tensor Methods
• Reasoning under Uncertainty: Stochastic Optimization
• Search and Optimization: Non-convex Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Systems and Infrastructure for Web, Mobile and WoT: Data management and stream processing for Web, mobile and wireless applications

Abstract

We introduce and study the problem of consistent low-rank approximation, in which rows of an input matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ arrive sequentially and the goal is to provide a sequence of subspaces that well-approximate the optimal rank-$k$ approximation to the submatrix $\mathbf{A}^{(t)}$ that has arrived at each time $t$, while minimizing the recourse, i.e., the overall change in the sequence of solutions. We first show that when the goal is to achieve a low-rank cost within an additive $\varepsilon\cdot||\mathbf{A}^{(t)}||_F^2$ factor of the optimal cost, roughly $\mathcal{O}\left(\frac{k}{\varepsilon}\log(nd)\right)$ recourse is feasible. For the more challenging goal of achieving a relative $(1+\varepsilon)$-multiplicative approximation of the optimal rank-$k$ cost, we show that a simple upper bound in this setting is $\frac{k^2}{\varepsilon^2}\cdot\text{poly}\log(nd)$ recourse, which we further improve to $\frac{k^{3/2}}{\varepsilon^2}\cdot\text{poly}\log(nd)$ for integer-bounded matrices and $\frac{k}{\varepsilon^2}\cdot\text{poly}\log(nd)$ for data streams with polynomial online condition number. We also show that $Ω\left(\frac{k}{\varepsilon}\log\frac{n}{k}\right)$ recourse is necessary for any algorithm that maintains a multiplicative $(1+\varepsilon)$-approximation to the optimal low-rank cost, even if the full input is known in advance. Finally, we perform a number of empirical evaluations to complement our theoretical guarantees, demonstrating the efficacy of our algorithms in practice.

Problem

• low-rank approximation
• dynamic data streams
• recourse
• matrix approximation
• online algorithms

Innovation

• consistent low-rank approximation
• recourse minimization
• online matrix approximation
• dynamic subspace tracking
• multiplicative approximation