Jun 13, 2019 · We also show separations for algorithms that are allowed to obtain matrix-vector products only by querying vectors on the right, versus ...

Oct 4, 2021 · Abstract. We consider algorithms with access to an unknown matrix M ε F n×d via matrix-vector products, namely, the algorithm chooses vectors v1 ...

We consider algorithms with access to an unknown matrix M ∈ Fn×d via matrix-vector products, namely, the algorithm chooses vectors v1,..., vq, and observes Mv1, ...

We can only query this matrix via matrix-vector products, i.e., we pick an arbitrary vector x and send it to the oracle, and the oracle will respond with a ...

We can only query this matrix via matrix-vector products, i.e., we pick an arbitrary vector $\mathbf {x}$ and send it to the oracle, and the oracle will ...

Sep 11, 2024 · Our approach consists of two main steps: we first (provably) identify a family of graphs, similar to the instances used in prior work to ...

Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems · Mathematics, Computer Science. APPROX-RANDOM · 2020.

Nov 9, 2021 · You could use np.einsum to perform the matrix/vector dot products over both i and j : >>> np.einsum('ijkl,ijl->ijk', A, x) ...

Oct 31, 2021 · We prove lower bounds on the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which ...

Jul 4, 2019 · We consider algorithms with access to an unknown matrix M in F^{n x d} via matrix-vector products, namely, the algorithm chooses vectors v^1, ..