On deterministic sketching and streaming for sparse recovery and norm estimation

We study classic streaming and sparse recovery problems using deterministic linear sketches, including ℓ1/ℓ1 and ℓ∞/ℓ1 sparse recovery problems (the latter also being known as ℓ1-heavy hitters), norm estimation, and approximate inner product. We focus on devising a fixed matrix A∈Rm×n and a deterministic recovery/estimation procedure which work for all possible input vectors simultaneously. Our results improve upon existing work, the following being our main contributions: