368 citations · 931 across the 39 of their papers we have counts for
4 papers · 1 filter
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…
Competitive Distribution Estimation
Alon Orlitsky, Ananda Theertha Suresh
Estimating an unknown distribution from its samples is a fundamental problem in statistics. The common, min-max, formulation of this goal considers the performance of the best esti…
Automata and Graph Compression
Mehryar Mohri, Michael Riley, Ananda Theertha Suresh
We present a theoretical framework for the compression of automata, which are widely used in speech processing and other natural language processing tasks. The framework extends to…