On parallel attribute-efficient learning.
From MaRDI portal
Publication:1401979
DOI10.1016/S0022-0000(03)00047-3zbMath1055.68060MaRDI QIDQ1401979
Publication date: 19 August 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
RandomizationAuxiliary computationBinary codesLearning by queriesLimit of parallelizationMonotone Boolean functionsRelevant variablesSpecial assignment families
Related Items (6)
Attribute-efficient learning of Boolean functions from Post closed classes ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Exact learning of juntas from membership queries ⋮ On learning monotone Boolean functions with irrelevant variables ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Threshold Group Testing
Cites Work
- Unnamed Item
- Unnamed Item
- Improved algorithms for group testing with inhibitors
- Randomized group testing for mutually obscuring defectives
- Group testing with unreliable tests
- Attribute-efficient learning in query and mistake-bound models
- On the cut-off point for combinatorial group testing
- Adaptive versus nonadaptive attribute-efficient learning
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Optimal pooling designs with error detection
- Computational sample complexity and attribute-efficient learning
This page was built for publication: On parallel attribute-efficient learning.