A sufficient condition for polynomial distribution-dependent learnability
β Scribed by Martin Anthony; John Shawe-Taylor
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 741 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
We investigate upper bounds on the sample-size sufficient for 'solid' learnability with respect to a probability distribution. Extending analysis of Ben-David et al. (1989, 1995) and Bendek and Itai (1991) we obtain a sufficient condition for feasible (polynomially bounded) sample-size bounds for distribution-specific (solid) learnability.
π SIMILAR VOLUMES
In this paper a su cient condition for a cone of polynomials to be Hurwitz is established. Such condition is a matrix inequality, which gives a simple algebraic test for the stability of rays of polynomials. As an application to stable open-loop systems, a cone of gains c such that the function u =