Testing Distribution Identity Efficiently - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Testing Distribution Identity Efficiently - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: We consider the problem of testing distribution identity. Given a sequence ofindependent samples from an unknown distribution on a domain of size n, thegoal is to check if the unknown distribution approximately equals a knowndistribution on the same domain. While Batu, Fortnow, Fischer, Kumar,Rubinfeld, and White FOCS 2001 proved that the sample complexity of theproblem is O~sqrtn * poly1-epsilon, the running time of their tester ismuch higher: On + O~sqrtn * poly1-epsilon. We modify their tester toachieve a running time of O~sqrtn * poly1-epsilon.



Author: Krzysztof Onak

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents