Adaptive versus nonadaptive attribute-efficient learning

DOI10.1023/A:1007616604496zbMath0965.68029WikidataQ60962396 ScholiaQ60962396MaRDI QIDQ1592383

Peter Damaschke

Publication date: 16 January 2001

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

membershipnonadaptive attribute-efficient learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (19)

On a combinatorial framework for fault characterization ⋮ 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 ⋮ Strengthening hash families and compressive sensing ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ On parallel attribute-efficient learning. ⋮ Approximate location of relevant variables under the crossover distribution. ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Almost Optimal Testers for Concise Representations. ⋮ On learning monotone Boolean functions with irrelevant variables ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Partial covering arrays: algorithms and asymptotics ⋮ The complexity of exact learning of acyclic conditional preference networks from swap examples ⋮ Learning of monotone functions with single error correction ⋮ Cover starters for covering arrays of strength two ⋮ Threshold Group Testing ⋮ Point placement on the line by distance data. ⋮ Theory revision with queries: Horn, read-once, and parity formulas

This page was built for publication: Adaptive versus nonadaptive attribute-efficient learning