The 2 tracking problem is the task of obtaining a streaming algorithm that, given access to a stream of items a1, a2, a3, . . . from a universe [n], outputs at each time t an estimate to the 2 norm of the frequency ve...
详细信息
The seminal work of Charikar et al. [1] called COUNT-SKETCH suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation for data streams and pairwise inner product estimation for ...
详细信息
The seminal work of Charikar et al. [1] called COUNT-SKETCH suggests a sketching algorithm for real-valued vectors that has been used in frequency estimation for data streams and pairwise inner product estimation for real-valued vectors etc. One of the major advantages of COUNT-SKETCH over other similar sketching algorithms, such as random projection, is that its running time, as well as the sparsity of sketch, depends on the sparsity of the input. Therefore, sparse datasets enjoy space-efficient (sparse sketches) and faster running time. However, on dense datasets, these advantages of COUNT-SKETCH might be negligible over other baselines. In this work, we address this challenge by suggesting a simple and effective approach that outputs (asymptotically) a sparser sketch than that obtained via COUNT-SKETCH, and as a by-product, we also achieve a faster running time. Simultaneously, the quality of our estimate is closely approximate to that of COUNT-SKETCH. For frequency estimation and pairwise inner product estimation problems, our proposal SPARSE-COUNT-SKETCH provides unbiased estimates. These estimations, however, have slightly higher variances than their respective estimates obtained via COUNT-SKETCH. To address this issue, we present improved estimators for these problems based on maximum likelihood estimation (MLE) that offer smaller variances even w.r.t. COUNT-SKETCH. We suggest a rigorous theoretical analysis of our proposal for frequency estimation for data streams and pairwise inner product estimation for real-valued vectors.
暂无评论