# Querying a Matrix through Matrix-Vector Products

@inproceedings{Sun2019QueryingAM, title={Querying a Matrix through Matrix-Vector Products}, author={Xiaoming Sun and D. Woodruff and G. Yang and J. Zhang}, booktitle={ICALP}, year={2019} }

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… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-5 OF 5 CITATIONS

## Graph Connectivity and Single Element Recovery via Linear and OR Queries

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 42 REFERENCES

## Testing Matrix Rank, Optimally

VIEW 1 EXCERPT

## Approximately Counting Triangles in Sublinear Time

VIEW 1 EXCERPT

## On the Power of Adaptivity in Sparse Recovery

VIEW 1 EXCERPT

## Graph Distances in the Data-Stream Model

VIEW 1 EXCERPT

## Analyzing graph structure via linear measurements

VIEW 1 EXCERPT