Streaming Semidefinite Programs: $O(\sqrt{n})$ Passes, Small Space and Fast Runtime
Zhao Song, Mingquan Ye, Lichen Zhang

TL;DR
This paper introduces a streaming algorithm for semidefinite programs that uses significantly less space and maintains fast runtime, enabling efficient solutions in large-scale settings.
Contribution
It presents the first sublinear space interior point method for SDP using novel spectral sketching techniques, improving efficiency over prior methods.
Findings
Uses $ ilde{O}(m^2 + n^2)$ space, sublinear in $n$ for large $n$
Achieves $O( oot{n} ext{log}(1/ ext{epsilon}))$ passes, standard for IPMs
Matches state-of-the-art time complexity when $m ext{ is much smaller than } n$
Abstract
We study the problem of solving semidefinite programs (SDP) in the streaming model. Specifically, constraint matrices and a target matrix , all of size together with a vector are streamed to us one-by-one. The goal is to find a matrix such that is maximized, subject to for all and . Previous algorithmic studies of SDP primarily focus on \emph{time-efficiency}, and all of them require a prohibitively large space in order to store \emph{all the constraints}. Such space consumption is necessary for fast algorithms as it is the size of the input. In this work, we design an interior point method (IPM) that uses space, which is strictly sublinear in the regime . Our algorithm takes $O(\sqrt…
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.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
