1011300

9780262111935

Introduction to Computational Learning Theory
Introduction to Computational Learning Theory
$65.66
$3.95 Shipping
  • Condition: New
  • Provider: GreatBookPrices2 Contact
  • Provider Rating:
    63%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Please allow 4-14 business days for Media Mail delivery. Brand New, Perfect Condition, 100% Money Back Guarantee, Over 1,000,000 customers served

   30-day money back guarantee
$65.66
$3.95 Shipping
  • Condition: Like New
  • Provider: GreatBookPrices2 Contact
  • Provider Rating:
    63%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Please allow 4-14 business days for Media Mail delivery. Brand New, Perfect Condition, 100% Money Back Guarantee, Over 1,000,000 customers served

   30-day money back guarantee
$40.53
$3.95 Shipping

Your due date: 12/14/2016

How do rentals work?
$53.00
List Price
$53.00
Discount
23% Off
You Save
$12.47

  • Condition: Acceptable
  • Provider: CampusBookRentals Contact
  • Provider Rating:
    93%
  • Ships From: Ogden, UT
  • Shipping: Standard, Expedited (tracking available)
  • Comments: We serve students on over 5,871 college campuses every semester! Highlighting and writing is OK! Get a tracking number with every order. Questions? Or just want to hear our voice? Call us toll free anytime at 855-200-0021 or email us at valore@CampusBookR

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9780262111935
  • ISBN: 0262111934
  • Publication Date:
  • Publisher: Mit Pr

AUTHOR

SUMMARY

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.Kearns, Michael J. is the author of 'Introduction to Computational Learning Theory', published 1994 under ISBN 9780262111935 and ISBN 0262111934.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.