An Introduction to Computational Learning Theory (The MIT Press)
Kearns, Michael J
Sold by WorldofBooks, Goring-By-Sea, WS, United Kingdom
AbeBooks Seller since 16 March 2007
Used - Hardcover
Condition: Fair
Quantity: 1 available
Add to basketSold by WorldofBooks, Goring-By-Sea, WS, United Kingdom
AbeBooks Seller since 16 March 2007
Condition: Fair
Quantity: 1 available
Add to basketA readable copy of the book which may include some defects such as highlighting and notes. Cover and pages may be creased and show discolouration.
Seller Inventory # GOR014325333
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani introduce a number of central topics in computational learning theory for researchers and students in artificial intelligence, neural networks, theoretical computer science, and statistics.
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani introduce a number of central topics in computational learning theory for researchers and students in artificial intelligence, neural networks, theoretical computer science, and statistics. Computational learning theory is a new and rapidly expanding area of research that examines formal models of induction with the goals of discovering the common methods underlying efficient learning algorithms and identifying the computational impediments to learning. Each topic in the book has been chosen to elucidate a general principle, which is explored in a precise formal setting. Intuition has been emphasized in the presentation to make the material accessible to the nontheoretician while still providing precise arguments for the specialist. This balance is the result of new proofs of established theorems, and new presentations of the standard proofs. The topics covered include the motivation, definitions, and fundamental results, both positive and negative, for the widely studied L. G. Valiant model of Probably Approximately Correct Learning; Occam's Razor, which formalizes a relationship between learning and data compression; the Vapnik-Chervonenkis dimension; the equivalence of weak and strong learning; efficient learning in the presence of noise by the method of statistical queries; relationships between learning and cryptography, and the resulting computational limitations on efficient learning; reducibility between learning problems; and algorithms for learning finite automata from active experimentation.
"About this title" may belong to another edition of this title.
WorldofBooks.com fully embraces the AbeBooks terms and conditions and we will do
what we can to resolve any issues.
Orders ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.