固定稀疏度矩阵近似从矩阵向量积
Fixed-sparsity matrix approximation from matrix-vector products
AI总结:
本文提出了一种随机算法,用于在仅能通过矩阵向量积访问矩阵时,以固定稀疏模式近似矩阵,并证明了该问题的查询复杂度下界。
摘要:
我们研究了当只能通过矩阵向量积访问矩阵A时,用具有固定稀疏模式(例如对角线、带状等)的矩阵来近似A的问题。我们描述了一个简单的随机算法,该算法可以返回具有给定稀疏模式的近似矩阵,其Frobenius范数误差不超过最佳可能误差的(1+ε)倍。当所需稀疏模式的每一行至多有s个非零元素时,该算法需要O(s/ε)次非适应性矩阵向量积。我们还证明了一个匹配的下界,表明对于任何稀疏模式,每行和每列有Θ(s)个非零元素的情况下,任何实现(1+ε)近似所需的矩阵向量积次数在最坏情况下都是Ω(s/ε)。因此,我们解决了该问题的矩阵向量积查询复杂度,直到常数因子,甚至对于已研究的对角线近似情况,此前没有已知的下界。
英文摘要:
We study the problem of approximating a matrix $\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized algorithm that returns an approximation with the given sparsity pattern with Frobenius-norm error at most $(1+\varepsilon)$ times the best possible error. When each row of the desired sparsity pattern has at most $s$ nonzero entries, this algorithm requires $O(s/\varepsilon)$ non-adaptive matrix-vector products with $\mathbf{A}$. We also prove a matching lower-bound, showing that, for any sparsity pattern with $Θ(s)$ nonzeros per row and column, any algorithm achieving $(1+ε)$ approximation requires $Ω(s/\varepsilon)$ matrix-vector products in the worst case. We thus resolve the matrix-vector product query complexity of the problem up to constant factors, even for the well-studied case of diagonal approximation, for which no previous lower bounds were known.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。