Testing Problems with Sub-Learning Sample Complexity
Abstract
Article Free Access Share on Testing problems with sub-learning sample complexity Authors: Michael Kearns AT&T Labs Research, 180 Park Avenue, Florham Park, NJ AT&T Labs Research, 180 Park Avenue, Florham Park, NJView Profile , Dana Ron Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MA Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MAView Profile Authors Info & Claims COLT' 98: Proceedings of the eleventh annual conference on Computational learning theoryJuly 1998 Pages 268–279https://doi.org/10.1145/279943.279996Online:24 July 1998Publication History 8citation169DownloadsMetricsTotal Citations8Total Downloads169Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cite
Text
Kearns and Ron. "Testing Problems with Sub-Learning Sample Complexity." Annual Conference on Computational Learning Theory, 1998. doi:10.1145/279943.279996Markdown
[Kearns and Ron. "Testing Problems with Sub-Learning Sample Complexity." Annual Conference on Computational Learning Theory, 1998.](https://mlanthology.org/colt/1998/kearns1998colt-testing/) doi:10.1145/279943.279996BibTeX
@inproceedings{kearns1998colt-testing,
title = {{Testing Problems with Sub-Learning Sample Complexity}},
author = {Kearns, Michael J. and Ron, Dana},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1998},
pages = {268-279},
doi = {10.1145/279943.279996},
url = {https://mlanthology.org/colt/1998/kearns1998colt-testing/}
}