Multiplicative Rank-1 Approximation using Length-Squared Sampling

被引:0
|
作者
Jaiswal, Ragesh [1 ]
Kumar, Amit [1 ]
机构
[1] IIT Delhi, Comp Sci & Engn, New Delhi, India
关键词
MONTE-CARLO ALGORITHMS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that the span of Omega(1/(epsilon)4) rows of any matrix A subset of R-nxd sampled according to the length-squared distribution contains a rank-1 matrix (A) over tilde such that parallel to A - (A) over tilde parallel to(2)(F) <= (1+epsilon)center dot parallel to A -pi(1) (A)parallel to(2)(F), where pi(1)(A) denotes the best rank-1 approximation of A under the Frobenius norm. Length-squared sampling has previously been used in the context of rank-k approximation. However, the approximation obtained was additive in nature. We obtain a multiplicative approximation albeit only for rank-1 approximation.
引用
收藏
页码:18 / 23
页数:6
相关论文
共 50 条