Adaptive Versus Nonadaptive Attribute-Efficient Learning
Reads0
Chats0
TLDR
A graph-theoretic characterization of nonadaptive learning families, called r-wise bipartite connected families, are given and it is proved that the optimal query number O(2r + r log n) can be already achieved in O(r) stages.Abstract:
We study the complexity of learning arbitrary Boolean functions of n variables by membership queries, if at most r variables are relevant. Problems of this type have important applications in fault searching, e.g. logical circuit testing and generalized group testing. Previous literature concentrates on special classes of such Boolean functions and considers only adaptive strategies. First we give a straightforward adaptive algorithm using O(r2r log n) queries, but actually, most queries are asked nonadaptively. This leads to the problem of purely nonadaptive learning. We give a graph-theoretic characterization of nonadaptive learning families, called r-wise bipartite connected families. By the probabilistic method we show the existence of such families of size O(r2r log n + r22r). This implies that nonadaptive attribute-efficient learning is not essentially more expensive than adaptive learning. We also sketch an explicit pseudopolynomial construction, though with a slightly worse bound. It uses the common derandomization technique of small-biased k-independent sample spaces. For the special case r e 2, we get roughly 2.275 log n adaptive queries, which is fairly close to the obvious lower bound of 2 log n. For the class of monotone functions, we prove that the optimal query number O(2r + r log n) can be already achieved in O(r) stages. On the other hand, Ω(2r log n) is a lower bound on nonadaptive queries.read more
Citations
More filters
Book ChapterDOI
Threshold group testing
TL;DR: It is shown that the p positive elements can be determined up to a constant number of misclassifications, bounded by the gap between the thresholds, and the number of tests needed to achieve this goal if n elements are given.
Journal ArticleDOI
Threshold Group Testing
TL;DR: It is shown that the p positive elements can be determined up to a constant number of misclassifications, bounded by the gap between the thresholds, and a two-phase strategy consisting of a Distill and a Compress phase is proposed.
Journal ArticleDOI
Asymptotic and constructive methods for covering perfect hash families and covering arrays
TL;DR: Applying two probabilistic methods to covering perfect hash families improves upon the asymptotic upper bound for the minimum number of rows in a covering array with v symbols, k columns, and strength t.
Journal ArticleDOI
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems
TL;DR: This work proposes a locating array (LA) as a screening design and presents preliminary results applying an LA for screening the response of TCP throughput in a simulation model of a mobile wireless network.
Journal ArticleDOI
Point placement on the line by distance data
TL;DR: This work gives a simple efficient algorithm which produces a representation of all linear layouts if the given graph is chordal, and shows that if the learner knows in advance that the n points have distinct locations, 3/2n queries in 2 rounds will be sufficient.
References
More filters
Book
Randomized Algorithms
TL;DR: This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.
Journal ArticleDOI
Queries and Concept Learning
TL;DR: This work considers the problem of using queries to learn an unknown concept, and several types of queries are described and studied: membership, equivalence, subset, superset, disjointness, and exhaustiveness queries.
Journal ArticleDOI
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
TL;DR: This work presents one such algorithm that learns disjunctive Boolean functions, along with variants for learning other classes of Boolean functions.
BookDOI
CRC Handbook of Combinatorial Designs
TL;DR: Balanced Incomplete Block Designs and t-Designs2-(v,k,l) Designs of Small OrderBIBDs with Small Block Sizet-designs, t = 3Steiner SystemsSymmetric DesignsResolvable and Near Resolvable DesignsLatin Squares, MOLS, and Orthogonal ArraysLatin SquareMutually Orthogonomic Latin Squares (MOLS)Incomplete MOLsOrthogonal ARrays of Index More Than OneOrthoghonal Array of Strength More Than TwoPairwise Balanced Designs
Book
Combinatorial Group Testing and Its Applications
Ding-Zhu Du,Frank K. Hwang +1 more
TL;DR: This book attempts to cover the theory and applications of combinatorial group testing in one place.