WorldCat Identities

Kearns, Michael J.

Overview
Works: 12 works in 45 publications in 1 language and 1,438 library holdings
Genres: Conference proceedings 
Roles: Editor
Classifications: Q325.5, 006.3
Publication Timeline
Key
Publications about  Michael J Kearns Publications about Michael J Kearns
Publications by  Michael J Kearns Publications by Michael J Kearns
Most widely held works by Michael J Kearns
An introduction to computational learning theory by Michael J Kearns ( )
15 editions published between 1994 and 1997 in English and held by 1,061 WorldCat member libraries worldwide
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
The computational complexity of machine learning by Michael J Kearns ( Book )
8 editions published between 1989 and 1990 in English and held by 284 WorldCat member libraries worldwide
We are interested in the phenomenon of efficient learning in the distribution-free model, in the standard polynomial-time sense. Our results include general tools for determining the polynomial-time learnability of a concept-class, an extensive study of efficient learning when errors are present in the examples, and lower bounds on the number of examples required for learning in out model. A centerpiece of the thesis is a series of results demonstrating the computational difficulty of learning a number of well-studied concept classes. These results are obtained by reducing some apparently hard number-theoretic problems from cryptography to the learning problems. The hard-to-learn concept classes include the sets represented by Boolean formulae, deterministic finite automata and a simplified form of neural networks
Advances in neural information processing systems 10 : proceedings of the 1997 conference by Neural information processing systems ( Book )
12 editions published in 1998 in English and held by 67 WorldCat member libraries worldwide
Learning in the presence of malicious errors by Michael J Kearns ( Book )
1 edition published in 1987 in English and held by 5 WorldCat member libraries worldwide
Advances in neural information processing systems 11 : proceedings of the 1998 conference by Neural information processing systems ( Book )
2 editions published in 1999 in English and held by 5 WorldCat member libraries worldwide
Learning boolean formulae or finite automata is as hard as factoring by Michael J Kearns ( Book )
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
Advances in neural information processing systems 10 ( Book )
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
Public affairs : a study and proposal for the Illinois Department of Transportation by Michael J Kearns ( Book )
1 edition published in 1971 in English and held by 1 WorldCat member library worldwide
Nature of the porcine intestinal k88 receptor by Michael J Kearns ( Book )
1 edition published in 1979 in English and held by 1 WorldCat member library worldwide
Exact identification of read-once formulas using fixed points of amplification functions by Sally A Goldman ( Book )
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
We also describe extensions of our algorithms to handle high rates of noise, and to learn formulas of unbounded depth in Valiant's model with respect to specific distributions."
The Computational compleexity of machine learning ( Book )
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.59 (from 0.00 for The Comput ... to 1.00 for Nature of ...)
Languages
English (45)
Covers