597 search results - page 1 / 120 » Dominating Distributions and Learnability |
COLT
1992
Springer
13 years 9 months ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...
BIOINFORMATICS
2012
11 years 7 months ago
2012
ALT
1997
Springer
13 years 9 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
ECML
2003
Springer
13 years 10 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...