Sijian Tang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In the noisy population recovery problem of Dvir et al. [DRWY12], the goal is to learn an unknown distribution f on binary strings of length n from noisy samples. For some parameter µ ∈ [0, 1], a noisy sample is generated by flipping each coordinate of a sample from f independently with probability (1 − µ)/2. We assume an upper bound k on the size of the(More)
  • 1