Differentially Private Linear Algebra in the Streaming Model
Jalaj Upadhyay

TL;DR
This paper introduces space-efficient, differentially private algorithms for linear algebra tasks in streaming data, achieving optimal or near-optimal error bounds without strong assumptions, and applicable in distributed settings.
Contribution
It presents the first sketch-based, differentially private algorithms for low-rank approximation, linear regression, and matrix multiplication in streaming models, matching non-private space bounds.
Findings
Achieves optimal space bounds up to logarithmic factors.
Provides single-pass, differentially private low-rank approximation.
Algorithms are applicable in distributed environments.
Abstract
Numerical linear algebra plays an important role in computer science. In this paper, we initiate the study of performing linear algebraic tasks while preserving privacy when the data is streamed online. Our main focus is the space requirement of the privacy-preserving data-structures. We give the first {\em sketch-based} algorithm for differential privacy. We give optimal, up to logarithmic factor, space data-structures that can compute low rank approximation, linear regression, and matrix multiplication, while preserving differential privacy with better additive error bounds compared to the known results. Notably, we match the best known space bound in the non-private setting by Kane and Nelson (J. ACM, 61(1):4). Our mechanism for differentially private low-rank approximation {\em reuses} the random Gaussian matrix in a specific way to provide a single-pass mechanism. We prove that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
