Papers
Topics
Authors
Recent
Search
2000 character limit reached

Separations for Estimating Large Frequency Moments on Data Streams

Published 8 May 2021 in cs.DS | (2105.03773v4)

Abstract: We study the classical problem of moment estimation of an underlying vector whose nn coordinates are implicitly defined through a series of updates in a data stream. We show that if the updates to the vector arrive in the random-order insertion-only model, then there exist space efficient algorithms with improved dependencies on the approximation parameter ε\varepsilon. In particular, for any real p>2p > 2, we first obtain an algorithm for FpF_p moment estimation using O~(1ε4/p⋅n1−2/p)\tilde{\mathcal{O}}\left(\frac{1}{\varepsilon^{4/p}}\cdot n^{1-2/p}\right) bits of memory. Our techniques also give algorithms for FpF_p moment estimation with p>2p>2 on arbitrary order insertion-only and turnstile streams, using O~(1ε4/p⋅n1−2/p)\tilde{\mathcal{O}}\left(\frac{1}{\varepsilon^{4/p}}\cdot n^{1-2/p}\right) bits of space and two passes, which is the first optimal multi-pass FpF_p estimation algorithm up to log⁡n\log n factors. Finally, we give an improved lower bound of Ω(1ε2⋅n1−2/p)\Omega\left(\frac{1}{\varepsilon^2}\cdot n^{1-2/p}\right) for one-pass insertion-only streams. Our results separate the complexity of this problem both between random and non-random orders, as well as one-pass and multi-pass streams.

Authors (2)
Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

YouTube

Separations for Estimating Large Frequency Moments on Data Streams 130 views