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."
Kategorije:
Godina:
1990
Izdavač:
MIT Press
Jezik:
english
Strane:
194
ISBN 10:
0262111527
ISBN 13:
9780262111522
Serije:
ACM Distinguished Dissertation
Fajl:
PDF, 777 KB
IPFS:
,
english, 1990
Amazon 
Barnes & Noble 
Bookshop.org 
File converter
Više rezultata pretrage
More benefits 
