Communications of the ACM
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning 2u DNF formulas and ku decision trees
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Exact learning of read-twice DNF formulas (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Exact learning of read-k disjoint DNF and not-so-disjoint DNF
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
On the learnability of disjunctive normal form formulas and decision trees
On the learnability of disjunctive normal form formulas and decision trees
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
On learning visual concepts and DNF formulae
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On using the Fourier transform to learn Disjoint DNF
Information Processing Letters
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
Read-twice DNF formulas are properly learnable
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Machine Learning
Machine Learning
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
A simple algorithm for learning O(log n)-term DNF
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Generalized Graph Colorability and Compressibility of Boolean Formulae
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Learning Regular Sets with an Incomplete Membership Oracle
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Learning to reason the non monotonic case
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We study the learnability of Read-k-Satisfy-j (RkSj) DNF formulae. These are DNF formulae in which the maximal number of occurrences of a variable is bounded by k, and the number of terms satisfied by any assignment is at most j. We show that this class of functions is learnable in polynomial time, using Equivalence and Membership Queries, as long as k•j=O(logn/loglogn). Learnability was previously known only in case that both k and j are constants. We also present a family of boolean functions that have short (poly(n)) Read-2-Satisfy-1 DNF formulae but require CNF formulae of size 2Wn . Therefore, our result does not seem to follow from the recent learnability result of [Bsh93].