Almost Optimal Distribution-free Junta Testing
January 01, 2019 Β· Declared Dead Β· π Cybersecurity and Cyberforensics Conference
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted