COLT '90 Proceedings of the third annual workshop on Computational learning theory
Learning read-once formulas over fields and extended bases
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On learning ring-sum-expansions
SIAM Journal on Computing
Learning read-once formulas with queries
Journal of the ACM (JACM)
Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning embedded symmetric concepts
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Machine Learning
Machine Learning
On the learnability of Zn-DNF formulas (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
On-line learning with malicious noise and the closure algorithm
Annals of Mathematics and Artificial Intelligence
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We investigate the problem of learning disjunctions of counting functions, generalizations of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q≥2, is polynomial time learnable using at most n+1 equivalence queries. The hypotheses issued by the learner are disjunctions of at most n counting functions with weights from Zp. In general a counting function may have a composite modulus. We prove that, for any given integer q≥2, over the domain Zn2, the class of read-once disjunctions of Boolean-weighted counting functions with modulus q is polynomial time learnable with only one equivalence query and O(nq) membership queries. And the class of disjunctions of loglogn Boolean-weighted counting functions with modulus q is polynomial time learnable.