Abstract
In this paper, the PAC learnability of decision rules for pattern classification under a family of probability measures is investigated. It is shown that uniform boundedness of the metric entropy of the class of decision rules is both necessary and sufficient for learnability if the family of probability measures is either compact, or contains an interior point, with respect to total variation metric. Then it is shown that learnability is preserved under finite unions of families of probability measures, and also that learnability with respect to each of a finite number of measures implies learnability with respect to the convex hull of the families of 'commensurate' probability measures.
| Original language | English (US) |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Applied Mathematics
- Modeling and Simulation