Symmetric Norm Estimation and Regression on Sliding Windows

by   Vladimir Braverman, et al.

The sliding window model generalizes the standard streaming model and often performs better in applications where recent data is more important or more accurate than data that arrived prior to a certain time. We study the problem of approximating symmetric norms (a norm on ℝ^n that is invariant under sign-flips and coordinate-wise permutations) in the sliding window model, where only the W most recent updates define the underlying frequency vector. Whereas standard norm estimation algorithms for sliding windows rely on the smooth histogram framework of Braverman and Ostrovsky (FOCS 2007), analyzing the smoothness of general symmetric norms seems to be a challenging obstacle. Instead, we observe that the symmetric norm streaming algorithm of Braverman et. al. (STOC 2017) can be reduced to identifying and approximating the frequency of heavy-hitters in a number of substreams. We introduce a heavy-hitter algorithm that gives a (1+ϵ)-approximation to each of the reported frequencies in the sliding window model, thus obtaining the first algorithm for general symmetric norm estimation in the sliding window model. Our algorithm is a universal sketch that simultaneously approximates all symmetric norms in a parametrizable class and also improves upon the smooth histogram framework for estimating L_p norms, for a range of large p. Finally, we consider the problem of overconstrained linear regression problem in the case that loss function that is an Orlicz norm, a symmetric norm that can be interpreted as a scale-invariant version of M-estimators. We give the first sublinear space algorithms that produce (1+ϵ)-approximate solutions to the linear regression problem for loss functions that are Orlicz norms in both the streaming and sliding window models.


page 1

page 2

page 3

page 4


Numerical Linear Algebra in the Sliding Window Model

We initiate the study of numerical linear algebra in the sliding window ...

Efficient Symmetric Norm Regression via Linear Sketching

We provide efficient algorithms for overconstrained linear regression pr...

Private Data Stream Analysis for Universal Symmetric Norm Estimation

We study how to release summary statistics on a data stream subject to t...

Universal Streaming of Subset Norms

Most known algorithms in the streaming model of computation aim to appro...

Differentially Private L_2-Heavy Hitters in the Sliding Window Model

The data management of large companies often prioritize more recent data...

Flattened Exponential Histogram for Sliding Window Queries over Data Streams

The Basic Counting problem [1] is one of the most fundamental and critic...

Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model

We consider the Maximum-weight Matching (MWM) problem in the streaming s...

Please sign up or login with your details

Forgot password? Click here to reset