Encyclopedia > Probably approximately correct learning
Probably approximately correct learning (PAC learning) is a framework of learning that was proposed by Leslie Valiant in his paper A theory of the learnable. Leslie Valiant was educated at Kings College, Cambridge, Imperial College London; and at Warwick University where he received his Ph. ...
In this framework the learner gets samples that are classified according to a function from a certain class. The aim of the learner is to find a bounded approximation (approximately) of the function with high probability (probably). The learner must be able to learn the concept given any arbitrary approximation ratio, probability of success, or distribution of the samples.
The model was further extended to treat noise (misclassified samples). The PAC framework allowed accurate mathematical analysis of learning.
Also critical are definitions of efficiency. In particular, finding efficient classifiers (time and space requirements bounded to a polynomial of the example size) with efficient learning procedures (requiring an example count bounded to a polynomial of the concept size, modified by the approximation and likelihood bounds).
PAC learning framework is part of computational learning theory. In statistics, computational learning theory is a mathematical field related to the analysis of machine learning algorithms. ...
References
L. Valiant. A theory of the learnable. Communications of the ACM, 27, 1984. The paper that proposed the PAC learning framework.
M. Kearns, U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994. A textbook.
External link
Probably Approximately Correct Learning - excellent introduction to the topic
Probablyapproximatelycorrectlearning (PAC learning) is a framework of learning that was proposed by Leslie Valiant in his paper A theory of the learnable.
The aim of the learner is to find a bounded approximation (approximately) of the function with high probability (probably).
PAC learning framework is part of computational learning theory.
In theoretical computer science, computational learning theory is a mathematical field related to the analysis of machine learning algorithms.
Because the training set is finite and the future is uncertain, learning theory usually does not yield absolute guarantees of performance of the algorithms.
Probablyapproximatelycorrectlearning (PAC learning), proposed by Leslie Valiant;