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

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 exampl...

Full description

Bibliographic Details
Main Author: Eisenberg, Bronwyn Bonnie
Other Authors: Rivest, Ronald L.
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149723
_version_ 1826188609983610880
author Eisenberg, Bronwyn Bonnie
author2 Rivest, Ronald L.
author_facet Rivest, Ronald L.
Eisenberg, Bronwyn Bonnie
author_sort Eisenberg, Bronwyn Bonnie
collection MIT
description 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.
first_indexed 2024-09-23T08:02:11Z
id mit-1721.1/149723
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T08:02:11Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1497232023-03-30T04:25:20Z On the Sample Complexity of PAC-learning using Random and Chosen Examples Eisenberg, Bronwyn Bonnie Rivest, Ronald L. 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. 2023-03-29T15:18:48Z 2023-03-29T15:18:48Z 1992-03 https://hdl.handle.net/1721.1/149723 26707573 MIT-LCS-TR-535 application/pdf
spellingShingle Eisenberg, Bronwyn Bonnie
On the Sample Complexity of PAC-learning using Random and Chosen Examples
title On the Sample Complexity of PAC-learning using Random and Chosen Examples
title_full On the Sample Complexity of PAC-learning using Random and Chosen Examples
title_fullStr On the Sample Complexity of PAC-learning using Random and Chosen Examples
title_full_unstemmed On the Sample Complexity of PAC-learning using Random and Chosen Examples
title_short On the Sample Complexity of PAC-learning using Random and Chosen Examples
title_sort on the sample complexity of pac learning using random and chosen examples
url https://hdl.handle.net/1721.1/149723
work_keys_str_mv AT eisenbergbronwynbonnie onthesamplecomplexityofpaclearningusingrandomandchosenexamples