# Towards Optimal Moment Estimation in Streaming and Distributed Models

@inproceedings{Jayaram2019TowardsOM,
title={Towards Optimal Moment Estimation in Streaming and Distributed Models},
author={R. Jayaram and David P. Woodruff},
booktitle={APPROX-RANDOM},
year={2019}
}
• Published in APPROX-RANDOM 2019
• Physics, Computer Science, Mathematics
One of the oldest problems in the data stream model is to approximate the $p$-th moment $\|\mathcal{X}\|_p^p = \sum_{i=1}^n |\mathcal{X}_i|^p$ of an underlying vector $\mathcal{X} \in \mathbb{R}^n$, which is presented as a sequence of poly$(n)$ updates to its coordinates. Of particular interest is when $p \in (0,2]$. Although a tight space bound of $\Theta(\epsilon^{-2} \log n)$ bits is known for this problem when both positive and negative updates are allowed, surprisingly there is still a gap… Expand
4 Citations

#### Figures and Topics from this paper

Testing Positive Semi-Definiteness via Random Submatrices
• Computer Science, Mathematics
• 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• 2020
• 4
• PDF
Optimal bounds for approximate counting
• Mathematics, Computer Science
• ArXiv
• 2020
• 1
• PDF
The Coin Problem with Applications to Data Streams
• Computer Science
• 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• 2020
• PDF

#### References

SHOWING 1-10 OF 81 REFERENCES
Continuous monitoring of 𝓁p norms in data streams
• Mathematics, Computer Science
• APPROX-RANDOM
• 2017
• 9
• PDF
Revisiting Frequency Moment Estimation in Random Order Streams
• Computer Science, Mathematics
• ICALP
• 2018
• 6
• PDF
Streaming Algorithms from Precision Sampling
• Mathematics, Computer Science
• ArXiv
• 2010
• 23
Perfect Lp Sampling in a Data Stream
• Mathematics, Computer Science
• 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
• 25
• PDF
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
• Mathematics, Computer Science
• APPROX-RANDOM
• 2013
• 29
• PDF
Recursive Sketching For Frequency Moments
• Computer Science, Mathematics
• ArXiv
• 2010
• 28
• PDF
Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams
• Mathematics, Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
• 30
• PDF