Querying a Matrix through Matrix-Vector Products

We consider algorithms with access to an unknown matrix M∈F^n × d via matrix-vector products, namely, the algorithm chooses vectors v^1, ..., v^q, and observes Mv^1,..., Mv^q. Here the v^i can be randomized as well as chosen adaptively as a function of Mv^1,...,Mv^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.

• 32 publications
• 116 publications
• 118 publications
• 29 publications
research
06/24/2020

Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems

We consider the general problem of learning about a matrix through vecto...
research
02/22/2021

Quantum query complexity with matrix-vector products

We study quantum algorithms that learn properties of a matrix using quer...
research
10/19/2020

Hutch++: Optimal Stochastic Trace Estimation

We study the problem of estimating the trace of a matrix A that can only...
research
12/19/2022

Matrix recovery from matrix-vector products

Can one recover a matrix efficiently from only matrix-vector products? I...
research
11/20/2017

Edge Estimation with Independent Set Oracles

We study the problem of estimating the number of edges in a graph with a...
research
03/24/2021

On the ℓ^∞-norms of the Singular Vectors of Arbitrary Powers of a Difference Matrix with Applications to Sigma-Delta Quantization

Let A _max := max_i,j |A_i,j| denote the maximum magnitude of entries of...
research
11/23/2021

On the Column and Row Ranks of a Matrix

Every m by n matrix A with rank r has exactly r independent rows and r i...