Leonard Pitt. Recent results in computational learning theory, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On The Sample Complexity Of Pac-Learning Using Random And Chosen .. - Eisenberg (1991) (19 citations) (Correct)
....mentioned here are based on differing definitions of the pac learning model: one in which the hypothesis concept must come from the same concept class as the target concept, and one in which the hypothesis concept may come from a different class than the target concept. In 1986, Pitt and Valiant [16] showed that given a pac learning model in which the output hypothesis concept must come from the same concept class as the target concept, the computational complexity to pac learn certain concept classes is not polynomial. They proved that if finding a consistent hypothesis from the same class ....
Leonard Pitt. Recent results in computational learning theory, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC