An Introduction to Computational Learning Theory (The MIT Press)

3.9 avg rating
( 30 ratings by Goodreads )
 
9780262111935: An Introduction to Computational Learning Theory (The MIT Press)
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

About the Author:

Michael J. Kearns is Professor of Computer and Information Science at the University of Pennsylvania.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 70.00
US$ 66.87

Convert currency

Shipping: FREE
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Michael J. Kearns, Umesh V. Vazirani
Published by MIT Press Ltd, United States (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description MIT Press Ltd, United States, 1994. Hardback. Condition: New. Language: English . Brand New Book. 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. Seller Inventory # AAH9780262111935

More information about this seller | Contact this seller

Buy New
US$ 66.87
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

Michael J. Kearns (author), Umesh Vazirani (author)
Published by The MIT Press 1994-08-15, Cambridge, Mass. |London (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description The MIT Press 1994-08-15, Cambridge, Mass. |London, 1994. hardback. Condition: New. Seller Inventory # 9780262111935

More information about this seller | Contact this seller

Buy New
US$ 59.84
Convert currency

Add to Basket

Shipping: US$ 7.85
From United Kingdom to U.S.A.
Destination, rates & speeds

3.

Michael J. Kearns, Umesh V. Vazirani
Published by MIT Press Ltd, United States (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
Book Depository International
(London, United Kingdom)
Rating
[?]

Book Description MIT Press Ltd, United States, 1994. Hardback. Condition: New. Language: English . Brand New Book. 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. Seller Inventory # AAH9780262111935

More information about this seller | Contact this seller

Buy New
US$ 68.46
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

Michael J. KearnsUmesh V. Vazirani
Published by MIT Press
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Quantity Available: > 20
Seller:
INDOO
(Avenel, NJ, U.S.A.)
Rating
[?]

Book Description MIT Press. Condition: New. Brand New. Seller Inventory # 0262111934

More information about this seller | Contact this seller

Buy New
US$ 68.07
Convert currency

Add to Basket

Shipping: US$ 3.60
Within U.S.A.
Destination, rates & speeds

5.

Michael J. Kearns
Published by MIT Press Ltd
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
THE SAINT BOOKSTORE
(Southport, United Kingdom)
Rating
[?]

Book Description MIT Press Ltd. Hardback. Condition: New. New copy - Usually dispatched within 2 working days. Seller Inventory # B9780262111935

More information about this seller | Contact this seller

Buy New
US$ 63.67
Convert currency

Add to Basket

Shipping: US$ 9.08
From United Kingdom to U.S.A.
Destination, rates & speeds

6.

Kearns, Michael J.
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Quantity Available: 4
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description 1994. HRD. Condition: New. New Book.Shipped from US within 10 to 14 business days. Established seller since 2000. Seller Inventory # IB-9780262111935

More information about this seller | Contact this seller

Buy New
US$ 70.53
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

7.

Michael J. Kearns
Published by MIT Press (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Quantity Available: 1
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description MIT Press, 1994. HRD. Condition: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Seller Inventory # WM-9780262111935

More information about this seller | Contact this seller

Buy New
US$ 65.37
Convert currency

Add to Basket

Shipping: US$ 11.77
From United Kingdom to U.S.A.
Destination, rates & speeds

8.

Michael J. Kearns, Umesh Vazirani
Published by The MIT Press (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description The MIT Press, 1994. Hardcover. Condition: New. Seller Inventory # DADAX0262111934

More information about this seller | Contact this seller

Buy New
US$ 78.75
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

9.

Michael J. Kearns, Umesh V. Vazirani
Published by MIT Press Ltd, United States (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description MIT Press Ltd, United States, 1994. Hardback. Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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. Seller Inventory # BTE9780262111935

More information about this seller | Contact this seller

Buy New
US$ 89.15
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

10.

Kearns, Michael J.
Published by The MIT Press (1994)
ISBN 10: 0262111934 ISBN 13: 9780262111935
New Hardcover Quantity Available: 1
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description The MIT Press, 1994. Hardcover. Condition: New. Never used!. Seller Inventory # 0262111934

More information about this seller | Contact this seller

Buy New
US$ 90.42
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book