23 citations · 32 across the 4 of their papers we have counts for
5 papers
Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation
Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour +2
We study maximum selection and sorting of numbers using pairwise comparators that output the larger of their two inputs if the inputs are more than a given threshold apart, and…
Universal Compression of Power-Law Distributions
Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky +2
English words and the outputs of many other natural processes are well-known to follow a Zipf distribution. Yet this thoroughly-established property has never been shown to help co…
Faster Algorithms for Testing under Conditional Sampling
Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky +2
There has been considerable recent interest in distribution-tests whose run-time and sample requirements are sublinear in the domain-size . We study two of the most important te…
Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling
Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky +1
The Poisson-sampling technique eliminates dependencies among symbol appearances in a random sequence. It has been used to simplify the analysis and strengthen the performance guara…
Near-optimal-sample estimators for spherical Gaussian mixtures
Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky +1
Statistical and machine-learning algorithms are frequently applied to high-dimensional data. In many of these applications data is scarce, and often much more costly than computati…