arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.08806cs.DSmath.OC
收藏

超稀疏超稀疏化器与更快的拉普拉斯系统求解器

Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers

Arun Jambulapati, Aaron Sidford

AI总结:

本文提出了一种期望时间为$O(m (\log \log n)^{O(1)} \log(1/\epsilon))$的拉普拉斯系统求解算法,通过高效构造$\ell_p$-stretch图近似改进了运行时间界限,并证明了任意向量集的超稀疏化器存在性,改进了相对条件数。

摘要:

在本文中,我们提出了一种期望时间为 $O(m (\log \log n)^{O(1)} \log(1/\epsilon))$ 的算法,用于求解 $n$ 节点 $m$ 边图上的 Laplacian 系统,改进了先前由 (Cohen, Kyng, Miller, Pachocki, Peng, Rao, Xu 2014) 取得的 $O(m \sqrt{\log n} (\log \log n)^{O(1)} \log(1/\epsilon))$ 最佳期望运行时间。为了获得这一结果,我们提供了 $\ell_p$-stretch 图近似的高效构造,并改进了 stretch 和稀疏性界限。此外,作为本工作的动机,我们证明了对于 $\mathbb{R}^d$ 中的任意向量集(不仅限于图诱导的向量集)以及所有 $k > 1$,存在包含 $d-1 + O(d/\sqrt{k})$ 个重新加权的向量且相对条件数最多为 $k$ 的 ultrasparsifiers。对于较小的 $k$,这改进了先前已知的最优相对条件数 $\tilde{O}(\sqrt{k \log d})$,而该结果此前仅适用于图的情况。

英文摘要:

In this paper we provide an $O(m (\log \log n)^{O(1)} \log(1/ε))$-expected time algorithm for solving Laplacian systems on $n$-node $m$-edge graphs, improving improving upon the previous best expected runtime of $O(m \sqrt{\log n} (\log \log n)^{O(1)} \log(1/ε))$ achieved by (Cohen, Kyng, Miller, Pachocki, Peng, Rao, Xu 2014). To obtain this result we provide efficient constructions of $\ell_p$-stretch graph approximations with improved stretch and sparsity bounds. Additionally, as motivation for this work, we show that for every set of vectors in $\mathbb{R}^d$ (not just those induced by graphs) and all $k > 1$ there exist ultrasparsifiers with $d-1 + O(d/\sqrt{k})$ re-weighted vectors of relative condition number at most $k$. For small $k$, this improves upon the previous best known relative condition number of $\tilde{O}(\sqrt{k \log d})$, which is only known for the graph case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑