用矩阵向量积查询矩阵
Querying a Matrix through Matrix-Vector Products
摘要:
我们考虑通过矩阵向量乘积访问未知矩阵$M\in\mathbb{F}^{n \times d}$的算法,即该算法选择向量$\mathbf{v}^1, \ldots, \mathbf{v}^q$,并观察$M\mathbf{v}^1,\ldots, M\mathbf{v}^q$。这里,$\mathbf{v}^i$可以被随机化,以及作为$ M\mathbf{v}^1,\ldots,M\mathbf{v}^{i-1}$的函数自适应地选择。出于在分布式计算,线性代数和流模型,以及连接到通信复杂性和属性测试等领域的草图的应用,我们开始研究的数量$q$的查询需要解决各种基本问题。我们研究三大类问题,包括线性代数,统计问题和图形问题。例如,我们考虑近似矩阵$M$的秩、迹、最大特征值和范数所需的查询数量;计算$M$的每一列或每一行的AND/OR/奇偶性,确定$M$中是否有相同的列或行,或者$M$是对称的、对角的还是酉的;或者计算由$M$定义的图是连通的还是无三角形的。我们还展示了仅允许通过查询右侧向量来获得矩阵向量积的算法与可以同时查询左侧和右侧向量的算法的分离。我们还显示了分离取决于矩阵向量乘积发生的基础字段。对于图的问题,我们显示分离取决于矩阵的形式(二分邻接与签署的边顶点关联矩阵)表示的图形。令人惊讶的是,这个基本模型似乎没有被研究自己,我们相信,在这个模型中的问题进行彻底的调查将有利于一些不同的应用领域。
英文摘要:
We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots, M\mathbf{v}^q$. Here the $\mathbf{v}^i$ can be randomized as well as chosen adaptively as a function of $ M\mathbf{v}^1,\ldots,M\mathbf{v}^{i-1}$. Motivated by applications of sketching in distributed computation, linear algebra, and streaming models, as well as connections to areas such as communication complexity and property testing, we initiate the study of the number $q$ of queries needed to solve various fundamental problems. We study problems in three broad categories, including linear algebra, statistics problems, and graph problems. For example, we consider the number of queries required to approximate the rank, trace, maximum eigenvalue, and norms of a matrix $M$; to compute the AND/OR/Parity of each column or row of $M$, to decide whether there are identical columns or rows in $M$ or whether $M$ is symmetric, diagonal, or unitary; or to compute whether a graph defined by $M$ is connected or triangle-free. We also show separations for algorithms that are allowed to obtain matrix-vector products only by querying vectors on the right, versus algorithms that can query vectors on both the left and the right. We also show separations depending on the underlying field the matrix-vector product occurs in. For graph problems, we show separations depending on the form of the matrix (bipartite adjacency versus signed edge-vertex incidence matrix) to represent the graph. Surprisingly, this fundamental model does not appear to have been studied on its own, and we believe a thorough investigation of problems in this model would be beneficial to a number of different application areas.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。