73 search results - page 2 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
JCSS
2007
13 years 5 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
IANDC
2006
13 years 5 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
COLT
1991
Springer
13 years 9 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
ECCC
2002
13 years 5 months ago
2002
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
ICML
1999
IEEE
14 years 6 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...