Negative Results for Equivalence Queries
Machine Learning
Identifying μ-formula decision trees with queries
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning in the presence of finitely or infinitely many irrelevant attributes
Journal of Computer and System Sciences
On the power of equivalence queries
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Complexity of identification and dualization of positive Boolean functions
Information and Computation
Exact learning Boolean functions via the monotone theory
Information and Computation
Learning restricted-read branching programs with queries
Learning restricted-read branching programs with queries
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Attribute-efficient learning in query and mistake-bound models
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Machine Learning
Computational Aspects of Parallel Attribute-Efficient Learning
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
PAC learning with irrelevant attributes
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On attribute efficient and non-adaptive learning of parities and DNF expressions
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Hi-index | 0.00 |
We prove the following results. Any Boolean function of O(log n) relevant variables can be exactly learned with a set of non-adaptive membership queries alone and a minimum sized decision tree representation of the function constructed, in polynomial time. In contrast, such a function cannot be exactly learned with equivalence queries alone using general decision trees and other representation classes as hypotheses. Our results imply others which may be of independent interest. We show that truth-table minimization of decision trees can be done in polynomial time, complementing the well-known result of Masek that truth-table minimization of DNF formulas is NP-hard. The proofs of our negative results show that general decision trees and related representations are not learnable in polynomial time using equivalence queries alone, confirming a folklore theorem.