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...
Main Author: | Eisenberg, Bronwyn Bonnie |
---|---|
Other Authors: | Rivest, Ronald L. |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149723 |
Similar Items
-
PAC learning with generalized samples and an application to stochastic geometry
Published: (2002) -
Sample-Efficient Proper PAC Learning with Approximate Differential Privacy
by: Ghazi, Badih, et al.
Published: (2022) -
Many are called, few are chosen.
by: Goding, C
Published: (2011) -
Computable PAC Learning of Continuous Features
by: Ackerman, Nathanael, et al.
Published: (2022) -
Dopamine neurons learn relative chosen value from probabilistic rewards
by: Lak, A, et al.
Published: (2016)