Almost Optimal Distribution-free Junta Testing

January 01, 2019 Β· Declared Dead Β· πŸ› Cybersecurity and Cyberforensics Conference

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nader H. Bshouty arXiv ID 1901.00717 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CC Citations 23 Venue Cybersecurity and Cyberforensics Conference Last Checked 3 months ago
Abstract
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 function is measured with respect to an arbitrary and unknown probability distribution over $\{0,1\}^n$. Chen, Liu, Servedio, Sheng and Xie showed that the distribution-free $k$-junta testing can be performed, with one-sided error, by an adaptive algorithm that makes $\tilde O(k^2)/Ξ΅$ queries. In this paper, we give a simple two-sided error adaptive algorithm that makes $\tilde O(k/Ξ΅)$ queries.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted