Learning regular sets from queries and counterexamples
Information and Computation
Negative Results for Equivalence Queries
Machine Learning
Interpolation and approximation of sparse multivariate polynomials over GF(2)
SIAM Journal on Computing
On zero-testing and interpolation of k -sparse multivariate polynomials over finite fields
Theoretical Computer Science
Learning k-term DNF formulas with an incomplete membership oracle
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning read-once formulas with queries
Journal of the ACM (JACM)
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Inference of finite automata using homing sequences
Information and Computation
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
Machine Learning - Special issue on computational learning theory
Fast learning of k-term DNF formulas with queries
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Learning with unreliable boundary queries
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Simple learning algorithms using divide and conquer
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Asking questions to minimize errors
Journal of Computer and System Sciences
How many queries are needed to learn?
Journal of the ACM (JACM)
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A simple algorithm for learning O(log n)-term DNF
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
Machine Learning
Machine Learning
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the applications of multiplicity automata in learning
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Exact learning via the Monotone theory
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we study the query complexity of finding local minimum points of a boolean function. This task occurs frequently in exact learning algorithms for many natural classes, such as monotone DNF, O (log n)-term DNF, unate DNF, and decision trees. On the negative side, we prove that any (possibly randomized) algorithm that produces a local minimum of a function f chosen from a sufficiently "rich" concept class, using a membership oracle for f, must ask (n2) membership queries in the worst case. In particular, this lower bound applies to the class of decision trees. A simple algorithm is known that achieves this lower bound. On the positive side, we show that for the class O (log n)-term DNF finding local minimum points requires only (n log n) membership queries (and more generally (tn) membership queries for t-term DNF with tn). This efficient procedure improves the time and query complexity of known learning algorithms for the class O (log n)-term DNF. 2001 Elsevier Science.