# On the Necessity of Occam Algorithms

@inproceedings{Board1990OnTN, title={On the Necessity of Occam Algorithms}, author={Raymond A. Board and Leonard Pitt}, booktitle={STOC}, year={1990} }

- Published in STOC 1990
DOI:10.1145/100216.100223

The distribution-independent model of concept learning from examples ("PAC-learning") due to Valiant [15] is investigated. It has been shown that the existence of an Occarn algorithm for a class of concepts is a sufficient condition for the PAC-learnability of that class [2, 3]. (An Occam algorithm is a randomized polynomial-time algorithm that, when given as input a sample of strings of some unknown concept to be learned, outputs a small description of a concept that is consistent with the… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Learning nested differences of intersection-closed concept classes

VIEW 1 EXCERPT

CITES BACKGROUND