# Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning

Xi Chen
Amit Levi

Electronic Colloquium on Computational Complexity (ECCC), pp. 1652019.

EI

Abstract:

We give a nearly-optimal algorithm for testing uniformity of distributions supported on $\{-1,1\}^n$, which makes $\tilde O (\sqrt{n}/\varepsilon^2)$ queries to a subcube conditional sampling oracle (Bhattacharyya and Chakraborty (2018)). The key technical component is a natural notion of random restriction for distributions on \$\{-1,1\...More

Code:

Data: