Almost optimal distribution-free junta testing
From MaRDI portal
Publication:5091752
Cites work
- A \(o(n)\) monotonicity tester for Boolean functions over the hypercube
- A lower bound for testing juntas
- A polynomial lower bound for testing monotonicity
- Algorithmic and analysis techniques in property testing
- An O(n) queries adaptive tester for unateness
- Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness
- Boolean function monotonicity testing requires (almost) \(n^{1/2}\) non-adaptive queries
- Distribution-Free Property-Testing
- Distribution-free testing for monomials with a sublinear number of queries
- Distribution-free testing lower bound for basic Boolean functions
- scientific article; zbMATH DE number 1453048 (Why is no real title available?)
- Improved Bounds for Testing Juntas
- Learning functions of \(k\) relevant variables
- Monotonicity testing over general poset domains
- Optimal testing of Reed-Muller codes
- Property testing and its connection to learning and approximation
- Property testing. Current research and surveys
- Robust Characterizations of Polynomials with Applications to Program Testing
- Selection of relevant features and examples in machine learning
- Self-testing/correcting with applications to numerical problems
- Settling the query complexity of non-adaptive junta testing
- Testing Basic Boolean Formulae
- Testing Fourier dimensionality and sparsity
- Testing Halfspaces
- Testing juntas nearly optimally
- Testing monotonicity
- Testing Reed–Muller Codes
- Testing ±1-weight halfspace
- Tight bounds for testing k-linearity
- Tight bounds for the distribution-free testing of monotone conjunctions
Cited in
(5)
This page was built for publication: Almost optimal distribution-free junta testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091752)
