Example of a PAC learner
Candidate elimination
Algo returns f which is consistent with examples
Suppose H is finite
PAC if number of training examples is
> ln(d/|H|) / ln(1-e)
Distribution free learning
Previous slide
Next slide
Back to first slide
View graphic version