Faster Algorithms for Testing under Conditional Sampling

author: Ananda Theertha Suresh, Department of Computer Science and Engineering, UC San Diego
published: Aug. 20, 2015,   recorded: July 2015,   views: 1908


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


There has been considerable recent interest in distribution-tests whose run-time and sample requirements are sublinear in the domain-size $k$. We study two of the most important tests under the conditional-sampling model where each query specifies a subset $S$ of the domain, and the response is a sample drawn from $S$ according to the underlying distribution. For identity testing, which asks whether the underlying distribution equals a specific given distribution or $\delta$-differs from it, we reduce the known time and sample complexities from $O(\delta^{-4})$ to $O(\delta^{-2})$, thereby matching the information theoretic lower bound. For closeness testing, which asks whether two distributions underlying observed data sets are equal or different, we reduce existing complexity from $O(\delta^{-4} \log^5 k)$ to an even sub-logarithmic $O(\delta^{-5} \log \log k)$, and providing a better bound to an open problem in Bertinoro Workshop on Sublinear Algorithms.

See Also:

Download slides icon Download slides: colt2015_suresh_conditional_sampling_01.pdf (170.7┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: