On the Sample Complexity of PAC-learning using Random and Chosen Examples
| dc.contributor.advisor | Rivest, Ronald L. | en_US |
| dc.contributor.author | Eisenberg, Bronwyn Bonnie | en_US |
| dc.date.accessioned | 2023-03-29T15:18:48Z | |
| dc.date.available | 2023-03-29T15:18:48Z | |
| dc.date.issued | 1992-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149723 | |
| dc.description.abstract | Two protocols used for learning under the pac-learning model introduced by Valiant are learning from random examples and learning from memberships queries. Membership queries have been used to efficiently and exactly learn a concept class C that is too difficult to pac-learn using random examples. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-535 | |
| dc.title | On the Sample Complexity of PAC-learning using Random and Chosen Examples | en_US |
| dc.identifier.oclc | 26707573 |
