MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Reports (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On the Sample Complexity of PAC-learning using Random and Chosen Examples

Author(s)
Eisenberg, Bronwyn Bonnie
Thumbnail
DownloadMIT-LCS-TR-535.pdf (1.484Mb)
Advisor
Rivest, Ronald L.
Metadata
Show full item record
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.
Date issued
1992-03
URI
https://hdl.handle.net/1721.1/149723
Series/Report no.
MIT-LCS-TR-535

Collections
  • LCS Technical Reports (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.