通过惰性更新计算约翰椭球
John Ellipsoids via Lazy Updates
AI总结:
本文提出通过采样延迟高精度杠杆分数计算并结合快速矩形矩阵乘法,加速 d 维 n 点近似约翰椭球的构造,同时给出低空间流式算法。
摘要:
我们提出了一种更快的算法,用于在 d 维空间中计算 n 个点的近似约翰椭球。此前已知的最佳算法基于反复计算各点的杠杆分数并按这些分数重新加权 [CCLY19]。我们证明,可以通过使用采样来延迟高精度杠杆分数的计算,从而大幅加速该算法,随后再通过快速矩形矩阵乘法批量计算多组高精度杠杆分数。我们还利用类似思想给出了用于约翰椭球的低空间流式算法。
英文摘要:
We give a faster algorithm for computing an approximate John ellipsoid around $n$ points in $d$ dimensions. The best known prior algorithms are based on repeatedly computing the leverage scores of the points and reweighting them by these scores [CCLY19]. We show that this algorithm can be substantially sped up by delaying the computation of high accuracy leverage scores by using sampling, and then later computing multiple batches of high accuracy leverage scores via fast rectangular matrix multiplication. We also give low-space streaming algorithms for John ellipsoids using similar ideas.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。