Linear time deterministic learning of k-term DNF
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
SIAM Journal on Computing
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
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)
Exact learning Boolean functions via the monotone theory
Information and Computation
Generalized teaching dimensions and the query complexity of learning
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)
A subexponential exact learning algorithm for DNF using equivalence queries
Information Processing Letters
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
On the limits of proper learnability of subclasses of DNF formulas
Machine Learning - Special issue on COLT '94
Simple learning algorithms using divide and conquer
Computational Complexity
A simple algorithm for learning O (log n)-term DNF
Information Processing Letters
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Equational characterizations of Boolean function classes
Discrete Mathematics
On generalized constraints and certificates
Discrete Mathematics
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Oracles in Sigmap2 are Sufficient for Exact Learning
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Learning DNF by Approximating Inclusion-Exclusion Formulae
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th 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
On the proper learning of axis-parallel concepts
The Journal of Machine Learning Research
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning conditional preference networks
Artificial Intelligence
A canonical form for testing boolean function properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
ALLQBF solving by computational learning
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We show the following: (a) For any @e0, log^(^3^+^@e^)n-term DNF cannot be polynomial-query learned with membership and strongly proper equivalence queries. (b) For sufficiently large t, t-term DNF formulas cannot be polynomial-query learned with membership and equivalence queries that use t^1^+^@e-term DNF formulas as hypotheses, for some @e