Almost Optimal Distribution-free Junta Testing.
Leibniz International Proceedings in Informatics(2019)
摘要
We consider the problem of testing whether an unknown n-variable Boolean function is a k-junta in the distribution-free property testing model, where the distance between functions is measured with respect to an arbitrary and unknown probability distribution over {0,1}(n). Chen, Liu, Servedio, Sheng and Xie [35] showed that the distribution-free k-junta testing can be performed, with one-sided error, by an adaptive algorithm that makes (O) over tilde (k(2))/epsilon queries. In this paper, we give a simple two-sided error adaptive algorithm that makes (O) over tilde (k/epsilon) queries.
更多查看译文
关键词
Distribution-free property testing,k-Junta
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络