𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learnability theory

✍ Scribed by Fulop, Sean A.; Chater, Nick


Book ID
120165572
Publisher
Wiley (John Wiley & Sons)
Year
2013
Tongue
English
Weight
124 KB
Volume
4
Category
Article
ISSN
1939-5078

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A theory of learnability
✍ Yoshinori Uesaka; Teruaki Aizawa; Terumasa Ebara; Kazuhiko Ozeki πŸ“‚ Article πŸ“… 1973 πŸ› Springer-Verlag 🌐 English βš– 751 KB
A theory of the learnable
✍ Valiant, L. G. πŸ“‚ Article πŸ“… 1984 πŸ› Association for Computing Machinery 🌐 English βš– 783 KB
First-order jk-clausal theories are PAC-
✍ Luc De Raedt; SaΕ‘o DΕΎeroski πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 967 KB

We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first-order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomial-sample polynomial-time PAC-learnable with o

Nonuniform learnability
✍ Gyora M. Benedek; Alon Itai πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 685 KB

The learning model of Valiant is extended to allow the number of examples required for learning to depend on the particular concept to be learned, instead of requiring a uniform bound for all concepts of a concept class. This extension, called nonuniform learning, enables learning many concept class