Towards Optimal Moment Estimation in Streaming and Distributed Models

نویسندگان

چکیده

One of the oldest problems in data stream model is to approximate p th moment \(\Vert \mathbf {X}\Vert _p^p = \sum _{i=1}^n {X}_i^p\) an underlying non-negative vector \(\mathbf {X}\in \mathbb {R}^n\) , which presented as a sequence \(\mathrm{poly}(n)\) updates its coordinates. Of particular interest when \(p \in (0,2]\) . Although tight space bound \(\Theta (\epsilon ^{-2} \log n)\) bits known for this problem both positive and negative are allowed, surprisingly, there still gap complexity all positive. Specifically, upper \(O(\epsilon bits, while lower only \(\Omega + bits. Recently, \(\tilde{O}(\epsilon was obtained under assumption that arrive random order We show (0, 1]\) not needed. Namely, we give worst-case streams estimating _p^p\) Our techniques also new bounds empirical entropy stream. However, (1,2]\) natural coordinator blackboard distributed communication topologies, ^{-2})\) bit max-communication based on randomized rounding scheme. protocols rise heavy hitters matrix product. generalize our results arbitrary topologies G obtaining ^{2} d)\) bound, where d diameter Interestingly, rules out complexity-based approaches proving streaming algorithms. In particular, any such must come from topology with large diameter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Placement and Sizing of Distributed Generations in Unbalanced Distribution Networks Considering Load Models and Uncertainties

Development of distributed generations’ technology, trends in the use of these sources to improve some of the problems such as high losses, low reliability, low power quality and high costs in distributed networks. Choose the correct location to install and proper capacity of these sources, such as important things that must be considered in their use. Since distribution networks are actu...

متن کامل

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

We present a method for solving the transshipment problem—also known as uncapacitated minimum cost flow—up to a multiplicative error of 1 + in undirected graphs with polynomially bounded integer edge weights using a tailored gradient descent algorithm. An important special case of the transshipment problem is the single-source shortest paths (SSSP) problem. Our gradient descent algorithm takes ...

متن کامل

Towards Kernel Density Estimation over Streaming Data

A variety of real-world applications heavily relies on the analysis of transient data streams. Due to the rigid processing requirements of data streams, common analysis techniques as known from data mining are not applicable. A fundamental building block of many data mining and analysis approaches is density estimation. It provides a well-defined estimation of a continuous data distribution, a ...

متن کامل

Chebyshev polynomials, moment matching, and optimal estimation of the unseen

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least 1 k using independent samples. We show that the minimax sample complexity to achieve an additive error of k with probability at least 0.5 is within universal constant factors of k log k log 2 1 , which improves the state-of-the-art result k 2 log k due to Valiant and Valiant...

متن کامل

Towards optimal Takacs–Fiksel estimation

The Takacs–Fiksel method is a general approach to estimate the parameters of a spatial Gibbs point process. This method embraces standard procedures such as the pseudolikelihood and is defined via weight functions. In this paper we propose a general procedure to find weight functions which reduce the Godambe information and thus outperform pseudolikelihood in certain situations. The new procedu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Algorithms

سال: 2023

ISSN: ['1549-6333', '1549-6325']

DOI: https://doi.org/10.1145/3596494