Abstract
Projection-cost preservation is a low-rank approximation guarantee which ensures that the cost of any rank-k projection can be preserved using a smaller sketch of the original data matrix. We present a general structural result outlining four sufficient conditions to achieve projection-cost preservation. These conditions can be satisfied using tools from the Randomized Linear Algebra literature.
Original language | English |
---|---|
Pages (from-to) | 144-165 |
Number of pages | 22 |
Journal | Linear Algebra and Its Applications |
Volume | 573 |
DOIs | |
State | Published - Jul 15 2019 |
Externally published | Yes |
Funding
We would like to thank Ilse Ipsen for many useful comments and, in particular, for deriving the proof of Lemma 6 in Section 5 . AC and PD were supported by NSF IIS-1661760 , NSF IIS-1661756 , NSF CCF-1814041 , and NSF DMS-1760353 . JY was supported by NSF IIS-1149789 and NSF IIS-1618690 . We would like to thank Ilse Ipsen for many useful comments and, in particular, for deriving the proof of Lemma 6 in Section 5. AC and PD were supported by NSF IIS-1661760, NSF IIS-1661756, NSF CCF-1814041, and NSF DMS-1760353. JY was supported by NSF IIS-1149789 and NSF IIS-1618690.
Funders | Funder number |
---|---|
National Science Foundation | IIS-1661760, CCF-1814041, IIS-1618690, DMS-1760353, 1760353, IIS-1149789, IIS-1661756 |
National Science Foundation |
Keywords
- Leverage scores
- Matrix sketching
- Projection-cost preservation
- Randomized linear algebra