Exact Learning of Formulas in Parallel

Authors:
Nader H. Bshouty
Affiliations:
Department of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4 Email: bshouty@cpsc.ucalgary.ca
Venue:
Machine Learning
Year:
1997

Citing 15
Cited 7

A theory of the learnable

Communications of the ACM
Identifying μ-formula decision trees with queries

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
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 in parallel

Information and Computation
Asking questions to minimize errors

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
An optimal parallel algorithm for learning DFA

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts

Machine Learning
Learning Boolean read-once formulas over generalized bases

Journal of Computer and System Sciences
An algorithm to learn read-once threshold formulas, and transformations between learning models

Computational Complexity
Towards the learnability of DNF formulae

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Queries and Concept Learning

Machine Learning
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

Machine Learning
Queries and Concept Learning

Machine Learning

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

Theoretical Computer Science - Algorithmic learning theory
Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Exploring Learnability between Exact and PAC

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Exploring learnability between exact and PAC

Journal of Computer and System Sciences - Special issue on COLT 2002
On exact learning halfspaces with random consistent hypothesis oracle

ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On the learnability of shuffle ideals

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
On the learnability of shuffle ideals

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the parallel complexity of learningformulas from membership and equivalence queries. We show thatmany restricted classes of boolean functions cannot beefficiently learned in parallel with a polynomial number of processors.