The Computational Complexity of Machine Learning
Michael J. Kearns
We also give algorithms for learning powerful concept classes under the uniform distribution, and give equivalences between natural models of efficient learnability. This thesis also includes detailed definitions and motivation for the distribution-free model, a chapter discussing past research in this model and related models, and a short list of important open problems."
კატეგორია:
წელი:
1990
გამომცემლობა:
MIT Press
ენა:
english
გვერდები:
194
ISBN 10:
0262111527
ISBN 13:
9780262111522
ფაილი:
PDF, 737 KB
IPFS:
,
english, 1990