Computational Sample Complexity
Published in SIAM Journal on Computing • Jan 1, 2000
Authors:,,
Scott E. Decatur
Oded Goldreich
Dana Ron
Abstract
In a variety of PAC learning models, a trade-off between time and information seems to exist: with unlimited time, a small amount of information suffices, but with time restrictions, more information sometimes seems to be required. In addition, it has long been known that there are concept classes t...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!