1.9k citations · 2k across the 12 of their papers we have counts for
6 papers · 1 filter
Collision-based Testers are Optimal for Uniformity and Closeness
Ilias Diakonikolas, Themis Gouleakis, John Peebles +1
We study the fundamental problems of (i) uniformity testing of a discrete distribution, and (ii) closeness testing between two discrete distributions with bounded -norm. Th…
Fourier-sparse interpolation without a frequency gap
Xue Chen, Daniel M. Kane, Eric Price +1
We consider the problem of estimating a Fourier-sparse signal from noisy samples, where the sampling is done over some interval and the frequencies can be "off-grid". Prev…
A Robust Sparse Fourier Transform in the Continuous Setting
Eric Price, Zhao Song
In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete se…
Optimal Lower Bound for Itemset Frequency Indicator Sketches
Eric Price
Given a database, a common problem is to find the pairs or -tuples of items that frequently co-occur. One specific problem is to create a small space "sketch" of the data that r…
Lower Bounds for Adaptive Sparse Recovery
Eric Price, David P. Woodruff
We give lower bounds for the problem of stable sparse recovery from /adaptive/ linear measurements. In this problem, one would like to estimate a vector from linea…
Efficient Sketches for the Set Query Problem
Eric Price
We develop an algorithm for estimating the values of a vector x in R^n over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we…